./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/list-ext-properties/test-0513_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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:34:35,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:34:35,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:34:35,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:34:35,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:34:35,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:34:35,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:34:35,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:34:35,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:34:35,095 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:34:35,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:34:35,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:34:35,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:34:35,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:34:35,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:34:35,096 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:34:35,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:34:35,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:34:35,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:34:35,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:34:35,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:34:35,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:34:35,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:34:35,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:34:35,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:34:35,098 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2025-03-04 07:34:35,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:34:35,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:34:35,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:34:35,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:34:35,313 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:34:35,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2025-03-04 07:34:36,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe715b12/d9808202534d4608aab1b59aea55ba33/FLAG644361a58 [2025-03-04 07:34:36,773 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:34:36,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2025-03-04 07:34:36,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe715b12/d9808202534d4608aab1b59aea55ba33/FLAG644361a58 [2025-03-04 07:34:37,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe715b12/d9808202534d4608aab1b59aea55ba33 [2025-03-04 07:34:37,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:34:37,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:34:37,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:34:37,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:34:37,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:34:37,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b54bfa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37, skipping insertion in model container [2025-03-04 07:34:37,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:34:37,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:34:37,310 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:34:37,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:34:37,381 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:34:37,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37 WrapperNode [2025-03-04 07:34:37,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:34:37,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:34:37,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:34:37,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:34:37,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,413 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2025-03-04 07:34:37,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:34:37,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:34:37,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:34:37,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:34:37,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,439 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 13 writes are split as follows [0, 13]. [2025-03-04 07:34:37,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:34:37,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:34:37,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:34:37,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:34:37,452 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (1/1) ... [2025-03-04 07:34:37,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:34:37,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:37,477 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-04 07:34:37,478 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-04 07:34:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:34:37,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:34:37,575 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:34:37,576 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:34:37,931 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2025-03-04 07:34:37,931 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:34:37,942 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:34:37,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:34:37,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:37 BoogieIcfgContainer [2025-03-04 07:34:37,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:34:37,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:34:37,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:34:37,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:34:37,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:34:37" (1/3) ... [2025-03-04 07:34:37,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25382ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:34:37, skipping insertion in model container [2025-03-04 07:34:37,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:37" (2/3) ... [2025-03-04 07:34:37,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25382ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:34:37, skipping insertion in model container [2025-03-04 07:34:37,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:37" (3/3) ... [2025-03-04 07:34:37,952 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2025-03-04 07:34:37,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:34:37,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0513_1.i that has 1 procedures, 150 locations, 1 initial locations, 4 loop locations, and 70 error locations. [2025-03-04 07:34:37,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:34:37,999 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;@2dfa029b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:34:37,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-04 07:34:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 79 states have (on average 2.1139240506329116) internal successors, (167), 149 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-04 07:34:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:34:38,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:34:38,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:38,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,012 INFO L85 PathProgramCache]: Analyzing trace with hash 189873203, now seen corresponding path program 1 times [2025-03-04 07:34:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160477971] [2025-03-04 07:34:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:34:38,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:34:38,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,118 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-04 07:34:38,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160477971] [2025-03-04 07:34:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160477971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:38,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848127690] [2025-03-04 07:34:38,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:34:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:34:38,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:34:38,147 INFO L87 Difference]: Start difference. First operand has 150 states, 79 states have (on average 2.1139240506329116) internal successors, (167), 149 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-04 07:34:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,159 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2025-03-04 07:34:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:34:38,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-04 07:34:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,165 INFO L225 Difference]: With dead ends: 150 [2025-03-04 07:34:38,166 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 07:34:38,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:34:38,170 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:38,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 07:34:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 07:34:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 78 states have (on average 2.076923076923077) internal successors, (162), 147 states have internal predecessors, (162), 0 states have call successors, (0), 0 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-04 07:34:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2025-03-04 07:34:38,202 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 5 [2025-03-04 07:34:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,202 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2025-03-04 07:34:38,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-04 07:34:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2025-03-04 07:34:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:34:38,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:34:38,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:38,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2080156656, now seen corresponding path program 1 times [2025-03-04 07:34:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725968521] [2025-03-04 07:34:38,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:34:38,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:34:38,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,267 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-04 07:34:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725968521] [2025-03-04 07:34:38,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725968521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:38,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087955646] [2025-03-04 07:34:38,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:38,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:38,270 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,393 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2025-03-04 07:34:38,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:38,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:34:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,395 INFO L225 Difference]: With dead ends: 195 [2025-03-04 07:34:38,395 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 07:34:38,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:38,396 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 43 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:38,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 232 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 07:34:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 152. [2025-03-04 07:34:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 82 states have (on average 2.048780487804878) internal successors, (168), 151 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-04 07:34:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2025-03-04 07:34:38,405 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 7 [2025-03-04 07:34:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,405 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2025-03-04 07:34:38,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2025-03-04 07:34:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:34:38,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:34:38,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:38,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2080156799, now seen corresponding path program 1 times [2025-03-04 07:34:38,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790063985] [2025-03-04 07:34:38,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:34:38,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:34:38,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,447 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-04 07:34:38,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790063985] [2025-03-04 07:34:38,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790063985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:38,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136258818] [2025-03-04 07:34:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:38,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:38,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:38,449 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,502 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2025-03-04 07:34:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:38,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:34:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,503 INFO L225 Difference]: With dead ends: 170 [2025-03-04 07:34:38,504 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 07:34:38,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-04 07:34:38,504 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 22 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:38,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 280 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 07:34:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-03-04 07:34:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2025-03-04 07:34:38,510 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2025-03-04 07:34:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,510 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2025-03-04 07:34:38,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2025-03-04 07:34:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:34:38,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:34:38,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2080159074, now seen corresponding path program 1 times [2025-03-04 07:34:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652945999] [2025-03-04 07:34:38,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:34:38,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:34:38,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,564 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-04 07:34:38,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652945999] [2025-03-04 07:34:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652945999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999705409] [2025-03-04 07:34:38,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:38,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:38,566 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,673 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2025-03-04 07:34:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:38,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:34:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,674 INFO L225 Difference]: With dead ends: 166 [2025-03-04 07:34:38,674 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 07:34:38,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:38,675 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 52 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:38,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 181 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 07:34:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2025-03-04 07:34:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 95 states have (on average 1.9578947368421054) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-04 07:34:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2025-03-04 07:34:38,683 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 7 [2025-03-04 07:34:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,683 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2025-03-04 07:34:38,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2025-03-04 07:34:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:34:38,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:34:38,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:38,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2080159075, now seen corresponding path program 1 times [2025-03-04 07:34:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413565798] [2025-03-04 07:34:38,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:34:38,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:34:38,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,773 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-04 07:34:38,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413565798] [2025-03-04 07:34:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413565798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184016742] [2025-03-04 07:34:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:38,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:38,775 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,854 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2025-03-04 07:34:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:34:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,855 INFO L225 Difference]: With dead ends: 156 [2025-03-04 07:34:38,855 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 07:34:38,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:38,856 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 28 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:38,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 202 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 07:34:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-04 07:34:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 95 states have (on average 1.8736842105263158) internal successors, (178), 155 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-04 07:34:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2025-03-04 07:34:38,866 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 7 [2025-03-04 07:34:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,866 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2025-03-04 07:34:38,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2025-03-04 07:34:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:34:38,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:34:38,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:38,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1902048980, now seen corresponding path program 1 times [2025-03-04 07:34:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083720222] [2025-03-04 07:34:38,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:34:38,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:34:38,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,924 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-04 07:34:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083720222] [2025-03-04 07:34:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083720222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698541153] [2025-03-04 07:34:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:38,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:38,926 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-04 07:34:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,952 INFO L93 Difference]: Finished difference Result 293 states and 327 transitions. [2025-03-04 07:34:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:34:38,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-04 07:34:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,954 INFO L225 Difference]: With dead ends: 293 [2025-03-04 07:34:38,954 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 07:34:38,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:38,955 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 147 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:38,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 439 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 07:34:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 159. [2025-03-04 07:34:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 98 states have (on average 1.816326530612245) internal successors, (178), 158 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-04 07:34:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2025-03-04 07:34:38,963 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 13 [2025-03-04 07:34:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,963 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2025-03-04 07:34:38,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-04 07:34:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2025-03-04 07:34:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:34:38,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:34:38,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:38,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash -875348560, now seen corresponding path program 1 times [2025-03-04 07:34:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472691698] [2025-03-04 07:34:38,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:34:38,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:34:38,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:39,034 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-04 07:34:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472691698] [2025-03-04 07:34:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472691698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:39,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:39,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196170963] [2025-03-04 07:34:39,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:39,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:39,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:39,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:39,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:39,036 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:39,104 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2025-03-04 07:34:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:39,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:34:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:39,106 INFO L225 Difference]: With dead ends: 155 [2025-03-04 07:34:39,106 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 07:34:39,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:39,106 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:39,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 203 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 07:34:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-04 07:34:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 98 states have (on average 1.7755102040816326) internal successors, (174), 154 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-04 07:34:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2025-03-04 07:34:39,111 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 16 [2025-03-04 07:34:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:39,111 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2025-03-04 07:34:39,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2025-03-04 07:34:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:34:39,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:39,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:39,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:34:39,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:39,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash -875348559, now seen corresponding path program 1 times [2025-03-04 07:34:39,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914930952] [2025-03-04 07:34:39,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:39,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:34:39,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:34:39,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:39,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:39,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:39,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914930952] [2025-03-04 07:34:39,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914930952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:39,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:39,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044090357] [2025-03-04 07:34:39,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:39,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:39,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:39,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:39,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:39,195 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:39,256 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2025-03-04 07:34:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:39,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:34:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:39,257 INFO L225 Difference]: With dead ends: 152 [2025-03-04 07:34:39,257 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 07:34:39,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:39,258 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 11 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:39,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 214 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 07:34:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-04 07:34:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 98 states have (on average 1.7448979591836735) internal successors, (171), 151 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 171 transitions. [2025-03-04 07:34:39,261 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 171 transitions. Word has length 16 [2025-03-04 07:34:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:39,261 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 171 transitions. [2025-03-04 07:34:39,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 171 transitions. [2025-03-04 07:34:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:34:39,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:39,262 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:39,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:34:39,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:39,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1971904581, now seen corresponding path program 1 times [2025-03-04 07:34:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298683964] [2025-03-04 07:34:39,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:39,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:34:39,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:34:39,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:39,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298683964] [2025-03-04 07:34:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298683964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618837689] [2025-03-04 07:34:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:39,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:39,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:39,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:39,331 INFO L87 Difference]: Start difference. First operand 152 states and 171 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:39,413 INFO L93 Difference]: Finished difference Result 221 states and 263 transitions. [2025-03-04 07:34:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:39,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:34:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:39,414 INFO L225 Difference]: With dead ends: 221 [2025-03-04 07:34:39,415 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 07:34:39,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:39,416 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 97 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:39,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 322 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 07:34:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 152. [2025-03-04 07:34:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 151 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-04 07:34:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2025-03-04 07:34:39,420 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 24 [2025-03-04 07:34:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:39,420 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2025-03-04 07:34:39,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2025-03-04 07:34:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:34:39,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:39,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:34:39,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1971904438, now seen corresponding path program 1 times [2025-03-04 07:34:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:39,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590600714] [2025-03-04 07:34:39,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:39,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:39,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:34:39,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:34:39,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:39,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:39,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:39,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590600714] [2025-03-04 07:34:39,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590600714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:39,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:39,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490008582] [2025-03-04 07:34:39,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:39,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:39,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:39,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:39,537 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:39,677 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2025-03-04 07:34:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:34:39,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:34:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:39,678 INFO L225 Difference]: With dead ends: 145 [2025-03-04 07:34:39,678 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 07:34:39,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:39,679 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 46 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:39,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 286 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 07:34:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-04 07:34:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 144 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-04 07:34:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2025-03-04 07:34:39,682 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 24 [2025-03-04 07:34:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:39,682 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2025-03-04 07:34:39,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2025-03-04 07:34:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:34:39,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:39,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:39,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:34:39,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:39,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1971904437, now seen corresponding path program 1 times [2025-03-04 07:34:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:39,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965036290] [2025-03-04 07:34:39,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:39,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:34:39,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:34:39,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:39,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965036290] [2025-03-04 07:34:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965036290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:39,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:39,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:39,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974168093] [2025-03-04 07:34:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:39,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:39,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:39,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:39,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:39,798 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:39,937 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2025-03-04 07:34:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:34:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:39,939 INFO L225 Difference]: With dead ends: 208 [2025-03-04 07:34:39,939 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 07:34:39,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:39,940 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 87 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:39,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 253 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 07:34:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 184. [2025-03-04 07:34:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 140 states have (on average 1.6714285714285715) internal successors, (234), 183 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 234 transitions. [2025-03-04 07:34:39,948 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 234 transitions. Word has length 24 [2025-03-04 07:34:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 234 transitions. [2025-03-04 07:34:39,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 234 transitions. [2025-03-04 07:34:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:34:39,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:39,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:39,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:34:39,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:39,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2050032318, now seen corresponding path program 1 times [2025-03-04 07:34:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945918266] [2025-03-04 07:34:39,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:39,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:34:39,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:34:39,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:39,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:40,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945918266] [2025-03-04 07:34:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945918266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:40,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:34:40,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653458057] [2025-03-04 07:34:40,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:40,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:34:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:40,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:34:40,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:40,236 INFO L87 Difference]: Start difference. First operand 184 states and 234 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:40,353 INFO L93 Difference]: Finished difference Result 197 states and 249 transitions. [2025-03-04 07:34:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:40,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 07:34:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:40,354 INFO L225 Difference]: With dead ends: 197 [2025-03-04 07:34:40,354 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 07:34:40,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:34:40,355 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 7 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:40,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 509 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 07:34:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2025-03-04 07:34:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 148 states have (on average 1.6486486486486487) internal successors, (244), 191 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-04 07:34:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 244 transitions. [2025-03-04 07:34:40,358 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 244 transitions. Word has length 29 [2025-03-04 07:34:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:40,359 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 244 transitions. [2025-03-04 07:34:40,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 244 transitions. [2025-03-04 07:34:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:34:40,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:40,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:40,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:34:40,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2051355996, now seen corresponding path program 1 times [2025-03-04 07:34:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768121566] [2025-03-04 07:34:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:40,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:34:40,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:34:40,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:40,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:40,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:40,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768121566] [2025-03-04 07:34:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768121566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:40,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:40,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913225005] [2025-03-04 07:34:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:40,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:40,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:40,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:40,437 INFO L87 Difference]: Start difference. First operand 192 states and 244 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:40,510 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2025-03-04 07:34:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:40,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 07:34:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:40,511 INFO L225 Difference]: With dead ends: 216 [2025-03-04 07:34:40,511 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 07:34:40,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:40,512 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 86 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:40,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 323 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 07:34:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 193. [2025-03-04 07:34:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 149 states have (on average 1.6442953020134228) internal successors, (245), 192 states have internal predecessors, (245), 0 states have call successors, (0), 0 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-04 07:34:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2025-03-04 07:34:40,516 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 29 [2025-03-04 07:34:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:40,517 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2025-03-04 07:34:40,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2025-03-04 07:34:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:34:40,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:40,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:40,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:34:40,518 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:40,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:40,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1143174198, now seen corresponding path program 1 times [2025-03-04 07:34:40,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:40,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340481728] [2025-03-04 07:34:40,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:40,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:34:40,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:34:40,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:40,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340481728] [2025-03-04 07:34:40,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340481728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:40,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:40,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:34:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79923472] [2025-03-04 07:34:40,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:40,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:34:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:40,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:34:40,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:34:40,794 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 07:34:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:41,008 INFO L93 Difference]: Finished difference Result 277 states and 343 transitions. [2025-03-04 07:34:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:34:41,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-04 07:34:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:41,009 INFO L225 Difference]: With dead ends: 277 [2025-03-04 07:34:41,009 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 07:34:41,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:34:41,010 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 123 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:41,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 465 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 07:34:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 218. [2025-03-04 07:34:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 174 states have (on average 1.5862068965517242) internal successors, (276), 217 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 276 transitions. [2025-03-04 07:34:41,018 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 276 transitions. Word has length 32 [2025-03-04 07:34:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:41,019 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 276 transitions. [2025-03-04 07:34:41,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 07:34:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 276 transitions. [2025-03-04 07:34:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:34:41,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:41,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:41,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:34:41,021 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:41,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1143174934, now seen corresponding path program 1 times [2025-03-04 07:34:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:41,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128518423] [2025-03-04 07:34:41,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:41,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:34:41,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:34:41,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:41,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:41,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:41,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128518423] [2025-03-04 07:34:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128518423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:41,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:41,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:34:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786015851] [2025-03-04 07:34:41,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:41,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:34:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:41,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:34:41,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:34:41,344 INFO L87 Difference]: Start difference. First operand 218 states and 276 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 07:34:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:41,682 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2025-03-04 07:34:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:34:41,683 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-04 07:34:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:41,684 INFO L225 Difference]: With dead ends: 249 [2025-03-04 07:34:41,684 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 07:34:41,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:34:41,684 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 98 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:41,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 434 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:34:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 07:34:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 219. [2025-03-04 07:34:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 175 states have (on average 1.5885714285714285) internal successors, (278), 218 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-04 07:34:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 278 transitions. [2025-03-04 07:34:41,688 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 278 transitions. Word has length 32 [2025-03-04 07:34:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:41,688 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 278 transitions. [2025-03-04 07:34:41,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 07:34:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 278 transitions. [2025-03-04 07:34:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:34:41,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:41,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:41,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:34:41,689 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:41,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1143174935, now seen corresponding path program 1 times [2025-03-04 07:34:41,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:41,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693754153] [2025-03-04 07:34:41,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:41,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:34:41,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:34:41,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:41,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693754153] [2025-03-04 07:34:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693754153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298485092] [2025-03-04 07:34:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:34:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:42,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:34:42,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:42,040 INFO L87 Difference]: Start difference. First operand 219 states and 278 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 07:34:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:42,273 INFO L93 Difference]: Finished difference Result 277 states and 341 transitions. [2025-03-04 07:34:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:34:42,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-04 07:34:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:42,275 INFO L225 Difference]: With dead ends: 277 [2025-03-04 07:34:42,275 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 07:34:42,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:34:42,275 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:42,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 309 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 07:34:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 219. [2025-03-04 07:34:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 175 states have (on average 1.582857142857143) internal successors, (277), 218 states have internal predecessors, (277), 0 states have call successors, (0), 0 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-04 07:34:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 277 transitions. [2025-03-04 07:34:42,280 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 277 transitions. Word has length 32 [2025-03-04 07:34:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:42,281 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 277 transitions. [2025-03-04 07:34:42,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 07:34:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2025-03-04 07:34:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:34:42,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:42,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:42,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:34:42,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:42,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -920516461, now seen corresponding path program 1 times [2025-03-04 07:34:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:42,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585967797] [2025-03-04 07:34:42,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:42,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:34:42,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:34:42,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:42,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:34:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:42,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585967797] [2025-03-04 07:34:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585967797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:42,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214447186] [2025-03-04 07:34:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:42,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:42,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:42,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:42,329 INFO L87 Difference]: Start difference. First operand 219 states and 277 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 07:34:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:42,467 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2025-03-04 07:34:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:34:42,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 34 [2025-03-04 07:34:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:42,468 INFO L225 Difference]: With dead ends: 284 [2025-03-04 07:34:42,468 INFO L226 Difference]: Without dead ends: 284 [2025-03-04 07:34:42,469 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-04 07:34:42,469 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 76 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:42,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 265 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-04 07:34:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 221. [2025-03-04 07:34:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 181 states have (on average 1.580110497237569) internal successors, (286), 220 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-04 07:34:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 286 transitions. [2025-03-04 07:34:42,482 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 286 transitions. Word has length 34 [2025-03-04 07:34:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:42,482 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 286 transitions. [2025-03-04 07:34:42,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 07:34:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 286 transitions. [2025-03-04 07:34:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:34:42,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:42,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:42,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:34:42,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:42,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash -920516460, now seen corresponding path program 1 times [2025-03-04 07:34:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532377016] [2025-03-04 07:34:42,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:42,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:34:42,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:34:42,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:42,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:42,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:42,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532377016] [2025-03-04 07:34:42,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532377016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:42,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:42,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:34:42,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123157731] [2025-03-04 07:34:42,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:42,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:34:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:42,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:34:42,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:34:42,956 INFO L87 Difference]: Start difference. First operand 221 states and 286 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-04 07:34:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:43,381 INFO L93 Difference]: Finished difference Result 290 states and 364 transitions. [2025-03-04 07:34:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:34:43,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-04 07:34:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:43,382 INFO L225 Difference]: With dead ends: 290 [2025-03-04 07:34:43,382 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 07:34:43,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:34:43,383 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 115 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:43,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 448 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:34:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 07:34:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 226. [2025-03-04 07:34:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 225 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-04 07:34:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 292 transitions. [2025-03-04 07:34:43,387 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 292 transitions. Word has length 34 [2025-03-04 07:34:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:43,387 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 292 transitions. [2025-03-04 07:34:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-04 07:34:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 292 transitions. [2025-03-04 07:34:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:34:43,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:43,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:43,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:34:43,388 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:43,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash -521150640, now seen corresponding path program 1 times [2025-03-04 07:34:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:43,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464957868] [2025-03-04 07:34:43,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:43,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:34:43,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:34:43,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:43,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:34:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464957868] [2025-03-04 07:34:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464957868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977005903] [2025-03-04 07:34:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:43,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:43,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:43,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:43,415 INFO L87 Difference]: Start difference. First operand 226 states and 292 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:43,420 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2025-03-04 07:34:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 07:34:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:43,422 INFO L225 Difference]: With dead ends: 227 [2025-03-04 07:34:43,422 INFO L226 Difference]: Without dead ends: 227 [2025-03-04 07:34:43,422 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-04 07:34:43,422 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 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-04 07:34:43,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-04 07:34:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-03-04 07:34:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 187 states have (on average 1.5668449197860963) internal successors, (293), 226 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-04 07:34:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 293 transitions. [2025-03-04 07:34:43,425 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 293 transitions. Word has length 38 [2025-03-04 07:34:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:43,426 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 293 transitions. [2025-03-04 07:34:43,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 293 transitions. [2025-03-04 07:34:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:34:43,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:43,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:43,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:34:43,426 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:34:43,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1024200120, now seen corresponding path program 1 times [2025-03-04 07:34:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:43,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569051451] [2025-03-04 07:34:43,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:43,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:34:43,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:34:43,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:43,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:43,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569051451] [2025-03-04 07:34:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569051451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179082880] [2025-03-04 07:34:43,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:43,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:43,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:43,974 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-04 07:34:43,976 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-04 07:34:44,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:34:44,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:34:44,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:44,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:44,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:34:44,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:44,124 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-04 07:34:44,171 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 19 treesize of output 1 [2025-03-04 07:34:44,200 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:34:44,200 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-04 07:34:44,238 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 18 treesize of output 13 [2025-03-04 07:34:44,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:34:44,287 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 26 treesize of output 21 [2025-03-04 07:34:44,309 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-04 07:34:44,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:44,390 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 27 treesize of output 25 [2025-03-04 07:34:44,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:44,398 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 31 treesize of output 25 [2025-03-04 07:34:44,609 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 19 treesize of output 7 [2025-03-04 07:34:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:44,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:44,860 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 74 treesize of output 70 [2025-03-04 07:34:44,863 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 102 treesize of output 94 [2025-03-04 07:34:44,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse6 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))) (.cse1 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10))) (or (< 1 (select .cse7 .cse3)) (< 1 (select .cse7 (+ 4 v_arrayElimCell_11))))))) (.cse5 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (and (or .cse0 .cse1) (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604))) (let ((.cse4 (select .cse2 v_arrayElimCell_10))) (or (< 1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)) (< 1 (select .cse4 .cse3)) (< 1 (select .cse4 (+ 4 v_arrayElimCell_11))))))) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse3))) (not .cse0) (not .cse5)) (or .cse0 .cse6) (or .cse6 .cse5) (or .cse1 .cse5)))) is different from false [2025-03-04 07:34:45,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:45,348 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 103 treesize of output 74 [2025-03-04 07:34:45,370 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2025-03-04 07:34:45,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 115 [2025-03-04 07:34:45,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:45,384 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 91 treesize of output 88 [2025-03-04 07:34:45,389 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 79 treesize of output 75 [2025-03-04 07:34:45,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:45,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 65 [2025-03-04 07:34:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179082880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:45,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2025-03-04 07:34:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939864999] [2025-03-04 07:34:45,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:45,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 07:34:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:45,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 07:34:45,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1199, Unknown=21, NotChecked=70, Total=1406 [2025-03-04 07:34:45,924 INFO L87 Difference]: Start difference. First operand 227 states and 293 transitions. Second operand has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-04 07:34:46,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (and (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse1 (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10))) (or (< 1 (select .cse1 .cse2)) (< 1 (select .cse1 (+ 4 v_arrayElimCell_11))))))) (< 1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604))) (let ((.cse4 (select .cse3 v_arrayElimCell_10))) (or (< 1 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (< 1 (select .cse4 .cse2)) (< 1 (select .cse4 (+ 4 v_arrayElimCell_11))))))) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~lItem~0#1.base_40| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (or (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse6 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~lItem~0#1.base_40| v_ArrVal_604))) (let ((.cse5 (select .cse6 v_arrayElimCell_10))) (or (< 1 (select .cse5 (+ 4 v_arrayElimCell_11))) (< 1 (select .cse5 .cse2)) (< 1 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))) (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not .cse0)) (<= 1 |c_ULTIMATE.start_main_~c1~0#1|))) is different from false [2025-03-04 07:34:50,995 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-04 07:34:52,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:34:59,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse3 (< 0 (+ 2 |c_ULTIMATE.start_main_~c1~0#1|)))) (and (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse1 (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10))) (or (< 1 (select .cse1 .cse2)) (< 1 (select .cse1 (+ 4 v_arrayElimCell_11))))))) (< 1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (or .cse3 (forall ((v_prenex_5 Int)) (not (= (select |c_#valid| v_prenex_5) 0)))) (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604))) (let ((.cse5 (select .cse4 v_arrayElimCell_10))) (or (< 1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (< 1 (select .cse5 .cse2)) (< 1 (select .cse5 (+ 4 v_arrayElimCell_11))))))) (<= 0 |c_ULTIMATE.start_main_~c1~0#1|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~lItem~0#1.base_40| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (or (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~lItem~0#1.base_40| v_ArrVal_604))) (let ((.cse6 (select .cse7 v_arrayElimCell_10))) (or (< 1 (select .cse6 (+ 4 v_arrayElimCell_11))) (< 1 (select .cse6 .cse2)) (< 1 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))) (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not .cse0)) (or .cse3 (forall ((v_arrayElimCell_10 Int)) (not (= (select |c_#valid| v_arrayElimCell_10) 0)))) (or .cse3 (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))))) is different from false [2025-03-04 07:35:13,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:13,560 INFO L93 Difference]: Finished difference Result 449 states and 577 transitions. [2025-03-04 07:35:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 07:35:13,561 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-04 07:35:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:13,562 INFO L225 Difference]: With dead ends: 449 [2025-03-04 07:35:13,562 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 07:35:13,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=394, Invalid=2785, Unknown=25, NotChecked=336, Total=3540 [2025-03-04 07:35:13,564 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 466 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:13,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1923 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2290 Invalid, 1 Unknown, 352 Unchecked, 24.2s Time] [2025-03-04 07:35:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 07:35:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 238. [2025-03-04 07:35:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 198 states have (on average 1.5353535353535352) internal successors, (304), 237 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 304 transitions. [2025-03-04 07:35:13,570 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 304 transitions. Word has length 39 [2025-03-04 07:35:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:13,570 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 304 transitions. [2025-03-04 07:35:13,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-04 07:35:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 304 transitions. [2025-03-04 07:35:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:35:13,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:13,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:13,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:35:13,773 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-04 07:35:13,774 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:35:13,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1684577646, now seen corresponding path program 1 times [2025-03-04 07:35:13,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:13,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617387497] [2025-03-04 07:35:13,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:13,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:35:13,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:35:13,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:13,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617387497] [2025-03-04 07:35:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617387497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:35:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042306911] [2025-03-04 07:35:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:35:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:15,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:35:15,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:35:15,530 INFO L87 Difference]: Start difference. First operand 238 states and 304 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-04 07:35:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:20,507 INFO L93 Difference]: Finished difference Result 303 states and 376 transitions. [2025-03-04 07:35:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:35:20,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-04 07:35:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:20,508 INFO L225 Difference]: With dead ends: 303 [2025-03-04 07:35:20,509 INFO L226 Difference]: Without dead ends: 303 [2025-03-04 07:35:20,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:35:20,509 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 126 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:20,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 480 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 07:35:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-04 07:35:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 241. [2025-03-04 07:35:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 201 states have (on average 1.5323383084577114) internal successors, (308), 240 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-04 07:35:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 308 transitions. [2025-03-04 07:35:20,514 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 308 transitions. Word has length 40 [2025-03-04 07:35:20,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:20,514 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 308 transitions. [2025-03-04 07:35:20,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-04 07:35:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 308 transitions. [2025-03-04 07:35:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:35:20,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:20,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:20,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:35:20,515 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:35:20,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash 682299450, now seen corresponding path program 1 times [2025-03-04 07:35:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:20,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261097820] [2025-03-04 07:35:20,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:20,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:35:20,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:35:20,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:20,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261097820] [2025-03-04 07:35:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261097820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:22,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:22,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:35:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255848405] [2025-03-04 07:35:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:35:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:22,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:35:22,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:35:22,254 INFO L87 Difference]: Start difference. First operand 241 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-04 07:35:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:28,499 INFO L93 Difference]: Finished difference Result 304 states and 377 transitions. [2025-03-04 07:35:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:35:28,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-04 07:35:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:28,504 INFO L225 Difference]: With dead ends: 304 [2025-03-04 07:35:28,504 INFO L226 Difference]: Without dead ends: 304 [2025-03-04 07:35:28,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:35:28,505 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 120 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:28,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 477 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-04 07:35:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-04 07:35:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 242. [2025-03-04 07:35:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 202 states have (on average 1.5297029702970297) internal successors, (309), 241 states have internal predecessors, (309), 0 states have call successors, (0), 0 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-04 07:35:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 309 transitions. [2025-03-04 07:35:28,510 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 309 transitions. Word has length 41 [2025-03-04 07:35:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 309 transitions. [2025-03-04 07:35:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-04 07:35:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 309 transitions. [2025-03-04 07:35:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:35:28,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:28,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:28,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:35:28,511 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:35:28,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 682300250, now seen corresponding path program 1 times [2025-03-04 07:35:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019311675] [2025-03-04 07:35:28,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:28,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:35:28,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:35:28,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:28,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:34,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:34,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019311675] [2025-03-04 07:35:34,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019311675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:34,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:34,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 07:35:34,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160817637] [2025-03-04 07:35:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:34,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:35:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:34,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:35:34,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:35:34,638 INFO L87 Difference]: Start difference. First operand 242 states and 309 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-04 07:35:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:47,459 INFO L93 Difference]: Finished difference Result 254 states and 321 transitions. [2025-03-04 07:35:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:35:47,460 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-04 07:35:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:47,460 INFO L225 Difference]: With dead ends: 254 [2025-03-04 07:35:47,460 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 07:35:47,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:35:47,461 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 67 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:47,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 843 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2025-03-04 07:35:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 07:35:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 245. [2025-03-04 07:35:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 205 states have (on average 1.5219512195121951) internal successors, (312), 244 states have internal predecessors, (312), 0 states have call successors, (0), 0 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-04 07:35:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 312 transitions. [2025-03-04 07:35:47,464 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 312 transitions. Word has length 41 [2025-03-04 07:35:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:47,465 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 312 transitions. [2025-03-04 07:35:47,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-04 07:35:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 312 transitions. [2025-03-04 07:35:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:35:47,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:47,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:47,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:35:47,466 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-03-04 07:35:47,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1697322871, now seen corresponding path program 1 times [2025-03-04 07:35:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:47,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720483473] [2025-03-04 07:35:47,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:47,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:35:47,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:35:47,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:47,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720483473] [2025-03-04 07:35:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720483473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:49,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905823668] [2025-03-04 07:35:49,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:49,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:49,600 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-04 07:35:49,600 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-04 07:35:49,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:35:49,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:35:49,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:49,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:49,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 07:35:49,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:50,564 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:35:50,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-03-04 07:35:51,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:35:52,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:35:52,559 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 23 treesize of output 21 [2025-03-04 07:35:53,885 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:35:53,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2025-03-04 07:35:54,520 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~data~0#1.base_46| Int)) (and (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_46| 0) |c_ULTIMATE.start_main_~item2~0#1.base| 0)) (= (select |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_46|) 0))) is different from true [2025-03-04 07:35:55,387 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-04 07:35:55,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2025-03-04 07:35:55,531 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~data~0#1.base_46| Int) (|v_ULTIMATE.start_main_~item2~0#1.base_33| Int)) (and (= (store (store |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_46| 0) |v_ULTIMATE.start_main_~item2~0#1.base_33| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= (select |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_46|) 0) (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item2~0#1.base_33|)))) is different from true [2025-03-04 07:35:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 07:35:55,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:57,642 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 48 treesize of output 44