./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0217.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/memsafety/test-0217.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:36:22,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:36:22,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:36:22,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:36:22,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:36:22,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:36:22,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:36:22,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:36:22,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:36:22,209 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:36:22,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:36:22,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:36:22,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:36:22,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:36:22,210 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:36:22,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:36:22,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:36:22,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:36:22,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:36:22,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:36:22,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:36:22,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:36:22,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:36:22,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:36:22,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:36:22,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:36:22,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:36:22,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:36:22,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:36:22,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:36:22,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:36:22,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:36:22,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:36:22,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:36:22,214 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2025-03-04 07:36:22,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:36:22,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:36:22,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:36:22,497 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:36:22,497 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:36:22,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2025-03-04 07:36:23,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f5a9c98/5960598e871e465d937bf6157e8e05d4/FLAGfdb17f4aa [2025-03-04 07:36:23,927 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:36:23,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2025-03-04 07:36:23,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f5a9c98/5960598e871e465d937bf6157e8e05d4/FLAGfdb17f4aa [2025-03-04 07:36:23,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f5a9c98/5960598e871e465d937bf6157e8e05d4 [2025-03-04 07:36:23,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:36:23,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:36:23,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:36:23,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:36:23,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:36:23,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:36:23" (1/1) ... [2025-03-04 07:36:23,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5e5189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:23, skipping insertion in model container [2025-03-04 07:36:23,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:36:23" (1/1) ... [2025-03-04 07:36:23,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:36:24,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:36:24,305 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:36:24,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:36:24,363 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:36:24,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24 WrapperNode [2025-03-04 07:36:24,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:36:24,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:36:24,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:36:24,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:36:24,371 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:36:24" (1/1) ... [2025-03-04 07:36:24,387 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:36:24" (1/1) ... [2025-03-04 07:36:24,408 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 206 [2025-03-04 07:36:24,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:36:24,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:36:24,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:36:24,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:36:24,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,444 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 4 initializations are split as follows [2, 2]. The 11 writes are split as follows [0, 11]. [2025-03-04 07:36:24,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:36:24,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:36:24,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:36:24,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:36:24,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (1/1) ... [2025-03-04 07:36:24,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:36:24,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:24,487 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:36:24,490 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:36:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-03-04 07:36:24,506 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-03-04 07:36:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:36:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:36:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:36:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:36:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:36:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:36:24,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:36:24,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:36:24,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:36:25,033 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2025-03-04 07:36:25,033 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:36:25,044 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:36:25,045 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:36:25,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:36:25 BoogieIcfgContainer [2025-03-04 07:36:25,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:36:25,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:36:25,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:36:25,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:36:25,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:36:23" (1/3) ... [2025-03-04 07:36:25,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feeb25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:36:25, skipping insertion in model container [2025-03-04 07:36:25,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:24" (2/3) ... [2025-03-04 07:36:25,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feeb25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:36:25, skipping insertion in model container [2025-03-04 07:36:25,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:36:25" (3/3) ... [2025-03-04 07:36:25,053 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0217.i [2025-03-04 07:36:25,064 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:36:25,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0217.i that has 2 procedures, 166 locations, 1 initial locations, 6 loop locations, and 67 error locations. [2025-03-04 07:36:25,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:36:25,111 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@43173ff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:36:25,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-03-04 07:36:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 95 states have (on average 1.9578947368421054) internal successors, (186), 162 states have internal predecessors, (186), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:36:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:36:25,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:25,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:36:25,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:25,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1875644044, now seen corresponding path program 1 times [2025-03-04 07:36:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137425674] [2025-03-04 07:36:25,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:25,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:36:25,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:36:25,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:25,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:25,238 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:36:25,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137425674] [2025-03-04 07:36:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137425674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:25,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:25,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:36:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051401876] [2025-03-04 07:36:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:25,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:36:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:25,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:36:25,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:36:25,263 INFO L87 Difference]: Start difference. First operand has 166 states, 95 states have (on average 1.9578947368421054) internal successors, (186), 162 states have internal predecessors, (186), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:25,280 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2025-03-04 07:36:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:36:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:36:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:25,287 INFO L225 Difference]: With dead ends: 166 [2025-03-04 07:36:25,287 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 07:36:25,289 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:36:25,293 INFO L435 NwaCegarLoop]: 185 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, 185 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:36:25,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:36:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 07:36:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-04 07:36:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 94 states have (on average 1.9042553191489362) internal successors, (179), 160 states have internal predecessors, (179), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:36:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2025-03-04 07:36:25,331 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 6 [2025-03-04 07:36:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:25,331 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2025-03-04 07:36:25,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2025-03-04 07:36:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:36:25,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:25,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:25,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:36:25,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1988660152, now seen corresponding path program 1 times [2025-03-04 07:36:25,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:25,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568981031] [2025-03-04 07:36:25,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:25,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:25,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:36:25,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:36:25,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:25,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:25,454 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:36:25,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568981031] [2025-03-04 07:36:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568981031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:25,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:25,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:36:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021739401] [2025-03-04 07:36:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:25,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:36:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:25,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:36:25,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:36:25,457 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:36:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:25,657 INFO L93 Difference]: Finished difference Result 319 states and 356 transitions. [2025-03-04 07:36:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:36:25,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:36:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:25,660 INFO L225 Difference]: With dead ends: 319 [2025-03-04 07:36:25,660 INFO L226 Difference]: Without dead ends: 319 [2025-03-04 07:36:25,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:36:25,660 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 164 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:25,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 233 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-04 07:36:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 228. [2025-03-04 07:36:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 155 states have (on average 1.8774193548387097) internal successors, (291), 221 states have internal predecessors, (291), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:36:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 299 transitions. [2025-03-04 07:36:25,683 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 299 transitions. Word has length 7 [2025-03-04 07:36:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:25,683 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 299 transitions. [2025-03-04 07:36:25,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:36:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 299 transitions. [2025-03-04 07:36:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:36:25,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:25,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:25,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:36:25,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:25,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1988660153, now seen corresponding path program 1 times [2025-03-04 07:36:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369178181] [2025-03-04 07:36:25,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:25,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:36:25,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:36:25,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:25,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:25,808 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:36:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369178181] [2025-03-04 07:36:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369178181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:25,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:25,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:36:25,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950350760] [2025-03-04 07:36:25,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:25,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:25,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:25,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:25,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:25,813 INFO L87 Difference]: Start difference. First operand 228 states and 299 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:25,936 INFO L93 Difference]: Finished difference Result 351 states and 445 transitions. [2025-03-04 07:36:25,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:25,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:36:25,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:25,938 INFO L225 Difference]: With dead ends: 351 [2025-03-04 07:36:25,939 INFO L226 Difference]: Without dead ends: 351 [2025-03-04 07:36:25,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:36:25,940 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 102 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:25,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 350 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-04 07:36:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 301. [2025-03-04 07:36:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 222 states have (on average 1.837837837837838) internal successors, (408), 290 states have internal predecessors, (408), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:36:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 424 transitions. [2025-03-04 07:36:25,953 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 424 transitions. Word has length 7 [2025-03-04 07:36:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:25,954 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 424 transitions. [2025-03-04 07:36:25,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2025-03-04 07:36:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:36:25,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:25,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:36:25,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:25,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1988660184, now seen corresponding path program 1 times [2025-03-04 07:36:25,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:25,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80016583] [2025-03-04 07:36:25,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:25,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:36:25,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:36:25,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:25,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:26,020 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:36:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:26,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80016583] [2025-03-04 07:36:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80016583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:26,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:26,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:36:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18231723] [2025-03-04 07:36:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:26,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:26,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:26,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:26,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:26,021 INFO L87 Difference]: Start difference. First operand 301 states and 424 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:26,149 INFO L93 Difference]: Finished difference Result 350 states and 443 transitions. [2025-03-04 07:36:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:26,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:36:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:26,150 INFO L225 Difference]: With dead ends: 350 [2025-03-04 07:36:26,150 INFO L226 Difference]: Without dead ends: 350 [2025-03-04 07:36:26,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:36:26,151 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 99 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:26,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 351 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:26,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-04 07:36:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 301. [2025-03-04 07:36:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 222 states have (on average 1.837837837837838) internal successors, (408), 290 states have internal predecessors, (408), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:36:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 424 transitions. [2025-03-04 07:36:26,161 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 424 transitions. Word has length 7 [2025-03-04 07:36:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:26,161 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 424 transitions. [2025-03-04 07:36:26,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2025-03-04 07:36:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:36:26,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:26,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:26,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:36:26,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:26,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash -604303750, now seen corresponding path program 1 times [2025-03-04 07:36:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192789398] [2025-03-04 07:36:26,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:26,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:36:26,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:36:26,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:26,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:26,275 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:36:26,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192789398] [2025-03-04 07:36:26,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192789398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:26,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:26,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:26,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594550346] [2025-03-04 07:36:26,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:26,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:26,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:26,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:26,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:26,277 INFO L87 Difference]: Start difference. First operand 301 states and 424 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:26,429 INFO L93 Difference]: Finished difference Result 444 states and 599 transitions. [2025-03-04 07:36:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:26,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:36:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:26,433 INFO L225 Difference]: With dead ends: 444 [2025-03-04 07:36:26,434 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 07:36:26,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:26,435 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 130 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:26,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 722 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 07:36:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 343. [2025-03-04 07:36:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 261 states have (on average 1.8199233716475096) internal successors, (475), 330 states have internal predecessors, (475), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:36:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 495 transitions. [2025-03-04 07:36:26,449 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 495 transitions. Word has length 10 [2025-03-04 07:36:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:26,449 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 495 transitions. [2025-03-04 07:36:26,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 495 transitions. [2025-03-04 07:36:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:36:26,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:26,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:26,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:36:26,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:26,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -604304102, now seen corresponding path program 1 times [2025-03-04 07:36:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588300302] [2025-03-04 07:36:26,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:26,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:36:26,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:36:26,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:26,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:26,474 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:36:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:26,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588300302] [2025-03-04 07:36:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588300302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:26,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:26,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:36:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070610194] [2025-03-04 07:36:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:26,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:36:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:26,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:36:26,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:36:26,475 INFO L87 Difference]: Start difference. First operand 343 states and 495 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:26,573 INFO L93 Difference]: Finished difference Result 405 states and 554 transitions. [2025-03-04 07:36:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:36:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:36:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:26,575 INFO L225 Difference]: With dead ends: 405 [2025-03-04 07:36:26,575 INFO L226 Difference]: Without dead ends: 401 [2025-03-04 07:36:26,576 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:36:26,576 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 74 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:26,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 267 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-04 07:36:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 344. [2025-03-04 07:36:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 262 states have (on average 1.8129770992366412) internal successors, (475), 331 states have internal predecessors, (475), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:36:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 495 transitions. [2025-03-04 07:36:26,585 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 495 transitions. Word has length 10 [2025-03-04 07:36:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:26,585 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 495 transitions. [2025-03-04 07:36:26,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 495 transitions. [2025-03-04 07:36:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:36:26,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:26,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:26,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:36:26,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:26,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -603380229, now seen corresponding path program 1 times [2025-03-04 07:36:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:26,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834996718] [2025-03-04 07:36:26,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:26,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:26,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:36:26,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:36:26,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:26,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:26,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:26,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834996718] [2025-03-04 07:36:26,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834996718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:26,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:26,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:26,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45499228] [2025-03-04 07:36:26,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:26,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:26,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:26,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:26,680 INFO L87 Difference]: Start difference. First operand 344 states and 495 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:26,809 INFO L93 Difference]: Finished difference Result 435 states and 587 transitions. [2025-03-04 07:36:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:26,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:36:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:26,811 INFO L225 Difference]: With dead ends: 435 [2025-03-04 07:36:26,811 INFO L226 Difference]: Without dead ends: 430 [2025-03-04 07:36:26,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:26,812 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 117 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:26,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 725 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-04 07:36:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 339. [2025-03-04 07:36:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 257 states have (on average 1.8249027237354085) internal successors, (469), 326 states have internal predecessors, (469), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:36:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 489 transitions. [2025-03-04 07:36:26,821 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 489 transitions. Word has length 10 [2025-03-04 07:36:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:26,821 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 489 transitions. [2025-03-04 07:36:26,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 489 transitions. [2025-03-04 07:36:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:36:26,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:26,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:26,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:36:26,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:26,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash 654951981, now seen corresponding path program 1 times [2025-03-04 07:36:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136879881] [2025-03-04 07:36:26,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:26,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:36:26,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:36:26,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:26,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:26,868 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:36:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136879881] [2025-03-04 07:36:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136879881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181008203] [2025-03-04 07:36:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:26,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:26,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:26,870 INFO L87 Difference]: Start difference. First operand 339 states and 489 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:27,043 INFO L93 Difference]: Finished difference Result 446 states and 583 transitions. [2025-03-04 07:36:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 07:36:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:27,046 INFO L225 Difference]: With dead ends: 446 [2025-03-04 07:36:27,046 INFO L226 Difference]: Without dead ends: 446 [2025-03-04 07:36:27,046 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:36:27,047 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 168 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:27,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 337 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-04 07:36:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 345. [2025-03-04 07:36:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 263 states have (on average 1.806083650190114) internal successors, (475), 332 states have internal predecessors, (475), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:36:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 495 transitions. [2025-03-04 07:36:27,061 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 495 transitions. Word has length 15 [2025-03-04 07:36:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:27,062 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 495 transitions. [2025-03-04 07:36:27,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 495 transitions. [2025-03-04 07:36:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:36:27,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:27,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:27,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:36:27,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:27,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 654951982, now seen corresponding path program 1 times [2025-03-04 07:36:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:27,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908786684] [2025-03-04 07:36:27,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:27,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:36:27,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:36:27,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:27,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:27,145 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:36:27,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:27,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908786684] [2025-03-04 07:36:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908786684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:27,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352510949] [2025-03-04 07:36:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:27,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:27,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:27,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:27,146 INFO L87 Difference]: Start difference. First operand 345 states and 495 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:27,282 INFO L93 Difference]: Finished difference Result 392 states and 506 transitions. [2025-03-04 07:36:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 07:36:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:27,283 INFO L225 Difference]: With dead ends: 392 [2025-03-04 07:36:27,283 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 07:36:27,283 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:36:27,284 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 101 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:27,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 427 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 07:36:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 345. [2025-03-04 07:36:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 263 states have (on average 1.7718631178707225) internal successors, (466), 332 states have internal predecessors, (466), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:36:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 486 transitions. [2025-03-04 07:36:27,294 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 486 transitions. Word has length 15 [2025-03-04 07:36:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:27,294 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 486 transitions. [2025-03-04 07:36:27,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 486 transitions. [2025-03-04 07:36:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:36:27,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:27,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:27,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:36:27,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:27,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1029347733, now seen corresponding path program 1 times [2025-03-04 07:36:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784606385] [2025-03-04 07:36:27,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:27,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:36:27,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:36:27,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:27,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:27,421 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:36:27,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:27,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784606385] [2025-03-04 07:36:27,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784606385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:27,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:27,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:36:27,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518102276] [2025-03-04 07:36:27,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:27,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:36:27,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:27,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:36:27,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:36:27,423 INFO L87 Difference]: Start difference. First operand 345 states and 486 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:27,672 INFO L93 Difference]: Finished difference Result 462 states and 604 transitions. [2025-03-04 07:36:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 07:36:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:27,675 INFO L225 Difference]: With dead ends: 462 [2025-03-04 07:36:27,675 INFO L226 Difference]: Without dead ends: 462 [2025-03-04 07:36:27,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:27,676 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 337 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:27,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 321 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-04 07:36:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 342. [2025-03-04 07:36:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 264 states have (on average 1.7424242424242424) internal successors, (460), 329 states have internal predecessors, (460), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:36:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 480 transitions. [2025-03-04 07:36:27,687 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 480 transitions. Word has length 17 [2025-03-04 07:36:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:27,687 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 480 transitions. [2025-03-04 07:36:27,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 480 transitions. [2025-03-04 07:36:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:36:27,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:27,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:27,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:36:27,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:27,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1029347732, now seen corresponding path program 1 times [2025-03-04 07:36:27,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190463383] [2025-03-04 07:36:27,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:27,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:36:27,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:36:27,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:27,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:27,892 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:36:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190463383] [2025-03-04 07:36:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190463383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:27,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:36:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661480063] [2025-03-04 07:36:27,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:27,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:36:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:27,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:36:27,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:27,895 INFO L87 Difference]: Start difference. First operand 342 states and 480 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:28,291 INFO L93 Difference]: Finished difference Result 490 states and 631 transitions. [2025-03-04 07:36:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:36:28,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 07:36:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:28,293 INFO L225 Difference]: With dead ends: 490 [2025-03-04 07:36:28,293 INFO L226 Difference]: Without dead ends: 490 [2025-03-04 07:36:28,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:36:28,294 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 250 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:28,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 532 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:36:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-04 07:36:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 375. [2025-03-04 07:36:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 295 states have (on average 1.728813559322034) internal successors, (510), 361 states have internal predecessors, (510), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-04 07:36:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 534 transitions. [2025-03-04 07:36:28,303 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 534 transitions. Word has length 17 [2025-03-04 07:36:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:28,304 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 534 transitions. [2025-03-04 07:36:28,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 534 transitions. [2025-03-04 07:36:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:36:28,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:28,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:28,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:36:28,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:28,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:28,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1458165101, now seen corresponding path program 1 times [2025-03-04 07:36:28,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:28,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873872177] [2025-03-04 07:36:28,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:28,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:28,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:36:28,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:36:28,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:28,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:28,362 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:36:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873872177] [2025-03-04 07:36:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873872177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:28,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:28,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:36:28,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081064971] [2025-03-04 07:36:28,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:28,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:28,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:28,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:28,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:28,364 INFO L87 Difference]: Start difference. First operand 375 states and 534 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:28,394 INFO L93 Difference]: Finished difference Result 385 states and 546 transitions. [2025-03-04 07:36:28,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 07:36:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:28,397 INFO L225 Difference]: With dead ends: 385 [2025-03-04 07:36:28,397 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 07:36:28,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:28,398 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:28,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 896 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:36:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 07:36:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-04 07:36:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 302 states have (on average 1.7086092715231789) internal successors, (516), 370 states have internal predecessors, (516), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 07:36:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 546 transitions. [2025-03-04 07:36:28,413 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 546 transitions. Word has length 17 [2025-03-04 07:36:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:28,413 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 546 transitions. [2025-03-04 07:36:28,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 546 transitions. [2025-03-04 07:36:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:36:28,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:28,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:28,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:36:28,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:28,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2041460387, now seen corresponding path program 1 times [2025-03-04 07:36:28,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:28,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218956126] [2025-03-04 07:36:28,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:28,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:28,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:36:28,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:36:28,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:28,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:28,649 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:36:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218956126] [2025-03-04 07:36:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218956126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:28,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:28,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:36:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444269247] [2025-03-04 07:36:28,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:36:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:28,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:36:28,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:36:28,650 INFO L87 Difference]: Start difference. First operand 385 states and 546 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:29,116 INFO L93 Difference]: Finished difference Result 516 states and 672 transitions. [2025-03-04 07:36:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:36:29,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 07:36:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:29,119 INFO L225 Difference]: With dead ends: 516 [2025-03-04 07:36:29,119 INFO L226 Difference]: Without dead ends: 516 [2025-03-04 07:36:29,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:36:29,119 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 198 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:29,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 789 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:36:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-04 07:36:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 382. [2025-03-04 07:36:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 299 states have (on average 1.7090301003344481) internal successors, (511), 367 states have internal predecessors, (511), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 07:36:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2025-03-04 07:36:29,129 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 18 [2025-03-04 07:36:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:29,130 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2025-03-04 07:36:29,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2025-03-04 07:36:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:36:29,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:29,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:29,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:36:29,131 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:29,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:29,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1951958138, now seen corresponding path program 1 times [2025-03-04 07:36:29,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:29,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723854864] [2025-03-04 07:36:29,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:29,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:29,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:36:29,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:36:29,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:29,262 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:36:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723854864] [2025-03-04 07:36:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723854864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:29,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:29,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:36:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346296158] [2025-03-04 07:36:29,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:29,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:36:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:29,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:36:29,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:29,263 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:29,456 INFO L93 Difference]: Finished difference Result 516 states and 696 transitions. [2025-03-04 07:36:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:36:29,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 07:36:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:29,458 INFO L225 Difference]: With dead ends: 516 [2025-03-04 07:36:29,458 INFO L226 Difference]: Without dead ends: 516 [2025-03-04 07:36:29,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:36:29,458 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 146 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:29,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1079 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-04 07:36:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 400. [2025-03-04 07:36:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 317 states have (on average 1.6876971608832807) internal successors, (535), 383 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 07:36:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 565 transitions. [2025-03-04 07:36:29,465 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 565 transitions. Word has length 21 [2025-03-04 07:36:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:29,465 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 565 transitions. [2025-03-04 07:36:29,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 565 transitions. [2025-03-04 07:36:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:36:29,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:29,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:29,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:36:29,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:29,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash -943929306, now seen corresponding path program 1 times [2025-03-04 07:36:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648964476] [2025-03-04 07:36:29,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:29,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:29,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:36:29,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:36:29,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:29,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:29,647 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:36:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648964476] [2025-03-04 07:36:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648964476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:29,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:29,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:36:29,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059711061] [2025-03-04 07:36:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:29,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:36:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:29,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:36:29,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:29,648 INFO L87 Difference]: Start difference. First operand 400 states and 565 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:29,904 INFO L93 Difference]: Finished difference Result 486 states and 655 transitions. [2025-03-04 07:36:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:36:29,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 07:36:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:29,906 INFO L225 Difference]: With dead ends: 486 [2025-03-04 07:36:29,906 INFO L226 Difference]: Without dead ends: 486 [2025-03-04 07:36:29,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:36:29,907 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 108 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:29,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1037 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-04 07:36:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 394. [2025-03-04 07:36:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 311 states have (on average 1.684887459807074) internal successors, (524), 377 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 07:36:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 554 transitions. [2025-03-04 07:36:29,913 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 554 transitions. Word has length 21 [2025-03-04 07:36:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:29,914 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 554 transitions. [2025-03-04 07:36:29,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 554 transitions. [2025-03-04 07:36:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:36:29,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:29,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:29,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:36:29,914 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:29,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 194444791, now seen corresponding path program 1 times [2025-03-04 07:36:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:29,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934289316] [2025-03-04 07:36:29,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:29,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:36:29,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:36:29,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:29,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:30,031 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:36:30,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934289316] [2025-03-04 07:36:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934289316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:30,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:30,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:36:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277192032] [2025-03-04 07:36:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:30,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:36:30,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:30,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:36:30,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:30,032 INFO L87 Difference]: Start difference. First operand 394 states and 554 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:30,232 INFO L93 Difference]: Finished difference Result 507 states and 683 transitions. [2025-03-04 07:36:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:36:30,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 07:36:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:30,234 INFO L225 Difference]: With dead ends: 507 [2025-03-04 07:36:30,234 INFO L226 Difference]: Without dead ends: 507 [2025-03-04 07:36:30,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:36:30,235 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 116 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:30,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1100 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-04 07:36:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 402. [2025-03-04 07:36:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 319 states have (on average 1.6677115987460815) internal successors, (532), 383 states have internal predecessors, (532), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 07:36:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 562 transitions. [2025-03-04 07:36:30,243 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 562 transitions. Word has length 22 [2025-03-04 07:36:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:30,243 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 562 transitions. [2025-03-04 07:36:30,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 562 transitions. [2025-03-04 07:36:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:36:30,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:30,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:36:30,245 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:30,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash -877192382, now seen corresponding path program 1 times [2025-03-04 07:36:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974165450] [2025-03-04 07:36:30,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:30,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:36:30,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:36:30,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:30,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:30,287 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:36:30,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:30,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974165450] [2025-03-04 07:36:30,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974165450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:30,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:30,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:30,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236792376] [2025-03-04 07:36:30,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:30,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:30,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:30,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:30,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:30,289 INFO L87 Difference]: Start difference. First operand 402 states and 562 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:30,446 INFO L93 Difference]: Finished difference Result 494 states and 640 transitions. [2025-03-04 07:36:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 07:36:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:30,448 INFO L225 Difference]: With dead ends: 494 [2025-03-04 07:36:30,448 INFO L226 Difference]: Without dead ends: 494 [2025-03-04 07:36:30,449 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:36:30,449 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 176 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:30,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 345 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-04 07:36:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 422. [2025-03-04 07:36:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 339 states have (on average 1.6873156342182891) internal successors, (572), 403 states have internal predecessors, (572), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 07:36:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 602 transitions. [2025-03-04 07:36:30,459 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 602 transitions. Word has length 23 [2025-03-04 07:36:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:30,459 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 602 transitions. [2025-03-04 07:36:30,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 602 transitions. [2025-03-04 07:36:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:36:30,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:30,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:36:30,459 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:30,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash -877192381, now seen corresponding path program 1 times [2025-03-04 07:36:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:30,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294674899] [2025-03-04 07:36:30,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:30,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:36:30,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:36:30,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:30,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:30,565 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:36:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294674899] [2025-03-04 07:36:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294674899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:36:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468324951] [2025-03-04 07:36:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:30,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:36:30,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:30,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:36:30,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:30,567 INFO L87 Difference]: Start difference. First operand 422 states and 602 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:30,716 INFO L93 Difference]: Finished difference Result 339 states and 449 transitions. [2025-03-04 07:36:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:36:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 07:36:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:30,718 INFO L225 Difference]: With dead ends: 339 [2025-03-04 07:36:30,718 INFO L226 Difference]: Without dead ends: 339 [2025-03-04 07:36:30,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:36:30,719 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 58 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:30,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1097 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-04 07:36:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 309. [2025-03-04 07:36:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 234 states have (on average 1.6837606837606838) internal successors, (394), 296 states have internal predecessors, (394), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 412 transitions. [2025-03-04 07:36:30,724 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 412 transitions. Word has length 23 [2025-03-04 07:36:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:30,724 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 412 transitions. [2025-03-04 07:36:30,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 412 transitions. [2025-03-04 07:36:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:36:30,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:30,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:30,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:36:30,725 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1496487480, now seen corresponding path program 1 times [2025-03-04 07:36:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626635950] [2025-03-04 07:36:30,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:36:30,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:36:30,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:30,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:30,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626635950] [2025-03-04 07:36:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626635950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:30,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:30,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:36:30,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283298847] [2025-03-04 07:36:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:30,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:30,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:30,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:30,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:30,751 INFO L87 Difference]: Start difference. First operand 309 states and 412 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:30,764 INFO L93 Difference]: Finished difference Result 318 states and 421 transitions. [2025-03-04 07:36:30,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:30,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:36:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:30,766 INFO L225 Difference]: With dead ends: 318 [2025-03-04 07:36:30,766 INFO L226 Difference]: Without dead ends: 318 [2025-03-04 07:36:30,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:30,766 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 1 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:30,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:36:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-04 07:36:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-03-04 07:36:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 243 states have (on average 1.6584362139917694) internal successors, (403), 305 states have internal predecessors, (403), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 421 transitions. [2025-03-04 07:36:30,771 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 421 transitions. Word has length 25 [2025-03-04 07:36:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:30,772 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 421 transitions. [2025-03-04 07:36:30,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 421 transitions. [2025-03-04 07:36:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:36:30,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:30,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:36:30,773 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1497436798, now seen corresponding path program 1 times [2025-03-04 07:36:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117026447] [2025-03-04 07:36:30,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:30,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:36:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:36:30,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:30,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:30,817 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:36:30,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:30,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117026447] [2025-03-04 07:36:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117026447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:30,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:36:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114642267] [2025-03-04 07:36:30,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:30,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:36:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:30,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:36:30,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:36:30,819 INFO L87 Difference]: Start difference. First operand 318 states and 421 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:30,877 INFO L93 Difference]: Finished difference Result 315 states and 412 transitions. [2025-03-04 07:36:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:36:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:36:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:30,878 INFO L225 Difference]: With dead ends: 315 [2025-03-04 07:36:30,879 INFO L226 Difference]: Without dead ends: 315 [2025-03-04 07:36:30,879 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:36:30,879 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:30,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 242 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-04 07:36:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-03-04 07:36:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 243 states have (on average 1.6213991769547325) internal successors, (394), 302 states have internal predecessors, (394), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 412 transitions. [2025-03-04 07:36:30,884 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 412 transitions. Word has length 25 [2025-03-04 07:36:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:30,884 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 412 transitions. [2025-03-04 07:36:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 412 transitions. [2025-03-04 07:36:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:36:30,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:30,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:36:30,885 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:30,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1497436799, now seen corresponding path program 1 times [2025-03-04 07:36:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052089506] [2025-03-04 07:36:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:30,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:36:30,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:36:30,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:30,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:30,932 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:36:30,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:30,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052089506] [2025-03-04 07:36:30,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052089506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:30,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:30,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:30,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924506555] [2025-03-04 07:36:30,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:30,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:30,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:30,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:30,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:30,933 INFO L87 Difference]: Start difference. First operand 315 states and 412 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,010 INFO L93 Difference]: Finished difference Result 376 states and 490 transitions. [2025-03-04 07:36:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:36:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,012 INFO L225 Difference]: With dead ends: 376 [2025-03-04 07:36:31,012 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 07:36:31,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:31,013 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 67 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 268 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 07:36:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 370. [2025-03-04 07:36:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 299 states have (on average 1.5785953177257526) internal successors, (472), 357 states have internal predecessors, (472), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 490 transitions. [2025-03-04 07:36:31,022 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 490 transitions. Word has length 25 [2025-03-04 07:36:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,022 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 490 transitions. [2025-03-04 07:36:31,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 490 transitions. [2025-03-04 07:36:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:36:31,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:36:31,023 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1287253423, now seen corresponding path program 1 times [2025-03-04 07:36:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527652825] [2025-03-04 07:36:31,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:36:31,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:36:31,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,068 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:36:31,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527652825] [2025-03-04 07:36:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527652825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:36:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202663520] [2025-03-04 07:36:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:31,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:31,070 INFO L87 Difference]: Start difference. First operand 370 states and 490 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,094 INFO L93 Difference]: Finished difference Result 417 states and 544 transitions. [2025-03-04 07:36:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 07:36:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,096 INFO L225 Difference]: With dead ends: 417 [2025-03-04 07:36:31,096 INFO L226 Difference]: Without dead ends: 417 [2025-03-04 07:36:31,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:31,097 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 46 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 850 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:36:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-04 07:36:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 370. [2025-03-04 07:36:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 299 states have (on average 1.568561872909699) internal successors, (469), 357 states have internal predecessors, (469), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 487 transitions. [2025-03-04 07:36:31,105 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 487 transitions. Word has length 26 [2025-03-04 07:36:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,105 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 487 transitions. [2025-03-04 07:36:31,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 487 transitions. [2025-03-04 07:36:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:36:31,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:36:31,106 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:31,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2010641520, now seen corresponding path program 1 times [2025-03-04 07:36:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614578193] [2025-03-04 07:36:31,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:36:31,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:36:31,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614578193] [2025-03-04 07:36:31,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614578193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162991572] [2025-03-04 07:36:31,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:31,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:31,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:31,167 INFO L87 Difference]: Start difference. First operand 370 states and 487 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,261 INFO L93 Difference]: Finished difference Result 432 states and 568 transitions. [2025-03-04 07:36:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:31,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 07:36:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,262 INFO L225 Difference]: With dead ends: 432 [2025-03-04 07:36:31,262 INFO L226 Difference]: Without dead ends: 432 [2025-03-04 07:36:31,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:31,263 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 50 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 375 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-04 07:36:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 370. [2025-03-04 07:36:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 299 states have (on average 1.568561872909699) internal successors, (469), 357 states have internal predecessors, (469), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 487 transitions. [2025-03-04 07:36:31,269 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 487 transitions. Word has length 26 [2025-03-04 07:36:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,269 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 487 transitions. [2025-03-04 07:36:31,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 487 transitions. [2025-03-04 07:36:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:36:31,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:36:31,271 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:31,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash 213690161, now seen corresponding path program 1 times [2025-03-04 07:36:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970086100] [2025-03-04 07:36:31,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:36:31,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:36:31,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,315 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:36:31,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970086100] [2025-03-04 07:36:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970086100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:36:31,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712341653] [2025-03-04 07:36:31,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:31,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:31,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:31,316 INFO L87 Difference]: Start difference. First operand 370 states and 487 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,332 INFO L93 Difference]: Finished difference Result 313 states and 400 transitions. [2025-03-04 07:36:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 07:36:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,333 INFO L225 Difference]: With dead ends: 313 [2025-03-04 07:36:31,333 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 07:36:31,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:31,333 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 860 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:36:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 07:36:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-03-04 07:36:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 243 states have (on average 1.5720164609053497) internal successors, (382), 300 states have internal predecessors, (382), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 400 transitions. [2025-03-04 07:36:31,338 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 400 transitions. Word has length 26 [2025-03-04 07:36:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,338 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 400 transitions. [2025-03-04 07:36:31,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 400 transitions. [2025-03-04 07:36:31,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:36:31,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:36:31,339 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:31,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 222722296, now seen corresponding path program 1 times [2025-03-04 07:36:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252930005] [2025-03-04 07:36:31,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:36:31,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:36:31,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,410 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:36:31,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252930005] [2025-03-04 07:36:31,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252930005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:36:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785437354] [2025-03-04 07:36:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:36:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:36:31,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:36:31,411 INFO L87 Difference]: Start difference. First operand 313 states and 400 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,448 INFO L93 Difference]: Finished difference Result 397 states and 511 transitions. [2025-03-04 07:36:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:36:31,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 07:36:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,450 INFO L225 Difference]: With dead ends: 397 [2025-03-04 07:36:31,450 INFO L226 Difference]: Without dead ends: 397 [2025-03-04 07:36:31,450 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:36:31,450 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 80 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 338 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:36:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-04 07:36:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 381. [2025-03-04 07:36:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 311 states have (on average 1.5562700964630225) internal successors, (484), 368 states have internal predecessors, (484), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 502 transitions. [2025-03-04 07:36:31,457 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 502 transitions. Word has length 27 [2025-03-04 07:36:31,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,458 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 502 transitions. [2025-03-04 07:36:31,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 502 transitions. [2025-03-04 07:36:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:36:31,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 07:36:31,458 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:31,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,459 INFO L85 PathProgramCache]: Analyzing trace with hash 222722330, now seen corresponding path program 1 times [2025-03-04 07:36:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974204595] [2025-03-04 07:36:31,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:36:31,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:36:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,530 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:36:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974204595] [2025-03-04 07:36:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974204595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:36:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354440934] [2025-03-04 07:36:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:36:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:36:31,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:31,533 INFO L87 Difference]: Start difference. First operand 381 states and 502 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,631 INFO L93 Difference]: Finished difference Result 437 states and 566 transitions. [2025-03-04 07:36:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:36:31,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 07:36:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,633 INFO L225 Difference]: With dead ends: 437 [2025-03-04 07:36:31,633 INFO L226 Difference]: Without dead ends: 437 [2025-03-04 07:36:31,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:36:31,633 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 16 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 734 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-04 07:36:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 429. [2025-03-04 07:36:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 359 states have (on average 1.501392757660167) internal successors, (539), 416 states have internal predecessors, (539), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 557 transitions. [2025-03-04 07:36:31,639 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 557 transitions. Word has length 27 [2025-03-04 07:36:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,639 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 557 transitions. [2025-03-04 07:36:31,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 557 transitions. [2025-03-04 07:36:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:36:31,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 07:36:31,640 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:31,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -508779863, now seen corresponding path program 1 times [2025-03-04 07:36:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415107009] [2025-03-04 07:36:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:36:31,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:36:31,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,695 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:36:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415107009] [2025-03-04 07:36:31,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415107009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:31,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394232865] [2025-03-04 07:36:31,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:31,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:31,698 INFO L87 Difference]: Start difference. First operand 429 states and 557 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,784 INFO L93 Difference]: Finished difference Result 454 states and 569 transitions. [2025-03-04 07:36:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 07:36:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,786 INFO L225 Difference]: With dead ends: 454 [2025-03-04 07:36:31,786 INFO L226 Difference]: Without dead ends: 454 [2025-03-04 07:36:31,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:31,786 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 57 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 380 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-04 07:36:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 342. [2025-03-04 07:36:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 273 states have (on average 1.5054945054945055) internal successors, (411), 329 states have internal predecessors, (411), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 429 transitions. [2025-03-04 07:36:31,794 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 429 transitions. Word has length 28 [2025-03-04 07:36:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,794 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 429 transitions. [2025-03-04 07:36:31,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2025-03-04 07:36:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:36:31,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 07:36:31,796 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:31,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1273500943, now seen corresponding path program 1 times [2025-03-04 07:36:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861319640] [2025-03-04 07:36:31,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:36:31,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:36:31,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,861 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:36:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861319640] [2025-03-04 07:36:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861319640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:31,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569107221] [2025-03-04 07:36:31,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:31,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:31,862 INFO L87 Difference]: Start difference. First operand 342 states and 429 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,980 INFO L93 Difference]: Finished difference Result 343 states and 429 transitions. [2025-03-04 07:36:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-03-04 07:36:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,981 INFO L225 Difference]: With dead ends: 343 [2025-03-04 07:36:31,982 INFO L226 Difference]: Without dead ends: 343 [2025-03-04 07:36:31,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:31,982 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 52 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 534 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-04 07:36:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-03-04 07:36:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 273 states have (on average 1.4981684981684982) internal successors, (409), 328 states have internal predecessors, (409), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 427 transitions. [2025-03-04 07:36:31,987 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 427 transitions. Word has length 35 [2025-03-04 07:36:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,987 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 427 transitions. [2025-03-04 07:36:31,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 427 transitions. [2025-03-04 07:36:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:36:31,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 07:36:31,988 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:31,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1273500944, now seen corresponding path program 1 times [2025-03-04 07:36:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180095716] [2025-03-04 07:36:31,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:36:32,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:36:32,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:32,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:32,099 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:36:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180095716] [2025-03-04 07:36:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180095716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125819806] [2025-03-04 07:36:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:32,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:32,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:32,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:32,100 INFO L87 Difference]: Start difference. First operand 341 states and 427 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:32,214 INFO L93 Difference]: Finished difference Result 342 states and 427 transitions. [2025-03-04 07:36:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:32,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-03-04 07:36:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:32,217 INFO L225 Difference]: With dead ends: 342 [2025-03-04 07:36:32,217 INFO L226 Difference]: Without dead ends: 342 [2025-03-04 07:36:32,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:32,217 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 40 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:32,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 562 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-04 07:36:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2025-03-04 07:36:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 273 states have (on average 1.4908424908424909) internal successors, (407), 327 states have internal predecessors, (407), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 425 transitions. [2025-03-04 07:36:32,223 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 425 transitions. Word has length 35 [2025-03-04 07:36:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:32,223 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 425 transitions. [2025-03-04 07:36:32,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 425 transitions. [2025-03-04 07:36:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:36:32,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:32,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:32,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 07:36:32,223 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:32,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash -231270452, now seen corresponding path program 1 times [2025-03-04 07:36:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:32,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380711581] [2025-03-04 07:36:32,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:32,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:36:32,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:36:32,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:32,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:32,285 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:36:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:32,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380711581] [2025-03-04 07:36:32,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380711581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:32,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:32,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:36:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381766932] [2025-03-04 07:36:32,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:32,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:36:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:32,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:36:32,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:36:32,287 INFO L87 Difference]: Start difference. First operand 340 states and 425 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:32,394 INFO L93 Difference]: Finished difference Result 383 states and 475 transitions. [2025-03-04 07:36:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:36:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-04 07:36:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:32,395 INFO L225 Difference]: With dead ends: 383 [2025-03-04 07:36:32,395 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 07:36:32,396 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:36:32,396 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 66 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:32,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 450 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 07:36:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 337. [2025-03-04 07:36:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 273 states have (on average 1.468864468864469) internal successors, (401), 324 states have internal predecessors, (401), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 419 transitions. [2025-03-04 07:36:32,402 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 419 transitions. Word has length 37 [2025-03-04 07:36:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:32,403 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 419 transitions. [2025-03-04 07:36:32,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 419 transitions. [2025-03-04 07:36:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:36:32,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:32,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:32,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 07:36:32,403 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:32,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:32,404 INFO L85 PathProgramCache]: Analyzing trace with hash -231270451, now seen corresponding path program 1 times [2025-03-04 07:36:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:32,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496199512] [2025-03-04 07:36:32,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:32,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:36:32,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:36:32,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:32,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:32,507 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:36:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496199512] [2025-03-04 07:36:32,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496199512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:32,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:32,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:32,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138249513] [2025-03-04 07:36:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:32,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:32,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:32,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:32,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:32,508 INFO L87 Difference]: Start difference. First operand 337 states and 419 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:32,628 INFO L93 Difference]: Finished difference Result 382 states and 473 transitions. [2025-03-04 07:36:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-04 07:36:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:32,629 INFO L225 Difference]: With dead ends: 382 [2025-03-04 07:36:32,629 INFO L226 Difference]: Without dead ends: 382 [2025-03-04 07:36:32,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:36:32,630 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 311 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:32,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 351 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-04 07:36:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 336. [2025-03-04 07:36:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 273 states have (on average 1.4615384615384615) internal successors, (399), 323 states have internal predecessors, (399), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 417 transitions. [2025-03-04 07:36:32,638 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 417 transitions. Word has length 37 [2025-03-04 07:36:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:32,638 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 417 transitions. [2025-03-04 07:36:32,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 417 transitions. [2025-03-04 07:36:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:36:32,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:32,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:32,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 07:36:32,639 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:32,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:32,639 INFO L85 PathProgramCache]: Analyzing trace with hash -231270423, now seen corresponding path program 1 times [2025-03-04 07:36:32,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:32,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739659291] [2025-03-04 07:36:32,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:32,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:36:32,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:36:32,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:32,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:32,805 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:36:32,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:32,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739659291] [2025-03-04 07:36:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739659291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:32,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:32,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:36:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786447410] [2025-03-04 07:36:32,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:36:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:36:32,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:36:32,806 INFO L87 Difference]: Start difference. First operand 336 states and 417 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:33,005 INFO L93 Difference]: Finished difference Result 389 states and 442 transitions. [2025-03-04 07:36:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:36:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-04 07:36:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:33,006 INFO L225 Difference]: With dead ends: 389 [2025-03-04 07:36:33,006 INFO L226 Difference]: Without dead ends: 389 [2025-03-04 07:36:33,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:33,007 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 169 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:33,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 378 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-04 07:36:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 336. [2025-03-04 07:36:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 273 states have (on average 1.4542124542124542) internal successors, (397), 323 states have internal predecessors, (397), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 415 transitions. [2025-03-04 07:36:33,013 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 415 transitions. Word has length 37 [2025-03-04 07:36:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:33,014 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 415 transitions. [2025-03-04 07:36:33,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 415 transitions. [2025-03-04 07:36:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:36:33,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:33,015 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, 1, 1, 1, 1] [2025-03-04 07:36:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 07:36:33,015 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:33,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash -413670119, now seen corresponding path program 1 times [2025-03-04 07:36:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804280701] [2025-03-04 07:36:33,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:33,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:36:33,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:36:33,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:33,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:33,126 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:36:33,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:33,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804280701] [2025-03-04 07:36:33,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804280701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:33,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:33,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:33,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502376630] [2025-03-04 07:36:33,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:33,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:33,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:33,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:33,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:33,127 INFO L87 Difference]: Start difference. First operand 336 states and 415 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:33,231 INFO L93 Difference]: Finished difference Result 340 states and 419 transitions. [2025-03-04 07:36:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:36:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 07:36:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:33,232 INFO L225 Difference]: With dead ends: 340 [2025-03-04 07:36:33,232 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 07:36:33,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:33,233 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 255 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:33,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 325 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 07:36:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2025-03-04 07:36:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 275 states have (on average 1.450909090909091) internal successors, (399), 324 states have internal predecessors, (399), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 417 transitions. [2025-03-04 07:36:33,238 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 417 transitions. Word has length 48 [2025-03-04 07:36:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:33,238 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 417 transitions. [2025-03-04 07:36:33,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 417 transitions. [2025-03-04 07:36:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:36:33,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:33,239 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, 1, 1, 1, 1] [2025-03-04 07:36:33,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 07:36:33,239 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:33,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:33,239 INFO L85 PathProgramCache]: Analyzing trace with hash -413670088, now seen corresponding path program 1 times [2025-03-04 07:36:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:33,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469498748] [2025-03-04 07:36:33,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:33,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:36:33,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:36:33,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:33,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:33,344 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:36:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469498748] [2025-03-04 07:36:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469498748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684039154] [2025-03-04 07:36:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:33,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:33,346 INFO L87 Difference]: Start difference. First operand 337 states and 417 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:33,450 INFO L93 Difference]: Finished difference Result 339 states and 417 transitions. [2025-03-04 07:36:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:36:33,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 07:36:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:33,451 INFO L225 Difference]: With dead ends: 339 [2025-03-04 07:36:33,451 INFO L226 Difference]: Without dead ends: 339 [2025-03-04 07:36:33,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:33,452 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 160 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:33,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 325 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:33,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-04 07:36:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 334. [2025-03-04 07:36:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 273 states have (on average 1.4432234432234432) internal successors, (394), 321 states have internal predecessors, (394), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 412 transitions. [2025-03-04 07:36:33,457 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 412 transitions. Word has length 48 [2025-03-04 07:36:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:33,457 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 412 transitions. [2025-03-04 07:36:33,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 412 transitions. [2025-03-04 07:36:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 07:36:33,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:33,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:33,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 07:36:33,457 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:33,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash -901995318, now seen corresponding path program 1 times [2025-03-04 07:36:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309232336] [2025-03-04 07:36:33,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:33,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 07:36:33,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 07:36:33,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:33,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:36:33,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:33,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309232336] [2025-03-04 07:36:33,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309232336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:33,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:33,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:33,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927927850] [2025-03-04 07:36:33,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:33,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:33,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:33,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:33,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:33,613 INFO L87 Difference]: Start difference. First operand 334 states and 412 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:36:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:33,735 INFO L93 Difference]: Finished difference Result 336 states and 412 transitions. [2025-03-04 07:36:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:36:33,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-03-04 07:36:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:33,737 INFO L225 Difference]: With dead ends: 336 [2025-03-04 07:36:33,737 INFO L226 Difference]: Without dead ends: 336 [2025-03-04 07:36:33,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:33,737 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 140 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:33,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 328 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-04 07:36:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2025-03-04 07:36:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 273 states have (on average 1.4285714285714286) internal successors, (390), 319 states have internal predecessors, (390), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 408 transitions. [2025-03-04 07:36:33,744 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 408 transitions. Word has length 50 [2025-03-04 07:36:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:33,745 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 408 transitions. [2025-03-04 07:36:33,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:36:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 408 transitions. [2025-03-04 07:36:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:36:33,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:33,745 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:33,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 07:36:33,745 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:33,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:33,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1385383654, now seen corresponding path program 1 times [2025-03-04 07:36:33,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:33,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129552475] [2025-03-04 07:36:33,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:33,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:36:33,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:36:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:34,410 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:36:34,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:34,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129552475] [2025-03-04 07:36:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129552475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:34,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:34,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:36:34,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302078800] [2025-03-04 07:36:34,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:34,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:36:34,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:34,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:36:34,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:36:34,411 INFO L87 Difference]: Start difference. First operand 332 states and 408 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:34,857 INFO L93 Difference]: Finished difference Result 363 states and 440 transitions. [2025-03-04 07:36:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:36:34,857 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-04 07:36:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:34,858 INFO L225 Difference]: With dead ends: 363 [2025-03-04 07:36:34,858 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 07:36:34,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:36:34,859 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 77 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:34,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1196 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:36:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 07:36:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2025-03-04 07:36:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 297 states have (on average 1.3973063973063973) internal successors, (415), 343 states have internal predecessors, (415), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:36:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 433 transitions. [2025-03-04 07:36:34,864 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 433 transitions. Word has length 51 [2025-03-04 07:36:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:34,864 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 433 transitions. [2025-03-04 07:36:34,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 433 transitions. [2025-03-04 07:36:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:36:34,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:34,866 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:34,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 07:36:34,866 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:34,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:34,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1741100826, now seen corresponding path program 1 times [2025-03-04 07:36:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:34,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104433878] [2025-03-04 07:36:34,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:34,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:34,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:36:34,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:36:34,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:34,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:35,397 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:36:35,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:35,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104433878] [2025-03-04 07:36:35,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104433878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:35,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:35,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:36:35,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499911375] [2025-03-04 07:36:35,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:35,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:36:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:35,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:36:35,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:36:35,398 INFO L87 Difference]: Start difference. First operand 356 states and 433 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:35,866 INFO L93 Difference]: Finished difference Result 712 states and 882 transitions. [2025-03-04 07:36:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:36:35,866 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-04 07:36:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:35,868 INFO L225 Difference]: With dead ends: 712 [2025-03-04 07:36:35,868 INFO L226 Difference]: Without dead ends: 712 [2025-03-04 07:36:35,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:36:35,868 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 439 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:35,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1022 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:36:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-04 07:36:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 502. [2025-03-04 07:36:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 436 states have (on average 1.3876146788990826) internal successors, (605), 485 states have internal predecessors, (605), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 07:36:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 635 transitions. [2025-03-04 07:36:35,878 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 635 transitions. Word has length 52 [2025-03-04 07:36:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:35,878 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 635 transitions. [2025-03-04 07:36:35,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 635 transitions. [2025-03-04 07:36:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:36:35,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:35,879 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:35,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 07:36:35,880 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:35,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1741100827, now seen corresponding path program 1 times [2025-03-04 07:36:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:35,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743284362] [2025-03-04 07:36:35,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:35,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:35,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:36:35,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:36:35,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:35,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:36,495 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:36:36,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:36,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743284362] [2025-03-04 07:36:36,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743284362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:36,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 07:36:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716806537] [2025-03-04 07:36:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:36,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:36:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:36,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:36:36,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:36:36,497 INFO L87 Difference]: Start difference. First operand 502 states and 635 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:37,105 INFO L93 Difference]: Finished difference Result 750 states and 934 transitions. [2025-03-04 07:36:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:36:37,106 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-04 07:36:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:37,107 INFO L225 Difference]: With dead ends: 750 [2025-03-04 07:36:37,107 INFO L226 Difference]: Without dead ends: 750 [2025-03-04 07:36:37,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:36:37,108 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 439 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:37,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1592 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:36:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-04 07:36:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 555. [2025-03-04 07:36:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 485 states have (on average 1.4164948453608248) internal successors, (687), 536 states have internal predecessors, (687), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 07:36:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 723 transitions. [2025-03-04 07:36:37,117 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 723 transitions. Word has length 52 [2025-03-04 07:36:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:37,118 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 723 transitions. [2025-03-04 07:36:37,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 723 transitions. [2025-03-04 07:36:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:36:37,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:37,119 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:37,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 07:36:37,120 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:37,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1741100474, now seen corresponding path program 1 times [2025-03-04 07:36:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:37,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410584235] [2025-03-04 07:36:37,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:37,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:37,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:36:37,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:36:37,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:37,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:37,684 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:36:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410584235] [2025-03-04 07:36:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410584235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:37,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:37,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 07:36:37,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977264858] [2025-03-04 07:36:37,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:37,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:36:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:37,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:36:37,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:36:37,686 INFO L87 Difference]: Start difference. First operand 555 states and 723 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:38,129 INFO L93 Difference]: Finished difference Result 623 states and 764 transitions. [2025-03-04 07:36:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:36:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-04 07:36:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:38,131 INFO L225 Difference]: With dead ends: 623 [2025-03-04 07:36:38,131 INFO L226 Difference]: Without dead ends: 623 [2025-03-04 07:36:38,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:36:38,132 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 253 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:38,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1042 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:36:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-04 07:36:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 558. [2025-03-04 07:36:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 488 states have (on average 1.4118852459016393) internal successors, (689), 539 states have internal predecessors, (689), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 07:36:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 725 transitions. [2025-03-04 07:36:38,141 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 725 transitions. Word has length 52 [2025-03-04 07:36:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:38,141 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 725 transitions. [2025-03-04 07:36:38,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 725 transitions. [2025-03-04 07:36:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:36:38,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:38,142 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:38,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 07:36:38,142 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:36:38,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1368203211, now seen corresponding path program 1 times [2025-03-04 07:36:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563070508] [2025-03-04 07:36:38,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:38,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:36:38,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:36:38,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:38,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:38,792 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:36:38,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563070508] [2025-03-04 07:36:38,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563070508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:36:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383122450] [2025-03-04 07:36:38,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:38,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:38,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:38,795 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:36:38,797 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:36:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:36:38,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:36:38,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:38,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:38,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-04 07:36:38,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:36:39,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:36:39,111 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:36:39,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:36:39,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:36:39,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:36:39,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:36:39,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:36:39,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:36:39,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:36:39,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 07:36:39,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:36:39,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:36:39,941 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:36:39,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:36:42,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383122450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:36:42,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:36:42,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2025-03-04 07:36:42,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606521929] [2025-03-04 07:36:42,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:36:42,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:36:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:42,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:36:42,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=734, Unknown=9, NotChecked=0, Total=870 [2025-03-04 07:36:42,841 INFO L87 Difference]: Start difference. First operand 558 states and 725 transitions. Second operand has 24 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 23 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:36:47,421 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:36:51,476 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:36:55,483 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:36:59,715 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:37:03,877 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:37:07,961 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:37:11,980 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:37:16,058 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:37:20,070 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:37:24,419 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:37:28,436 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:37:32,443 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:37:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:32,525 INFO L93 Difference]: Finished difference Result 1209 states and 1476 transitions. [2025-03-04 07:37:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 07:37:32,525 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 23 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-03-04 07:37:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:32,528 INFO L225 Difference]: With dead ends: 1209 [2025-03-04 07:37:32,528 INFO L226 Difference]: Without dead ends: 1209 [2025-03-04 07:37:32,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=439, Invalid=2858, Unknown=9, NotChecked=0, Total=3306 [2025-03-04 07:37:32,530 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 808 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 70 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:32,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2349 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1337 Invalid, 12 Unknown, 0 Unchecked, 48.9s Time] [2025-03-04 07:37:32,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-03-04 07:37:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 683. [2025-03-04 07:37:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 605 states have (on average 1.4148760330578511) internal successors, (856), 659 states have internal predecessors, (856), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 15 states have call predecessors, (32), 16 states have call successors, (32) [2025-03-04 07:37:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 904 transitions. [2025-03-04 07:37:32,546 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 904 transitions. Word has length 52 [2025-03-04 07:37:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:32,547 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 904 transitions. [2025-03-04 07:37:32,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 23 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:37:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 904 transitions. [2025-03-04 07:37:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:37:32,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:32,547 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:32,555 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:37:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 07:37:32,748 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1368202859, now seen corresponding path program 1 times [2025-03-04 07:37:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646169065] [2025-03-04 07:37:32,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:32,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:37:32,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:37:32,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:32,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:33,370 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:37:33,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646169065] [2025-03-04 07:37:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646169065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 07:37:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648346006] [2025-03-04 07:37:33,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:33,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:37:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:33,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:37:33,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:37:33,372 INFO L87 Difference]: Start difference. First operand 683 states and 904 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:34,082 INFO L93 Difference]: Finished difference Result 643 states and 786 transitions. [2025-03-04 07:37:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:37:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-04 07:37:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:34,084 INFO L225 Difference]: With dead ends: 643 [2025-03-04 07:37:34,084 INFO L226 Difference]: Without dead ends: 643 [2025-03-04 07:37:34,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:37:34,085 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 207 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:34,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1776 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:37:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-03-04 07:37:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 546. [2025-03-04 07:37:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 476 states have (on average 1.4222689075630253) internal successors, (677), 527 states have internal predecessors, (677), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 07:37:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 713 transitions. [2025-03-04 07:37:34,091 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 713 transitions. Word has length 52 [2025-03-04 07:37:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:34,092 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 713 transitions. [2025-03-04 07:37:34,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 713 transitions. [2025-03-04 07:37:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:34,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:34,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:34,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 07:37:34,093 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:34,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1354077632, now seen corresponding path program 1 times [2025-03-04 07:37:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:34,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574270496] [2025-03-04 07:37:34,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:34,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:34,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:34,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:34,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:34,531 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:37:34,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:34,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574270496] [2025-03-04 07:37:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574270496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:37:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640806665] [2025-03-04 07:37:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:34,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:37:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:34,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:37:34,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:37:34,532 INFO L87 Difference]: Start difference. First operand 546 states and 713 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:35,092 INFO L93 Difference]: Finished difference Result 852 states and 1095 transitions. [2025-03-04 07:37:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:37:35,093 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:35,095 INFO L225 Difference]: With dead ends: 852 [2025-03-04 07:37:35,095 INFO L226 Difference]: Without dead ends: 852 [2025-03-04 07:37:35,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:37:35,095 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 461 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:35,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1545 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:37:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-03-04 07:37:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 630. [2025-03-04 07:37:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 552 states have (on average 1.4039855072463767) internal successors, (775), 607 states have internal predecessors, (775), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2025-03-04 07:37:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 823 transitions. [2025-03-04 07:37:35,106 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 823 transitions. Word has length 53 [2025-03-04 07:37:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:35,106 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 823 transitions. [2025-03-04 07:37:35,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 823 transitions. [2025-03-04 07:37:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:35,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:35,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:35,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 07:37:35,107 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:35,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1354077633, now seen corresponding path program 1 times [2025-03-04 07:37:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:35,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148579858] [2025-03-04 07:37:35,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:35,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:35,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:35,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:35,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:35,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:35,669 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:37:35,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148579858] [2025-03-04 07:37:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148579858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:35,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:35,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:37:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170766894] [2025-03-04 07:37:35,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:35,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:37:35,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:35,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:37:35,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:37:35,671 INFO L87 Difference]: Start difference. First operand 630 states and 823 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:36,302 INFO L93 Difference]: Finished difference Result 878 states and 1122 transitions. [2025-03-04 07:37:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:37:36,303 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:36,305 INFO L225 Difference]: With dead ends: 878 [2025-03-04 07:37:36,305 INFO L226 Difference]: Without dead ends: 878 [2025-03-04 07:37:36,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:37:36,305 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 424 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:36,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1740 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:37:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-04 07:37:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 565. [2025-03-04 07:37:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 495 states have (on average 1.406060606060606) internal successors, (696), 546 states have internal predecessors, (696), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 07:37:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 732 transitions. [2025-03-04 07:37:36,312 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 732 transitions. Word has length 53 [2025-03-04 07:37:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:36,312 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 732 transitions. [2025-03-04 07:37:36,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 732 transitions. [2025-03-04 07:37:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:36,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:36,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:36,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 07:37:36,313 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:36,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1354077280, now seen corresponding path program 1 times [2025-03-04 07:37:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:36,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043009024] [2025-03-04 07:37:36,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:36,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:36,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:36,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:36,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:36,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:36,636 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:37:36,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:36,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043009024] [2025-03-04 07:37:36,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043009024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:36,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:36,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 07:37:36,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918695304] [2025-03-04 07:37:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:36,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:37:36,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:36,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:37:36,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:37:36,638 INFO L87 Difference]: Start difference. First operand 565 states and 732 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:36,972 INFO L93 Difference]: Finished difference Result 760 states and 942 transitions. [2025-03-04 07:37:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:37:36,973 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:36,974 INFO L225 Difference]: With dead ends: 760 [2025-03-04 07:37:36,974 INFO L226 Difference]: Without dead ends: 760 [2025-03-04 07:37:36,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:37:36,975 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 400 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:36,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1622 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:37:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-04 07:37:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 565. [2025-03-04 07:37:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 495 states have (on average 1.402020202020202) internal successors, (694), 546 states have internal predecessors, (694), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 07:37:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 730 transitions. [2025-03-04 07:37:36,983 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 730 transitions. Word has length 53 [2025-03-04 07:37:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:36,983 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 730 transitions. [2025-03-04 07:37:36,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 730 transitions. [2025-03-04 07:37:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:36,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:36,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:36,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 07:37:36,984 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:36,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1355001153, now seen corresponding path program 1 times [2025-03-04 07:37:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:36,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99314689] [2025-03-04 07:37:36,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:36,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:36,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:36,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:36,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:38,128 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:37:38,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99314689] [2025-03-04 07:37:38,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99314689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:37:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194115820] [2025-03-04 07:37:38,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:38,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:38,131 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:37:38,131 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:37:38,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:38,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:38,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:38,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:38,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 07:37:38,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:38,291 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:37:38,604 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:37:38,755 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:37:38,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 07:37:38,776 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:37:38,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:37:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194115820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:37:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [21] total 30 [2025-03-04 07:37:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107726066] [2025-03-04 07:37:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:38,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:37:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:38,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:37:38,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:37:38,778 INFO L87 Difference]: Start difference. First operand 565 states and 730 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:39,193 INFO L93 Difference]: Finished difference Result 915 states and 1193 transitions. [2025-03-04 07:37:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:37:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:39,196 INFO L225 Difference]: With dead ends: 915 [2025-03-04 07:37:39,196 INFO L226 Difference]: Without dead ends: 915 [2025-03-04 07:37:39,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:37:39,197 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 346 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:39,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1001 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:37:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-04 07:37:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 690. [2025-03-04 07:37:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 604 states have (on average 1.3973509933774835) internal successors, (844), 663 states have internal predecessors, (844), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2025-03-04 07:37:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 904 transitions. [2025-03-04 07:37:39,204 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 904 transitions. Word has length 53 [2025-03-04 07:37:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:39,204 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 904 transitions. [2025-03-04 07:37:39,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 904 transitions. [2025-03-04 07:37:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:39,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:39,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:39,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:37:39,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-04 07:37:39,410 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:39,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1355001154, now seen corresponding path program 1 times [2025-03-04 07:37:39,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:39,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763480350] [2025-03-04 07:37:39,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:39,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:39,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:39,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:39,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:39,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:39,646 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:37:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763480350] [2025-03-04 07:37:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763480350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:39,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:39,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:37:39,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203385349] [2025-03-04 07:37:39,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:39,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:37:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:39,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:37:39,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:37:39,647 INFO L87 Difference]: Start difference. First operand 690 states and 904 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:40,007 INFO L93 Difference]: Finished difference Result 1062 states and 1399 transitions. [2025-03-04 07:37:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:37:40,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:40,010 INFO L225 Difference]: With dead ends: 1062 [2025-03-04 07:37:40,010 INFO L226 Difference]: Without dead ends: 1062 [2025-03-04 07:37:40,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:37:40,010 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 157 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:40,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1112 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:37:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-03-04 07:37:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 869. [2025-03-04 07:37:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 763 states have (on average 1.4272608125819135) internal successors, (1089), 832 states have internal predecessors, (1089), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2025-03-04 07:37:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1179 transitions. [2025-03-04 07:37:40,021 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1179 transitions. Word has length 53 [2025-03-04 07:37:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:40,022 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1179 transitions. [2025-03-04 07:37:40,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1179 transitions. [2025-03-04 07:37:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:40,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:40,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:40,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 07:37:40,022 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:40,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1355000801, now seen corresponding path program 1 times [2025-03-04 07:37:40,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:40,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519315149] [2025-03-04 07:37:40,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:40,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:40,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:40,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:40,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:40,187 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:37:40,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:40,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519315149] [2025-03-04 07:37:40,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519315149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:40,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:40,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:37:40,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656440722] [2025-03-04 07:37:40,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:40,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:37:40,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:40,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:37:40,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:37:40,188 INFO L87 Difference]: Start difference. First operand 869 states and 1179 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:40,403 INFO L93 Difference]: Finished difference Result 1064 states and 1400 transitions. [2025-03-04 07:37:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:37:40,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:40,406 INFO L225 Difference]: With dead ends: 1064 [2025-03-04 07:37:40,406 INFO L226 Difference]: Without dead ends: 1064 [2025-03-04 07:37:40,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:37:40,406 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 160 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:40,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1349 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:37:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-04 07:37:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 862. [2025-03-04 07:37:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 756 states have (on average 1.4259259259259258) internal successors, (1078), 825 states have internal predecessors, (1078), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2025-03-04 07:37:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1168 transitions. [2025-03-04 07:37:40,419 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1168 transitions. Word has length 53 [2025-03-04 07:37:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:40,419 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1168 transitions. [2025-03-04 07:37:40,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1168 transitions. [2025-03-04 07:37:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:40,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:40,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, 1, 1, 1, 1, 1, 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:37:40,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 07:37:40,420 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -689095389, now seen corresponding path program 1 times [2025-03-04 07:37:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792360123] [2025-03-04 07:37:40,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:40,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:40,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:40,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:40,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:40,605 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:37:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:40,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792360123] [2025-03-04 07:37:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792360123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:40,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:40,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:37:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327307489] [2025-03-04 07:37:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:40,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:37:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:40,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:37:40,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:37:40,607 INFO L87 Difference]: Start difference. First operand 862 states and 1168 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:40,876 INFO L93 Difference]: Finished difference Result 1232 states and 1683 transitions. [2025-03-04 07:37:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:37:40,876 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:40,880 INFO L225 Difference]: With dead ends: 1232 [2025-03-04 07:37:40,880 INFO L226 Difference]: Without dead ends: 1232 [2025-03-04 07:37:40,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:37:40,881 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 314 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:40,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 938 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:37:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-03-04 07:37:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 921. [2025-03-04 07:37:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 807 states have (on average 1.422552664188352) internal successors, (1148), 880 states have internal predecessors, (1148), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-03-04 07:37:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1250 transitions. [2025-03-04 07:37:40,896 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1250 transitions. Word has length 53 [2025-03-04 07:37:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:40,896 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1250 transitions. [2025-03-04 07:37:40,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1250 transitions. [2025-03-04 07:37:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:40,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:40,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:40,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-04 07:37:40,897 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:40,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash -689095388, now seen corresponding path program 1 times [2025-03-04 07:37:40,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:40,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250216184] [2025-03-04 07:37:40,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:40,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:40,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:40,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:40,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:41,206 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:37:41,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:41,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250216184] [2025-03-04 07:37:41,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250216184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:41,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:37:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193275930] [2025-03-04 07:37:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:41,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:37:41,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:41,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:37:41,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:37:41,207 INFO L87 Difference]: Start difference. First operand 921 states and 1250 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:41,631 INFO L93 Difference]: Finished difference Result 1370 states and 1881 transitions. [2025-03-04 07:37:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:37:41,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:41,635 INFO L225 Difference]: With dead ends: 1370 [2025-03-04 07:37:41,635 INFO L226 Difference]: Without dead ends: 1370 [2025-03-04 07:37:41,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:37:41,636 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 417 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:41,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1111 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:37:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-04 07:37:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1017. [2025-03-04 07:37:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 895 states have (on average 1.4513966480446927) internal successors, (1299), 972 states have internal predecessors, (1299), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2025-03-04 07:37:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1413 transitions. [2025-03-04 07:37:41,649 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1413 transitions. Word has length 53 [2025-03-04 07:37:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:41,649 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1413 transitions. [2025-03-04 07:37:41,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1413 transitions. [2025-03-04 07:37:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:41,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:41,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:41,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 07:37:41,651 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:41,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash -689095741, now seen corresponding path program 1 times [2025-03-04 07:37:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:41,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022276128] [2025-03-04 07:37:41,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:41,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:41,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:41,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:41,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:41,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:42,048 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:37:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022276128] [2025-03-04 07:37:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022276128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:42,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:37:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377214770] [2025-03-04 07:37:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:42,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:37:42,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:42,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:37:42,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:37:42,049 INFO L87 Difference]: Start difference. First operand 1017 states and 1413 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:42,723 INFO L93 Difference]: Finished difference Result 1399 states and 1904 transitions. [2025-03-04 07:37:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:37:42,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:42,727 INFO L225 Difference]: With dead ends: 1399 [2025-03-04 07:37:42,729 INFO L226 Difference]: Without dead ends: 1399 [2025-03-04 07:37:42,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:37:42,730 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 310 mSDsluCounter, 3278 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:42,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 3575 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:37:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-04 07:37:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1066. [2025-03-04 07:37:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 944 states have (on average 1.451271186440678) internal successors, (1370), 1021 states have internal predecessors, (1370), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2025-03-04 07:37:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1484 transitions. [2025-03-04 07:37:42,748 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1484 transitions. Word has length 53 [2025-03-04 07:37:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:42,749 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1484 transitions. [2025-03-04 07:37:42,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1484 transitions. [2025-03-04 07:37:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:42,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:42,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:42,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 07:37:42,750 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:42,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash -688171868, now seen corresponding path program 1 times [2025-03-04 07:37:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720631118] [2025-03-04 07:37:42,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:42,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:42,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:42,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:42,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:43,194 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:37:43,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:43,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720631118] [2025-03-04 07:37:43,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720631118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:37:43,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900291290] [2025-03-04 07:37:43,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:43,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:43,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:43,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:37:43,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:37:43,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:43,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:43,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:43,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:43,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 07:37:43,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:43,359 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:37:43,578 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:37:43,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:37:43,680 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 21 treesize of output 9 [2025-03-04 07:37:43,684 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:37:43,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:37:43,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900291290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:43,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:37:43,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2025-03-04 07:37:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815457555] [2025-03-04 07:37:43,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:37:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:43,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:37:43,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:37:43,685 INFO L87 Difference]: Start difference. First operand 1066 states and 1484 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:44,207 INFO L93 Difference]: Finished difference Result 1436 states and 1967 transitions. [2025-03-04 07:37:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:37:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:44,210 INFO L225 Difference]: With dead ends: 1436 [2025-03-04 07:37:44,211 INFO L226 Difference]: Without dead ends: 1436 [2025-03-04 07:37:44,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:37:44,211 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 311 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:44,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1791 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:37:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-03-04 07:37:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1183. [2025-03-04 07:37:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1045 states have (on average 1.4440191387559809) internal successors, (1509), 1130 states have internal predecessors, (1509), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2025-03-04 07:37:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1647 transitions. [2025-03-04 07:37:44,226 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1647 transitions. Word has length 53 [2025-03-04 07:37:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:44,226 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1647 transitions. [2025-03-04 07:37:44,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1647 transitions. [2025-03-04 07:37:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:44,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:44,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:44,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:37:44,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:44,427 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -688171867, now seen corresponding path program 1 times [2025-03-04 07:37:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764160913] [2025-03-04 07:37:44,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:44,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:44,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:44,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:45,639 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:37:45,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764160913] [2025-03-04 07:37:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764160913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:37:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736777509] [2025-03-04 07:37:45,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:45,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:45,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:45,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:37:45,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:37:45,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:45,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:45,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:45,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-04 07:37:45,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:45,856 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 8 treesize of output 1 [2025-03-04 07:37:46,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:37:46,136 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:37:46,205 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 25 treesize of output 13 [2025-03-04 07:37:46,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:37:46,347 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 17 treesize of output 9 [2025-03-04 07:37:46,356 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:37:46,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:37:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736777509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:37:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [21] total 29 [2025-03-04 07:37:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590714761] [2025-03-04 07:37:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:46,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:37:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:46,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:37:46,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:37:46,357 INFO L87 Difference]: Start difference. First operand 1183 states and 1647 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:47,028 INFO L93 Difference]: Finished difference Result 1508 states and 2069 transitions. [2025-03-04 07:37:47,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:37:47,028 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:47,031 INFO L225 Difference]: With dead ends: 1508 [2025-03-04 07:37:47,031 INFO L226 Difference]: Without dead ends: 1508 [2025-03-04 07:37:47,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:37:47,031 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 316 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:47,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1969 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:37:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-03-04 07:37:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1272. [2025-03-04 07:37:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1126 states have (on average 1.4644760213143873) internal successors, (1649), 1215 states have internal predecessors, (1649), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2025-03-04 07:37:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1799 transitions. [2025-03-04 07:37:47,046 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1799 transitions. Word has length 53 [2025-03-04 07:37:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:47,046 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1799 transitions. [2025-03-04 07:37:47,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1799 transitions. [2025-03-04 07:37:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:37:47,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:47,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:47,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:37:47,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:47,248 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:47,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash -688172220, now seen corresponding path program 1 times [2025-03-04 07:37:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:47,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806089515] [2025-03-04 07:37:47,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:47,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:37:47,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:37:47,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:47,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:47,438 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:37:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806089515] [2025-03-04 07:37:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806089515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:47,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:37:47,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112249062] [2025-03-04 07:37:47,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:47,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:37:47,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:47,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:37:47,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:37:47,440 INFO L87 Difference]: Start difference. First operand 1272 states and 1799 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:47,721 INFO L93 Difference]: Finished difference Result 1538 states and 2135 transitions. [2025-03-04 07:37:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:37:47,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 07:37:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:47,724 INFO L225 Difference]: With dead ends: 1538 [2025-03-04 07:37:47,724 INFO L226 Difference]: Without dead ends: 1538 [2025-03-04 07:37:47,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:37:47,724 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 144 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:47,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1401 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:37:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-03-04 07:37:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1168. [2025-03-04 07:37:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1034 states have (on average 1.4555125725338491) internal successors, (1505), 1117 states have internal predecessors, (1505), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-03-04 07:37:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1637 transitions. [2025-03-04 07:37:47,739 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1637 transitions. Word has length 53 [2025-03-04 07:37:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:47,740 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1637 transitions. [2025-03-04 07:37:47,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1637 transitions. [2025-03-04 07:37:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 07:37:47,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:47,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:47,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-04 07:37:47,741 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:47,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1851200209, now seen corresponding path program 1 times [2025-03-04 07:37:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:47,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704679414] [2025-03-04 07:37:47,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:47,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:37:47,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:37:47,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:47,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:48,011 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:37:48,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:48,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704679414] [2025-03-04 07:37:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704679414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:48,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:48,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:37:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994585562] [2025-03-04 07:37:48,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:48,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:37:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:48,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:37:48,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:37:48,012 INFO L87 Difference]: Start difference. First operand 1168 states and 1637 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:48,240 INFO L93 Difference]: Finished difference Result 1180 states and 1642 transitions. [2025-03-04 07:37:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:37:48,244 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-04 07:37:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:48,246 INFO L225 Difference]: With dead ends: 1180 [2025-03-04 07:37:48,246 INFO L226 Difference]: Without dead ends: 1180 [2025-03-04 07:37:48,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:37:48,246 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 181 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:48,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1191 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:37:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-04 07:37:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1168. [2025-03-04 07:37:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1034 states have (on average 1.45357833655706) internal successors, (1503), 1117 states have internal predecessors, (1503), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-03-04 07:37:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1635 transitions. [2025-03-04 07:37:48,259 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1635 transitions. Word has length 54 [2025-03-04 07:37:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:48,259 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1635 transitions. [2025-03-04 07:37:48,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1635 transitions. [2025-03-04 07:37:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:37:48,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:48,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:48,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-04 07:37:48,260 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:48,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1428909656, now seen corresponding path program 1 times [2025-03-04 07:37:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50947647] [2025-03-04 07:37:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:48,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:48,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:37:48,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:37:48,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:48,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:37:48,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50947647] [2025-03-04 07:37:48,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50947647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:48,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:37:48,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239409718] [2025-03-04 07:37:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:37:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:48,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:37:48,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:37:48,308 INFO L87 Difference]: Start difference. First operand 1168 states and 1635 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:37:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:48,324 INFO L93 Difference]: Finished difference Result 1181 states and 1636 transitions. [2025-03-04 07:37:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:37:48,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-03-04 07:37:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:48,326 INFO L225 Difference]: With dead ends: 1181 [2025-03-04 07:37:48,327 INFO L226 Difference]: Without dead ends: 1181 [2025-03-04 07:37:48,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:37:48,327 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 125 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:48,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 449 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:37:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-03-04 07:37:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1167. [2025-03-04 07:37:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1034 states have (on average 1.4410058027079304) internal successors, (1490), 1116 states have internal predecessors, (1490), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-03-04 07:37:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1622 transitions. [2025-03-04 07:37:48,350 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1622 transitions. Word has length 57 [2025-03-04 07:37:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:48,350 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1622 transitions. [2025-03-04 07:37:48,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:37:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1622 transitions. [2025-03-04 07:37:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:37:48,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:48,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:48,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-04 07:37:48,352 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:48,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash 993874926, now seen corresponding path program 1 times [2025-03-04 07:37:48,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:48,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681079441] [2025-03-04 07:37:48,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:48,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:48,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:37:48,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:37:48,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:48,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:48,808 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:37:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681079441] [2025-03-04 07:37:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681079441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 07:37:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368585847] [2025-03-04 07:37:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:37:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:48,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:37:48,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:37:48,810 INFO L87 Difference]: Start difference. First operand 1167 states and 1622 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:49,276 INFO L93 Difference]: Finished difference Result 1502 states and 2041 transitions. [2025-03-04 07:37:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:37:49,277 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-04 07:37:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:49,279 INFO L225 Difference]: With dead ends: 1502 [2025-03-04 07:37:49,279 INFO L226 Difference]: Without dead ends: 1502 [2025-03-04 07:37:49,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:37:49,280 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 397 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:49,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1456 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:37:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-04 07:37:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1280. [2025-03-04 07:37:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1135 states have (on average 1.4440528634361234) internal successors, (1639), 1223 states have internal predecessors, (1639), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2025-03-04 07:37:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1789 transitions. [2025-03-04 07:37:49,292 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1789 transitions. Word has length 56 [2025-03-04 07:37:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:49,292 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1789 transitions. [2025-03-04 07:37:49,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1789 transitions. [2025-03-04 07:37:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:37:49,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:49,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:49,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-04 07:37:49,293 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:49,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1558282035, now seen corresponding path program 1 times [2025-03-04 07:37:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:49,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858287858] [2025-03-04 07:37:49,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:49,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:37:49,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:37:49,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:49,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:49,465 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:37:49,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858287858] [2025-03-04 07:37:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858287858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:49,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:49,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:37:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567983225] [2025-03-04 07:37:49,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:49,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:37:49,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:49,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:37:49,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:37:49,467 INFO L87 Difference]: Start difference. First operand 1280 states and 1789 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:49,683 INFO L93 Difference]: Finished difference Result 1558 states and 2143 transitions. [2025-03-04 07:37:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:37:49,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-04 07:37:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:49,686 INFO L225 Difference]: With dead ends: 1558 [2025-03-04 07:37:49,686 INFO L226 Difference]: Without dead ends: 1558 [2025-03-04 07:37:49,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:37:49,686 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:49,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 965 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:37:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-03-04 07:37:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1327. [2025-03-04 07:37:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1178 states have (on average 1.4524617996604414) internal successors, (1711), 1268 states have internal predecessors, (1711), 52 states have call successors, (52), 26 states have call predecessors, (52), 52 states have return successors, (104), 32 states have call predecessors, (104), 52 states have call successors, (104) [2025-03-04 07:37:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1867 transitions. [2025-03-04 07:37:49,698 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1867 transitions. Word has length 56 [2025-03-04 07:37:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:49,698 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1867 transitions. [2025-03-04 07:37:49,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1867 transitions. [2025-03-04 07:37:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:37:49,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:49,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:49,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-04 07:37:49,699 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:49,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1102925227, now seen corresponding path program 1 times [2025-03-04 07:37:49,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:49,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807666985] [2025-03-04 07:37:49,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:49,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:49,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:37:49,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:37:49,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:49,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:49,920 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:37:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:49,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807666985] [2025-03-04 07:37:49,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807666985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:49,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:49,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:37:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99941806] [2025-03-04 07:37:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:49,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:37:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:49,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:37:49,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:37:49,922 INFO L87 Difference]: Start difference. First operand 1327 states and 1867 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:50,168 INFO L93 Difference]: Finished difference Result 1720 states and 2387 transitions. [2025-03-04 07:37:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:37:50,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-04 07:37:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:50,171 INFO L225 Difference]: With dead ends: 1720 [2025-03-04 07:37:50,171 INFO L226 Difference]: Without dead ends: 1720 [2025-03-04 07:37:50,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:37:50,171 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 362 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:50,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1063 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:37:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2025-03-04 07:37:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1327. [2025-03-04 07:37:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1178 states have (on average 1.4524617996604414) internal successors, (1711), 1268 states have internal predecessors, (1711), 52 states have call successors, (52), 26 states have call predecessors, (52), 52 states have return successors, (104), 32 states have call predecessors, (104), 52 states have call successors, (104) [2025-03-04 07:37:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1867 transitions. [2025-03-04 07:37:50,182 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1867 transitions. Word has length 56 [2025-03-04 07:37:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:50,182 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1867 transitions. [2025-03-04 07:37:50,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:37:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1867 transitions. [2025-03-04 07:37:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:37:50,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:50,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:50,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-04 07:37:50,183 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-04 07:37:50,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1449231734, now seen corresponding path program 1 times [2025-03-04 07:37:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295399510] [2025-03-04 07:37:50,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:50,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:37:50,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:37:50,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:50,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:50,744 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:37:50,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295399510] [2025-03-04 07:37:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295399510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:37:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024024429] [2025-03-04 07:37:50,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:50,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:50,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:50,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:37:50,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:37:50,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:37:50,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:37:50,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:50,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:50,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:37:50,886 INFO L279 TraceCheckSpWp]: Computing forward predicates...