./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/forester-heap/sll-optional-1.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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:12:02,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:12:02,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:12:02,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:12:02,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:12:02,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:12:02,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:12:02,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:12:02,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:12:02,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:12:02,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:12:02,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:12:02,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:12:02,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:12:02,264 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:12:02,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:12:02,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:12:02,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:12:02,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:12:02,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:12:02,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:12:02,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:12:02,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:12:02,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:12:02,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:12:02,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:12:02,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:12:02,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:12:02,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:12:02,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:12:02,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:12:02,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:12:02,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:12:02,267 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2025-03-17 12:12:02,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:12:02,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:12:02,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:12:02,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:12:02,489 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:12:02,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2025-03-17 12:12:03,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fffd76716/3da7a82319de46f6bf2ec4adeca05b69/FLAG706de3afb [2025-03-17 12:12:03,824 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:12:03,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2025-03-17 12:12:03,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fffd76716/3da7a82319de46f6bf2ec4adeca05b69/FLAG706de3afb [2025-03-17 12:12:04,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fffd76716/3da7a82319de46f6bf2ec4adeca05b69 [2025-03-17 12:12:04,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:12:04,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:12:04,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:12:04,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:12:04,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:12:04,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb3d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04, skipping insertion in model container [2025-03-17 12:12:04,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:12:04,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:12:04,411 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:12:04,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:12:04,471 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:12:04,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04 WrapperNode [2025-03-17 12:12:04,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:12:04,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:12:04,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:12:04,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:12:04,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,511 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2025-03-17 12:12:04,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:12:04,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:12:04,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:12:04,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:12:04,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,533 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 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-17 12:12:04,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:12:04,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:12:04,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:12:04,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:12:04,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (1/1) ... [2025-03-17 12:12:04,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:12:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:04,571 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-17 12:12:04,573 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-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:12:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:12:04,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:12:04,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:12:04,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:12:04,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:12:04,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:12:04,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:12:04,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:12:04,678 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:12:05,033 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-03-17 12:12:05,033 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:12:05,046 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:12:05,046 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:12:05,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:12:05 BoogieIcfgContainer [2025-03-17 12:12:05,047 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:12:05,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:12:05,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:12:05,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:12:05,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:12:04" (1/3) ... [2025-03-17 12:12:05,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e92cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:12:05, skipping insertion in model container [2025-03-17 12:12:05,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:04" (2/3) ... [2025-03-17 12:12:05,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e92cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:12:05, skipping insertion in model container [2025-03-17 12:12:05,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:12:05" (3/3) ... [2025-03-17 12:12:05,056 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2025-03-17 12:12:05,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:12:05,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-optional-1.i that has 1 procedures, 142 locations, 1 initial locations, 4 loop locations, and 66 error locations. [2025-03-17 12:12:05,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:12:05,111 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;@45758a55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:12:05,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-03-17 12:12:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 75 states have (on average 2.0933333333333333) internal successors, (157), 141 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-17 12:12:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 12:12:05,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:05,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 12:12:05,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:05,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 5983, now seen corresponding path program 1 times [2025-03-17 12:12:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053390732] [2025-03-17 12:12:05,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:05,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 12:12:05,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 12:12:05,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:05,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:05,263 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-17 12:12:05,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053390732] [2025-03-17 12:12:05,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053390732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:05,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:12:05,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577104962] [2025-03-17 12:12:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:05,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:05,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:05,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:05,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:05,294 INFO L87 Difference]: Start difference. First operand has 142 states, 75 states have (on average 2.0933333333333333) internal successors, (157), 141 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:05,438 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2025-03-17 12:12:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:05,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 12:12:05,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:05,446 INFO L225 Difference]: With dead ends: 136 [2025-03-17 12:12:05,446 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 12:12:05,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:05,449 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 112 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:05,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 83 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 12:12:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2025-03-17 12:12:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-17 12:12:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2025-03-17 12:12:05,481 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 2 [2025-03-17 12:12:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:05,481 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2025-03-17 12:12:05,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2025-03-17 12:12:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 12:12:05,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:05,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 12:12:05,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:12:05,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:05,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:05,483 INFO L85 PathProgramCache]: Analyzing trace with hash 5984, now seen corresponding path program 1 times [2025-03-17 12:12:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131226296] [2025-03-17 12:12:05,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:05,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 12:12:05,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 12:12:05,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:05,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:05,574 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-17 12:12:05,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:05,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131226296] [2025-03-17 12:12:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131226296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:12:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164237560] [2025-03-17 12:12:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:05,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:05,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:05,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:05,576 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:05,676 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2025-03-17 12:12:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:05,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 12:12:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:05,678 INFO L225 Difference]: With dead ends: 125 [2025-03-17 12:12:05,678 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 12:12:05,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:05,679 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 101 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:05,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 94 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 12:12:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-17 12:12:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-17 12:12:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2025-03-17 12:12:05,690 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 2 [2025-03-17 12:12:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:05,690 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2025-03-17 12:12:05,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2025-03-17 12:12:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:12:05,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:05,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:05,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:12:05,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:05,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:05,692 INFO L85 PathProgramCache]: Analyzing trace with hash -400816662, now seen corresponding path program 1 times [2025-03-17 12:12:05,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:05,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036466881] [2025-03-17 12:12:05,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:05,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:05,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:12:05,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:12:05,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:05,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:05,901 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-17 12:12:05,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:05,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036466881] [2025-03-17 12:12:05,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036466881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:05,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:05,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:12:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357723586] [2025-03-17 12:12:05,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:05,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:12:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:05,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:12:05,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:12:05,904 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:06,066 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2025-03-17 12:12:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:06,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 12:12:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:06,067 INFO L225 Difference]: With dead ends: 165 [2025-03-17 12:12:06,067 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 12:12:06,067 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-17 12:12:06,068 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 45 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:06,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 309 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 12:12:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 124. [2025-03-17 12:12:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 123 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-17 12:12:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2025-03-17 12:12:06,079 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 10 [2025-03-17 12:12:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:06,079 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2025-03-17 12:12:06,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2025-03-17 12:12:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:12:06,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:06,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:06,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:12:06,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:06,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -400816661, now seen corresponding path program 1 times [2025-03-17 12:12:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:06,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941701867] [2025-03-17 12:12:06,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:06,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:12:06,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:12:06,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:06,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:06,250 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-17 12:12:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941701867] [2025-03-17 12:12:06,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941701867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:06,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:06,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:12:06,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359863315] [2025-03-17 12:12:06,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:06,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:12:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:06,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:12:06,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:12:06,252 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:06,384 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2025-03-17 12:12:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:06,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 12:12:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:06,385 INFO L225 Difference]: With dead ends: 123 [2025-03-17 12:12:06,385 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 12:12:06,386 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-17 12:12:06,386 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:06,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 344 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 12:12:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-17 12:12:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 122 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-17 12:12:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2025-03-17 12:12:06,392 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 10 [2025-03-17 12:12:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:06,393 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2025-03-17 12:12:06,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2025-03-17 12:12:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:12:06,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:06,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:06,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:12:06,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:06,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:06,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1353215081, now seen corresponding path program 1 times [2025-03-17 12:12:06,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:06,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938807638] [2025-03-17 12:12:06,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:06,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:06,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:12:06,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:12:06,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:06,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:06,488 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-17 12:12:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938807638] [2025-03-17 12:12:06,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938807638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:06,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:06,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:12:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971893305] [2025-03-17 12:12:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:06,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:06,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:06,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:06,490 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:06,612 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2025-03-17 12:12:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:06,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:12:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:06,613 INFO L225 Difference]: With dead ends: 118 [2025-03-17 12:12:06,613 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 12:12:06,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-17 12:12:06,614 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 144 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:06,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 70 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 12:12:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-17 12:12:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 115 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-17 12:12:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2025-03-17 12:12:06,617 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 11 [2025-03-17 12:12:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:06,617 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2025-03-17 12:12:06,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2025-03-17 12:12:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:12:06,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:06,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:06,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:12:06,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1353215082, now seen corresponding path program 1 times [2025-03-17 12:12:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631724082] [2025-03-17 12:12:06,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:06,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:12:06,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:12:06,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:06,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:06,725 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-17 12:12:06,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:06,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631724082] [2025-03-17 12:12:06,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631724082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:06,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:06,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:12:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060821765] [2025-03-17 12:12:06,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:06,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:06,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:06,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:06,728 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:06,861 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2025-03-17 12:12:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:06,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:12:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:06,862 INFO L225 Difference]: With dead ends: 153 [2025-03-17 12:12:06,862 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 12:12:06,862 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-17 12:12:06,863 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 153 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:06,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 119 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 12:12:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2025-03-17 12:12:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 143 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2025-03-17 12:12:06,867 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 11 [2025-03-17 12:12:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:06,867 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2025-03-17 12:12:06,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2025-03-17 12:12:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:12:06,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:06,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:06,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:12:06,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:06,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:06,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1065290043, now seen corresponding path program 1 times [2025-03-17 12:12:06,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:06,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868645199] [2025-03-17 12:12:06,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:06,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:06,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:12:06,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:12:06,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:06,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:06,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-17 12:12:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868645199] [2025-03-17 12:12:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868645199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:12:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143033118] [2025-03-17 12:12:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:06,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:06,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:06,901 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:06,976 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2025-03-17 12:12:06,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:12:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 12:12:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:06,977 INFO L225 Difference]: With dead ends: 150 [2025-03-17 12:12:06,978 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 12:12:06,978 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-17 12:12:06,978 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 111 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:06,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 165 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 12:12:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2025-03-17 12:12:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 143 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-17 12:12:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2025-03-17 12:12:06,982 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 14 [2025-03-17 12:12:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:06,982 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2025-03-17 12:12:06,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2025-03-17 12:12:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:12:06,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:06,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:06,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:12:06,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:06,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1266675613, now seen corresponding path program 1 times [2025-03-17 12:12:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:06,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-03-17 12:12:06,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:06,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:12:07,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:12:07,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:07,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:07,086 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-17 12:12:07,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:07,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-03-17 12:12:07,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93646670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:07,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:07,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:12:07,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474815115] [2025-03-17 12:12:07,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:07,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:12:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:07,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:12:07,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:12:07,088 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-17 12:12:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:07,249 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2025-03-17 12:12:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:12:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-17 12:12:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:07,250 INFO L225 Difference]: With dead ends: 144 [2025-03-17 12:12:07,250 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 12:12:07,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:12:07,251 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 45 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:07,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 268 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 12:12:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-03-17 12:12:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 110 states have (on average 1.518181818181818) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2025-03-17 12:12:07,254 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 15 [2025-03-17 12:12:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:07,254 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2025-03-17 12:12:07,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-17 12:12:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2025-03-17 12:12:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:12:07,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:07,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:07,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:12:07,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:07,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1266675612, now seen corresponding path program 1 times [2025-03-17 12:12:07,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:07,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267115298] [2025-03-17 12:12:07,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:07,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:07,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:12:07,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:12:07,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:07,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:07,380 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-17 12:12:07,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:07,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267115298] [2025-03-17 12:12:07,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267115298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:07,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:07,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:12:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538978602] [2025-03-17 12:12:07,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:07,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:12:07,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:07,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:12:07,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:12:07,382 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-17 12:12:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:07,543 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2025-03-17 12:12:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:12:07,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-17 12:12:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:07,544 INFO L225 Difference]: With dead ends: 134 [2025-03-17 12:12:07,544 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 12:12:07,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:12:07,545 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 22 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:07,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 319 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:07,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 12:12:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2025-03-17 12:12:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.438095238095238) internal successors, (151), 127 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-17 12:12:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2025-03-17 12:12:07,551 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 15 [2025-03-17 12:12:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:07,551 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2025-03-17 12:12:07,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-17 12:12:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2025-03-17 12:12:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:12:07,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:07,552 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-17 12:12:07,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:12:07,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:07,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash 226750167, now seen corresponding path program 1 times [2025-03-17 12:12:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:07,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198705995] [2025-03-17 12:12:07,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:07,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:12:07,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:12:07,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:07,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:07,620 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-17 12:12:07,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:07,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198705995] [2025-03-17 12:12:07,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198705995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:07,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:07,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:12:07,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068610967] [2025-03-17 12:12:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:07,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:07,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:07,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:07,622 INFO L87 Difference]: Start difference. First operand 128 states and 151 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-17 12:12:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:07,642 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2025-03-17 12:12:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:12:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-17 12:12:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:07,643 INFO L225 Difference]: With dead ends: 134 [2025-03-17 12:12:07,643 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 12:12:07,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-17 12:12:07,644 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:07,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 297 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:12:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 12:12:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-17 12:12:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.4220183486238531) internal successors, (155), 131 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-17 12:12:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2025-03-17 12:12:07,648 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 19 [2025-03-17 12:12:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:07,649 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2025-03-17 12:12:07,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-17 12:12:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2025-03-17 12:12:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:12:07,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:07,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:07,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:12:07,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:07,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:07,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1963740971, now seen corresponding path program 1 times [2025-03-17 12:12:07,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:07,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548041846] [2025-03-17 12:12:07,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:07,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:07,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:12:07,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:12:07,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:07,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:07,774 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-17 12:12:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:07,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548041846] [2025-03-17 12:12:07,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548041846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:07,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:07,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:12:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885794549] [2025-03-17 12:12:07,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:07,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:12:07,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:07,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:12:07,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:12:07,776 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:08,059 INFO L93 Difference]: Finished difference Result 213 states and 246 transitions. [2025-03-17 12:12:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:12:08,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 12:12:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:08,060 INFO L225 Difference]: With dead ends: 213 [2025-03-17 12:12:08,061 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 12:12:08,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:12:08,061 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 179 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:08,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 316 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:12:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 12:12:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2025-03-17 12:12:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 145 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-17 12:12:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 173 transitions. [2025-03-17 12:12:08,064 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 173 transitions. Word has length 21 [2025-03-17 12:12:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:08,064 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 173 transitions. [2025-03-17 12:12:08,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 173 transitions. [2025-03-17 12:12:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:12:08,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:08,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:08,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:12:08,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:08,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1963740970, now seen corresponding path program 1 times [2025-03-17 12:12:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989973578] [2025-03-17 12:12:08,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:08,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:12:08,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:12:08,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:08,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:08,229 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-17 12:12:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989973578] [2025-03-17 12:12:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989973578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:12:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786442815] [2025-03-17 12:12:08,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:08,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:12:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:08,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:12:08,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:12:08,231 INFO L87 Difference]: Start difference. First operand 146 states and 173 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:08,469 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2025-03-17 12:12:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:12:08,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 12:12:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:08,470 INFO L225 Difference]: With dead ends: 207 [2025-03-17 12:12:08,470 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 12:12:08,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:12:08,471 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 163 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:08,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 405 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:12:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 12:12:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 142. [2025-03-17 12:12:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.403361344537815) internal successors, (167), 141 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2025-03-17 12:12:08,474 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 21 [2025-03-17 12:12:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:08,474 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2025-03-17 12:12:08,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2025-03-17 12:12:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:12:08,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:08,475 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-17 12:12:08,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:12:08,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash -845429234, now seen corresponding path program 1 times [2025-03-17 12:12:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:08,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95330348] [2025-03-17 12:12:08,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:08,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:12:08,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:12:08,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:08,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:08,495 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-17 12:12:08,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:08,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95330348] [2025-03-17 12:12:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95330348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:08,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:08,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:12:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239149103] [2025-03-17 12:12:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:08,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:08,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:08,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:08,497 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:08,502 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2025-03-17 12:12:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:12:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:08,504 INFO L225 Difference]: With dead ends: 144 [2025-03-17 12:12:08,504 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 12:12:08,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:08,504 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 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-17 12:12:08,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:12:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 12:12:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-17 12:12:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.396694214876033) internal successors, (169), 143 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2025-03-17 12:12:08,509 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 22 [2025-03-17 12:12:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:08,509 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2025-03-17 12:12:08,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2025-03-17 12:12:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:12:08,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:08,510 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-17 12:12:08,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:12:08,510 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1752694290, now seen corresponding path program 1 times [2025-03-17 12:12:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138448010] [2025-03-17 12:12:08,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:08,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:12:08,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:12:08,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:08,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:08,604 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-17 12:12:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138448010] [2025-03-17 12:12:08,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138448010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:08,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:12:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380100316] [2025-03-17 12:12:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:12:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:08,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:12:08,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:12:08,605 INFO L87 Difference]: Start difference. First operand 144 states and 169 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-17 12:12:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:08,734 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2025-03-17 12:12:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:08,736 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-17 12:12:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:08,737 INFO L225 Difference]: With dead ends: 149 [2025-03-17 12:12:08,737 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 12:12:08,737 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-17 12:12:08,737 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 5 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:08,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 279 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 12:12:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2025-03-17 12:12:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 142 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-17 12:12:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2025-03-17 12:12:08,740 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 23 [2025-03-17 12:12:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2025-03-17 12:12:08,740 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-17 12:12:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2025-03-17 12:12:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:12:08,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:08,741 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-17 12:12:08,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:12:08,741 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:08,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1752694289, now seen corresponding path program 1 times [2025-03-17 12:12:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636267485] [2025-03-17 12:12:08,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:12:08,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:12:08,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:08,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:08,881 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-17 12:12:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636267485] [2025-03-17 12:12:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636267485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:08,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:12:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011802385] [2025-03-17 12:12:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:08,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:12:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:08,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:12:08,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:12:08,883 INFO L87 Difference]: Start difference. First operand 143 states and 168 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-17 12:12:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:08,980 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2025-03-17 12:12:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:08,981 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-17 12:12:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:08,981 INFO L225 Difference]: With dead ends: 142 [2025-03-17 12:12:08,981 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 12:12:08,981 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-17 12:12:08,982 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:08,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 12:12:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-17 12:12:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 141 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2025-03-17 12:12:08,984 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 23 [2025-03-17 12:12:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:08,984 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2025-03-17 12:12:08,984 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-17 12:12:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2025-03-17 12:12:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:12:08,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:08,988 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-17 12:12:08,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:12:08,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:08,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash -677181714, now seen corresponding path program 1 times [2025-03-17 12:12:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310156899] [2025-03-17 12:12:08,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:08,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:12:09,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:12:09,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:09,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:09,115 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-17 12:12:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:09,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310156899] [2025-03-17 12:12:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310156899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:09,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:09,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:12:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400760796] [2025-03-17 12:12:09,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:09,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:12:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:09,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:12:09,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:12:09,117 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-17 12:12:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:09,305 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2025-03-17 12:12:09,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:12:09,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-17 12:12:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:09,306 INFO L225 Difference]: With dead ends: 204 [2025-03-17 12:12:09,306 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 12:12:09,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:12:09,307 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 152 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:09,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 368 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 12:12:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 148. [2025-03-17 12:12:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 147 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-17 12:12:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2025-03-17 12:12:09,310 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 24 [2025-03-17 12:12:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:09,310 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2025-03-17 12:12:09,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-17 12:12:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2025-03-17 12:12:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:12:09,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:09,311 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:09,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:12:09,311 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:09,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash -470253235, now seen corresponding path program 1 times [2025-03-17 12:12:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:09,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169968780] [2025-03-17 12:12:09,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:09,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:09,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:12:09,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:12:09,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:09,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:09,340 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-17 12:12:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169968780] [2025-03-17 12:12:09,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169968780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:09,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:09,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:12:09,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954595443] [2025-03-17 12:12:09,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:09,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:09,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:09,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:09,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:09,343 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-17 12:12:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:09,354 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2025-03-17 12:12:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:12:09,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-17 12:12:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:09,355 INFO L225 Difference]: With dead ends: 152 [2025-03-17 12:12:09,355 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 12:12:09,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-17 12:12:09,356 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:09,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:12:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 12:12:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-17 12:12:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 151 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-17 12:12:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2025-03-17 12:12:09,361 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 25 [2025-03-17 12:12:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:09,361 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2025-03-17 12:12:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-17 12:12:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2025-03-17 12:12:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:12:09,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:09,362 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-17 12:12:09,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:12:09,362 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1699523402, now seen corresponding path program 1 times [2025-03-17 12:12:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365857537] [2025-03-17 12:12:09,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:09,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:12:09,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:12:09,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:09,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:09,500 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-17 12:12:09,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:09,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365857537] [2025-03-17 12:12:09,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365857537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:09,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:09,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:12:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875376020] [2025-03-17 12:12:09,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:09,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:12:09,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:09,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:12:09,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:12:09,502 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-17 12:12:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:09,837 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2025-03-17 12:12:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:12:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-17 12:12:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:09,838 INFO L225 Difference]: With dead ends: 277 [2025-03-17 12:12:09,838 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 12:12:09,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:12:09,838 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 287 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:09,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 403 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:12:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 12:12:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 165. [2025-03-17 12:12:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 164 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-17 12:12:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 194 transitions. [2025-03-17 12:12:09,843 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 194 transitions. Word has length 25 [2025-03-17 12:12:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:09,843 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 194 transitions. [2025-03-17 12:12:09,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-17 12:12:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 194 transitions. [2025-03-17 12:12:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:12:09,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:09,843 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-17 12:12:09,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:12:09,843 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:09,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1699523401, now seen corresponding path program 1 times [2025-03-17 12:12:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:09,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758451823] [2025-03-17 12:12:09,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:09,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:09,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:12:09,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:12:09,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:09,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:10,107 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-17 12:12:10,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:10,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758451823] [2025-03-17 12:12:10,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758451823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:10,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:12:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759744090] [2025-03-17 12:12:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:10,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:12:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:10,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:12:10,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:12:10,109 INFO L87 Difference]: Start difference. First operand 165 states and 194 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-17 12:12:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:10,461 INFO L93 Difference]: Finished difference Result 235 states and 270 transitions. [2025-03-17 12:12:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:12:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-17 12:12:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:10,462 INFO L225 Difference]: With dead ends: 235 [2025-03-17 12:12:10,462 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 12:12:10,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:12:10,463 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 245 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:10,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 432 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:12:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 12:12:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 165. [2025-03-17 12:12:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 164 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-17 12:12:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 193 transitions. [2025-03-17 12:12:10,466 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 193 transitions. Word has length 25 [2025-03-17 12:12:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 193 transitions. [2025-03-17 12:12:10,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-17 12:12:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2025-03-17 12:12:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:12:10,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:10,467 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-17 12:12:10,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:12:10,468 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:10,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -435219347, now seen corresponding path program 1 times [2025-03-17 12:12:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109989732] [2025-03-17 12:12:10,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:10,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:12:10,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:12:10,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:10,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:10,658 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-17 12:12:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109989732] [2025-03-17 12:12:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109989732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488734742] [2025-03-17 12:12:10,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:10,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:10,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:10,661 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-17 12:12:10,662 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-17 12:12:10,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:12:10,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:12:10,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:10,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:10,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 12:12:10,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:10,776 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-17 12:12:10,780 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-17 12:12:10,819 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 23 treesize of output 11 [2025-03-17 12:12:10,823 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 23 treesize of output 11 [2025-03-17 12:12:10,834 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 19 treesize of output 18 [2025-03-17 12:12:10,842 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 23 treesize of output 11 [2025-03-17 12:12:10,979 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-17 12:12:10,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:11,338 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 10 treesize of output 8 [2025-03-17 12:12:11,343 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 14 treesize of output 12 [2025-03-17 12:12:11,351 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 10 treesize of output 8 [2025-03-17 12:12:11,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:11,364 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-17 12:12:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488734742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:11,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-17 12:12:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389669973] [2025-03-17 12:12:11,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:11,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 12:12:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:11,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 12:12:11,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:12:11,366 INFO L87 Difference]: Start difference. First operand 165 states and 193 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-17 12:12:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:11,787 INFO L93 Difference]: Finished difference Result 218 states and 251 transitions. [2025-03-17 12:12:11,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:12:11,787 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 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-17 12:12:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:11,788 INFO L225 Difference]: With dead ends: 218 [2025-03-17 12:12:11,788 INFO L226 Difference]: Without dead ends: 218 [2025-03-17 12:12:11,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:12:11,789 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 302 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:11,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 459 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:12:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-17 12:12:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 180. [2025-03-17 12:12:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.320754716981132) internal successors, (210), 179 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-17 12:12:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2025-03-17 12:12:11,793 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 27 [2025-03-17 12:12:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:11,793 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2025-03-17 12:12:11,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-17 12:12:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2025-03-17 12:12:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:12:11,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:11,793 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] [2025-03-17 12:12:11,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:11,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:11,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash -606940245, now seen corresponding path program 1 times [2025-03-17 12:12:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099351205] [2025-03-17 12:12:11,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:12,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:12:12,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:12:12,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:12,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:12,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:12,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099351205] [2025-03-17 12:12:12,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099351205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:12,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:12:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678644062] [2025-03-17 12:12:12,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:12,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:12,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:12,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:12,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:12,027 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-17 12:12:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:12,109 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2025-03-17 12:12:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:12,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-17 12:12:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:12,110 INFO L225 Difference]: With dead ends: 195 [2025-03-17 12:12:12,110 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 12:12:12,110 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-17 12:12:12,111 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 114 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:12,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 145 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:12,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 12:12:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2025-03-17 12:12:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 179 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-17 12:12:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2025-03-17 12:12:12,114 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 28 [2025-03-17 12:12:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:12,114 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2025-03-17 12:12:12,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-17 12:12:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2025-03-17 12:12:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:12:12,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:12,115 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] [2025-03-17 12:12:12,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:12:12,115 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:12,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2046637203, now seen corresponding path program 1 times [2025-03-17 12:12:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825171083] [2025-03-17 12:12:12,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:12,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:12:12,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:12:12,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:12,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:12,313 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-17 12:12:12,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:12,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825171083] [2025-03-17 12:12:12,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825171083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:12,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:12,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 12:12:12,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658548429] [2025-03-17 12:12:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:12,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:12:12,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:12,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:12:12,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:12:12,315 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-17 12:12:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:12,649 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2025-03-17 12:12:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:12:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-17 12:12:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:12,652 INFO L225 Difference]: With dead ends: 204 [2025-03-17 12:12:12,652 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 12:12:12,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:12:12,653 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 225 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:12,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 436 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:12:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 12:12:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2025-03-17 12:12:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.3121019108280254) internal successors, (206), 177 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-17 12:12:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2025-03-17 12:12:12,658 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 28 [2025-03-17 12:12:12,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:12,658 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2025-03-17 12:12:12,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-17 12:12:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2025-03-17 12:12:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:12:12,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:12,659 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] [2025-03-17 12:12:12,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 12:12:12,659 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:12,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash 97743983, now seen corresponding path program 1 times [2025-03-17 12:12:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364055562] [2025-03-17 12:12:12,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:12,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:12,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:12:12,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:12:12,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:12,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:12,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:12,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364055562] [2025-03-17 12:12:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364055562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:12:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769752780] [2025-03-17 12:12:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:12:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:12,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:12:12,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:12:12,763 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:12,944 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2025-03-17 12:12:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:12:12,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:12:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:12,945 INFO L225 Difference]: With dead ends: 211 [2025-03-17 12:12:12,946 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 12:12:12,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:12:12,947 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 15 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:12,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 441 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:12:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 12:12:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2025-03-17 12:12:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.3067484662576687) 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-17 12:12:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 213 transitions. [2025-03-17 12:12:12,951 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 213 transitions. Word has length 30 [2025-03-17 12:12:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:12,951 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 213 transitions. [2025-03-17 12:12:12,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 213 transitions. [2025-03-17 12:12:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:12:12,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:12,952 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, 1, 1] [2025-03-17 12:12:12,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:12:12,952 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:12,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:12,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1020164171, now seen corresponding path program 1 times [2025-03-17 12:12:12,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:12,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502857807] [2025-03-17 12:12:12,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:12,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:12:12,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:12:12,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:12,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:13,164 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-17 12:12:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502857807] [2025-03-17 12:12:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502857807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787909810] [2025-03-17 12:12:13,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:13,166 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-17 12:12:13,167 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-17 12:12:13,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:12:13,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:12:13,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:13,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:13,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 12:12:13,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:13,254 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-17 12:12:13,270 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-17 12:12:13,274 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 23 treesize of output 11 [2025-03-17 12:12:13,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:13,401 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 17 treesize of output 15 [2025-03-17 12:12:13,527 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-17 12:12:13,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:14,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 12:12:14,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 12:12:14,050 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 20 treesize of output 18 [2025-03-17 12:12:14,054 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 100 treesize of output 92 [2025-03-17 12:12:14,078 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-17 12:12:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787909810] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:14,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:12:14,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10, 10] total 28 [2025-03-17 12:12:14,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760360190] [2025-03-17 12:12:14,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:14,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 12:12:14,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:14,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 12:12:14,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2025-03-17 12:12:14,079 INFO L87 Difference]: Start difference. First operand 184 states and 213 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 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-17 12:12:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:14,417 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2025-03-17 12:12:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:12:14,417 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 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-17 12:12:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:14,418 INFO L225 Difference]: With dead ends: 206 [2025-03-17 12:12:14,418 INFO L226 Difference]: Without dead ends: 206 [2025-03-17 12:12:14,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 12:12:14,419 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 204 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:14,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 480 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:12:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-17 12:12:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2025-03-17 12:12:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 177 states have (on average 1.2824858757062148) internal successors, (227), 197 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 227 transitions. [2025-03-17 12:12:14,423 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 227 transitions. Word has length 33 [2025-03-17 12:12:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:14,423 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 227 transitions. [2025-03-17 12:12:14,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 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-17 12:12:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 227 transitions. [2025-03-17 12:12:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:12:14,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:14,424 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, 1, 1] [2025-03-17 12:12:14,432 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-17 12:12:14,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 12:12:14,625 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:14,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1020164876, now seen corresponding path program 1 times [2025-03-17 12:12:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831629916] [2025-03-17 12:12:14,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:14,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:12:14,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:12:14,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:14,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831629916] [2025-03-17 12:12:14,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831629916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:14,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:14,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:12:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852433331] [2025-03-17 12:12:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:14,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:14,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:14,677 INFO L87 Difference]: Start difference. First operand 198 states and 227 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 3 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-17 12:12:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:14,761 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2025-03-17 12:12:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:14,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 3 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-17 12:12:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:14,762 INFO L225 Difference]: With dead ends: 211 [2025-03-17 12:12:14,762 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 12:12:14,762 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-17 12:12:14,762 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 109 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:14,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 134 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 12:12:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2025-03-17 12:12:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 179 states have (on average 1.2793296089385475) internal successors, (229), 199 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-17 12:12:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 229 transitions. [2025-03-17 12:12:14,770 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 229 transitions. Word has length 33 [2025-03-17 12:12:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:14,770 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 229 transitions. [2025-03-17 12:12:14,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 3 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-17 12:12:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 229 transitions. [2025-03-17 12:12:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:12:14,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:14,771 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] [2025-03-17 12:12:14,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 12:12:14,772 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:14,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash -387904195, now seen corresponding path program 1 times [2025-03-17 12:12:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:14,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10595898] [2025-03-17 12:12:14,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:14,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:12:14,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:12:14,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:14,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:15,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10595898] [2025-03-17 12:12:15,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10595898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059164444] [2025-03-17 12:12:15,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:15,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:15,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:15,189 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-17 12:12:15,192 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-17 12:12:15,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:12:15,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:12:15,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:15,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:15,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 12:12:15,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:15,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:15,335 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-17 12:12:15,362 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 23 treesize of output 11 [2025-03-17 12:12:15,416 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:15,416 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-17 12:12:15,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:15,446 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 23 treesize of output 11 [2025-03-17 12:12:15,457 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-17 12:12:15,497 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 16 treesize of output 8 [2025-03-17 12:12:15,544 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 16 treesize of output 11 [2025-03-17 12:12:15,563 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 16 treesize of output 11 [2025-03-17 12:12:15,574 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 16 treesize of output 11 [2025-03-17 12:12:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:15,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:15,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2025-03-17 12:12:15,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= v_ArrVal_726 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_726 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)))) is different from false [2025-03-17 12:12:15,845 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_726) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_729) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) (not (= v_ArrVal_726 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_61| (select v_ArrVal_726 |v_ULTIMATE.start_main_~x~0#1.offset_61|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_61|))) is different from false [2025-03-17 12:12:15,866 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_726) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_729) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (not (= v_ArrVal_726 (store (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0 (select v_ArrVal_726 .cse0))) |v_ULTIMATE.start_main_~x~0#1.offset_61| (select v_ArrVal_726 |v_ULTIMATE.start_main_~x~0#1.offset_61|)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_61|))) is different from false [2025-03-17 12:12:15,876 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 52 treesize of output 50 [2025-03-17 12:12:15,880 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 26 treesize of output 22 [2025-03-17 12:12:15,887 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:15,887 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:15,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059164444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:15,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:15,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 34 [2025-03-17 12:12:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457976845] [2025-03-17 12:12:15,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:15,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 12:12:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:15,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 12:12:15,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=809, Unknown=15, NotChecked=244, Total=1190 [2025-03-17 12:12:15,914 INFO L87 Difference]: Start difference. First operand 200 states and 229 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:17,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_726) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_729) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (not (= v_ArrVal_726 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_726 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= (select .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) 2)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) 4) |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_729) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 2))))) is different from false [2025-03-17 12:12:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:18,023 INFO L93 Difference]: Finished difference Result 597 states and 668 transitions. [2025-03-17 12:12:18,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-17 12:12:18,024 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-17 12:12:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:18,026 INFO L225 Difference]: With dead ends: 597 [2025-03-17 12:12:18,026 INFO L226 Difference]: Without dead ends: 597 [2025-03-17 12:12:18,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=705, Invalid=3706, Unknown=31, NotChecked=670, Total=5112 [2025-03-17 12:12:18,028 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 928 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 171 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 1762 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:18,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1543 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1581 Invalid, 23 Unknown, 1762 Unchecked, 1.0s Time] [2025-03-17 12:12:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-17 12:12:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 248. [2025-03-17 12:12:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 227 states have (on average 1.2599118942731278) internal successors, (286), 247 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 286 transitions. [2025-03-17 12:12:18,035 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 286 transitions. Word has length 33 [2025-03-17 12:12:18,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:18,035 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 286 transitions. [2025-03-17 12:12:18,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2025-03-17 12:12:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:12:18,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:18,036 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, 1, 1] [2025-03-17 12:12:18,043 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-17 12:12:18,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:18,237 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:18,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:18,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1603539700, now seen corresponding path program 1 times [2025-03-17 12:12:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:18,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778512498] [2025-03-17 12:12:18,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:18,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:12:18,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:12:18,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:18,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:18,477 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-17 12:12:18,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:18,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778512498] [2025-03-17 12:12:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778512498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:18,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:18,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 12:12:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463675680] [2025-03-17 12:12:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:18,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:12:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:18,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:12:18,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:12:18,478 INFO L87 Difference]: Start difference. First operand 248 states and 286 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 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-17 12:12:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:18,919 INFO L93 Difference]: Finished difference Result 264 states and 300 transitions. [2025-03-17 12:12:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:12:18,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 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-17 12:12:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:18,921 INFO L225 Difference]: With dead ends: 264 [2025-03-17 12:12:18,921 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 12:12:18,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:12:18,922 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 173 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:18,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 567 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:12:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 12:12:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 245. [2025-03-17 12:12:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 244 states have internal predecessors, (281), 0 states have call successors, (0), 0 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-17 12:12:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 281 transitions. [2025-03-17 12:12:18,926 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 281 transitions. Word has length 33 [2025-03-17 12:12:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:18,926 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 281 transitions. [2025-03-17 12:12:18,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 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-17 12:12:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 281 transitions. [2025-03-17 12:12:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:12:18,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:18,927 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, 1, 1, 1, 1, 1] [2025-03-17 12:12:18,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:12:18,927 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:18,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:18,928 INFO L85 PathProgramCache]: Analyzing trace with hash 543207575, now seen corresponding path program 1 times [2025-03-17 12:12:18,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:18,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544465327] [2025-03-17 12:12:18,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:18,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:18,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:12:18,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:12:18,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:18,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544465327] [2025-03-17 12:12:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544465327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118534445] [2025-03-17 12:12:19,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:19,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:19,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:19,006 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-17 12:12:19,012 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-17 12:12:19,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:12:19,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:12:19,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:19,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:19,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 12:12:19,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:19,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:12:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:19,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118534445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:19,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-17 12:12:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218346556] [2025-03-17 12:12:19,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:12:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:19,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:12:19,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:12:19,232 INFO L87 Difference]: Start difference. First operand 245 states and 281 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-17 12:12:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:19,386 INFO L93 Difference]: Finished difference Result 271 states and 308 transitions. [2025-03-17 12:12:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:12:19,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 12:12:19,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:19,387 INFO L225 Difference]: With dead ends: 271 [2025-03-17 12:12:19,387 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 12:12:19,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:12:19,388 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 62 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:19,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 255 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 12:12:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2025-03-17 12:12:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 228 states have (on average 1.25) internal successors, (285), 248 states have internal predecessors, (285), 0 states have call successors, (0), 0 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-17 12:12:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 285 transitions. [2025-03-17 12:12:19,393 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 285 transitions. Word has length 36 [2025-03-17 12:12:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:19,393 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 285 transitions. [2025-03-17 12:12:19,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-17 12:12:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 285 transitions. [2025-03-17 12:12:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:12:19,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:19,394 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] [2025-03-17 12:12:19,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:12:19,594 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,SelfDestructingSolverStorable27 [2025-03-17 12:12:19,594 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:19,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash 543208374, now seen corresponding path program 1 times [2025-03-17 12:12:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519076212] [2025-03-17 12:12:19,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:19,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:12:19,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:12:19,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:19,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:19,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519076212] [2025-03-17 12:12:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519076212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:19,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758002232] [2025-03-17 12:12:19,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:19,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:19,700 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-17 12:12:19,702 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-17 12:12:19,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:12:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:12:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:19,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:19,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:12:19,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:19,787 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-17 12:12:19,808 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 23 treesize of output 11 [2025-03-17 12:12:19,811 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 19 treesize of output 18 [2025-03-17 12:12:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:20,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:20,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:20,171 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 38 treesize of output 41 [2025-03-17 12:12:20,572 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 10 treesize of output 8 [2025-03-17 12:12:20,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758002232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:20,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 21 [2025-03-17 12:12:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625373731] [2025-03-17 12:12:20,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:20,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 12:12:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:20,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 12:12:20,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:12:20,591 INFO L87 Difference]: Start difference. First operand 249 states and 285 transitions. Second operand has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 21 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-17 12:12:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:21,366 INFO L93 Difference]: Finished difference Result 313 states and 357 transitions. [2025-03-17 12:12:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 12:12:21,366 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 21 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 12:12:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:21,367 INFO L225 Difference]: With dead ends: 313 [2025-03-17 12:12:21,367 INFO L226 Difference]: Without dead ends: 288 [2025-03-17 12:12:21,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 12:12:21,368 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 353 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:21,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1055 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:12:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-17 12:12:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 242. [2025-03-17 12:12:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 221 states have (on average 1.2760180995475112) internal successors, (282), 241 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-17 12:12:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 282 transitions. [2025-03-17 12:12:21,372 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 282 transitions. Word has length 36 [2025-03-17 12:12:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:21,372 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 282 transitions. [2025-03-17 12:12:21,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 21 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-17 12:12:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 282 transitions. [2025-03-17 12:12:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:12:21,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:21,373 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] [2025-03-17 12:12:21,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:21,573 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,SelfDestructingSolverStorable28 [2025-03-17 12:12:21,574 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:21,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1083666822, now seen corresponding path program 1 times [2025-03-17 12:12:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:21,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76039062] [2025-03-17 12:12:21,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:21,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:12:21,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:12:21,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:21,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:22,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:22,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76039062] [2025-03-17 12:12:22,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76039062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:22,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248252496] [2025-03-17 12:12:22,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:22,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:22,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:22,082 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-17 12:12:22,084 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-17 12:12:22,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:12:22,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:12:22,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:22,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:22,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 12:12:22,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:22,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:22,239 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-17 12:12:22,243 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-17 12:12:22,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:22,308 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-17 12:12:22,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:22,340 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 23 treesize of output 11 [2025-03-17 12:12:22,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:22,351 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 23 treesize of output 11 [2025-03-17 12:12:22,518 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:12:22,519 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:12:22,538 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:12:22,538 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 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-17 12:12:22,636 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:12:22,637 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 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-17 12:12:22,653 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:12:22,654 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:12:22,694 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:22,694 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 48 treesize of output 43 [2025-03-17 12:12:22,698 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 24 treesize of output 11 [2025-03-17 12:12:22,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:12:22,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:22,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:22,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:12:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:22,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:22,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_951 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_950 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2025-03-17 12:12:25,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_#t~malloc7#1.offset| Int) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2025-03-17 12:12:28,726 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:28,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:28,730 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2025-03-17 12:12:28,733 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 36 treesize of output 24 [2025-03-17 12:12:28,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:12:28,740 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:28,740 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:28,742 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-17 12:12:28,742 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2025-03-17 12:12:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248252496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:32,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:32,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2025-03-17 12:12:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631333170] [2025-03-17 12:12:32,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:32,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:12:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:32,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:12:32,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=728, Unknown=13, NotChecked=114, Total=992 [2025-03-17 12:12:32,930 INFO L87 Difference]: Start difference. First operand 242 states and 282 transitions. Second operand has 32 states, 32 states have (on average 3.125) internal successors, (100), 31 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-17 12:12:36,979 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 [0] [2025-03-17 12:12:40,998 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 [0] [2025-03-17 12:12:45,066 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 [0] [2025-03-17 12:12:49,069 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 [0] [2025-03-17 12:12:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:50,526 INFO L93 Difference]: Finished difference Result 468 states and 541 transitions. [2025-03-17 12:12:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 12:12:50,526 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.125) internal successors, (100), 31 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 12:12:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:50,528 INFO L225 Difference]: With dead ends: 468 [2025-03-17 12:12:50,528 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 12:12:50,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=550, Invalid=2200, Unknown=14, NotChecked=206, Total=2970 [2025-03-17 12:12:50,529 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 607 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 148 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:50,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1093 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1244 Invalid, 4 Unknown, 558 Unchecked, 16.8s Time] [2025-03-17 12:12:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 12:12:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 272. [2025-03-17 12:12:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 251 states have (on average 1.2749003984063745) internal successors, (320), 271 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-17 12:12:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 320 transitions. [2025-03-17 12:12:50,533 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 320 transitions. Word has length 36 [2025-03-17 12:12:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:50,533 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 320 transitions. [2025-03-17 12:12:50,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.125) internal successors, (100), 31 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-17 12:12:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 320 transitions. [2025-03-17 12:12:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:12:50,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:50,534 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] [2025-03-17 12:12:50,540 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-17 12:12:50,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:50,738 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash -565809533, now seen corresponding path program 1 times [2025-03-17 12:12:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903938085] [2025-03-17 12:12:50,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:12:50,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:12:50,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:50,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:51,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:51,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903938085] [2025-03-17 12:12:51,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903938085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:51,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988290908] [2025-03-17 12:12:51,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:51,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:51,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:51,162 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-17 12:12:51,163 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-17 12:12:51,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:12:51,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:12:51,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:51,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:51,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 12:12:51,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:51,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:51,271 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-17 12:12:51,290 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 23 treesize of output 11 [2025-03-17 12:12:51,334 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:51,334 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-17 12:12:51,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:51,357 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 23 treesize of output 11 [2025-03-17 12:12:51,365 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-17 12:12:51,397 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 16 treesize of output 8 [2025-03-17 12:12:51,446 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 16 treesize of output 11 [2025-03-17 12:12:51,466 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 16 treesize of output 11 [2025-03-17 12:12:51,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:51,477 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 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:12:51,504 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 16 treesize of output 11 [2025-03-17 12:12:51,506 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 19 treesize of output 1 [2025-03-17 12:12:51,535 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 20 treesize of output 8 [2025-03-17 12:12:51,560 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 16 treesize of output 11 [2025-03-17 12:12:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:51,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:51,719 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1071) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2025-03-17 12:12:51,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1071) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2025-03-17 12:12:51,930 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:12:51,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 12:12:52,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_82| Int) (v_ArrVal_1069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_14| Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int) (v_ArrVal_1063 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_14|) 0)) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_82| (select v_ArrVal_1063 |v_ULTIMATE.start_main_~x~0#1.offset_82|)) v_ArrVal_1063)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_8| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= 2 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1063) |v_ULTIMATE.start_main_#t~malloc7#1.base_14| v_ArrVal_1069) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1071) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_82|))) is different from false [2025-03-17 12:12:52,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_82| Int) (v_ArrVal_1069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_14| Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int) (v_ArrVal_1063 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_14|) 0)) (not (= v_ArrVal_1063 (store (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0 (select v_ArrVal_1063 .cse0))) |v_ULTIMATE.start_main_~x~0#1.offset_82| (select v_ArrVal_1063 |v_ULTIMATE.start_main_~x~0#1.offset_82|)))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_8| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= 2 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1063) |v_ULTIMATE.start_main_#t~malloc7#1.base_14| v_ArrVal_1069) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1071) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_82|))) is different from false [2025-03-17 12:12:52,114 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:52,116 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 52 treesize of output 50 [2025-03-17 12:12:52,120 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:52,121 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:52,122 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-17 12:12:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988290908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:52,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 44 [2025-03-17 12:12:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807064122] [2025-03-17 12:12:52,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-17 12:12:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:52,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-17 12:12:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1445, Unknown=46, NotChecked=324, Total=1980 [2025-03-17 12:12:52,150 INFO L87 Difference]: Start difference. First operand 272 states and 320 transitions. Second operand has 45 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 44 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-17 12:12:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:54,624 INFO L93 Difference]: Finished difference Result 584 states and 670 transitions. [2025-03-17 12:12:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-17 12:12:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 44 states have internal predecessors, (101), 0 states have call successors, (0), 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 37 [2025-03-17 12:12:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:54,626 INFO L225 Difference]: With dead ends: 584 [2025-03-17 12:12:54,626 INFO L226 Difference]: Without dead ends: 584 [2025-03-17 12:12:54,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1721 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=999, Invalid=6234, Unknown=93, NotChecked=684, Total=8010 [2025-03-17 12:12:54,628 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1154 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 189 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 3988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1552 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:54,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 1857 Invalid, 3988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2242 Invalid, 5 Unknown, 1552 Unchecked, 1.0s Time] [2025-03-17 12:12:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-17 12:12:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 293. [2025-03-17 12:12:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.2610294117647058) internal successors, (343), 292 states have internal predecessors, (343), 0 states have call successors, (0), 0 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-17 12:12:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 343 transitions. [2025-03-17 12:12:54,632 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 343 transitions. Word has length 37 [2025-03-17 12:12:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:54,632 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 343 transitions. [2025-03-17 12:12:54,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 44 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-17 12:12:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 343 transitions. [2025-03-17 12:12:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:12:54,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:54,633 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] [2025-03-17 12:12:54,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:12:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:54,833 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-03-17 12:12:54,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1617749918, now seen corresponding path program 1 times [2025-03-17 12:12:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207859453] [2025-03-17 12:12:54,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:54,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:12:54,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:12:54,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:54,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207859453] [2025-03-17 12:12:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207859453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837168794] [2025-03-17 12:12:55,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:55,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:55,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:55,243 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:55,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:12:55,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:12:55,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:12:55,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:55,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:55,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 12:12:55,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:55,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:55,383 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:12:55,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:12:55,414 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-17 12:12:55,461 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:55,461 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-17 12:12:55,537 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-17 12:12:55,537 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 4 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 12:12:55,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:55,586 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 45 treesize of output 25 [2025-03-17 12:12:55,744 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:12:55,744 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 1 case distinctions, treesize of input 53 treesize of output 38 [2025-03-17 12:12:55,846 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:12:55,847 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 1 case distinctions, treesize of input 53 treesize of output 38 [2025-03-17 12:12:55,880 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:55,880 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 63 treesize of output 54 [2025-03-17 12:12:56,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:56,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 26 [2025-03-17 12:12:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:56,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:56,411 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1189) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1))) is different from false [2025-03-17 12:12:56,438 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1183 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1183))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1189) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1))) is different from false [2025-03-17 12:13:00,505 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:00,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:00,508 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 30 treesize of output 31 [2025-03-17 12:13:00,511 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 52 treesize of output 48 [2025-03-17 12:13:00,513 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:00,514 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 26 treesize of output 18 [2025-03-17 12:13:00,516 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:00,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-17 12:13:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837168794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:13:08,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:13:08,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 37 [2025-03-17 12:13:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677731814] [2025-03-17 12:13:08,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:13:08,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 12:13:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:08,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 12:13:08,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1126, Unknown=12, NotChecked=142, Total=1482 [2025-03-17 12:13:08,663 INFO L87 Difference]: Start difference. First operand 293 states and 343 transitions. Second operand has 39 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 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-17 12:13:17,492 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-17 12:13:29,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 12:13:33,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 12:13:37,926 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]