./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-8fc3dc6-m [2025-03-17 11:55:22,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:55:22,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:55:22,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:55:22,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:55:22,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:55:22,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:55:22,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:55:22,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:55:22,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:55:22,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:55:22,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:55:22,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:55:22,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:55:22,315 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:55:22,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:55:22,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:55:22,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:55:22,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:55:22,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:55:22,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:55:22,317 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-17 11:55:22,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:55:22,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:55:22,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:55:22,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:55:22,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:55:22,567 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-17 11:55:23,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b23155edb/5324f6409ec14e09a227335f1d896885/FLAG3120a258e [2025-03-17 11:55:23,984 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:55:23,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2025-03-17 11:55:23,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b23155edb/5324f6409ec14e09a227335f1d896885/FLAG3120a258e [2025-03-17 11:55:24,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b23155edb/5324f6409ec14e09a227335f1d896885 [2025-03-17 11:55:24,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:55:24,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:55:24,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:55:24,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:55:24,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:55:24,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a14da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24, skipping insertion in model container [2025-03-17 11:55:24,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:55:24,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:55:24,531 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:55:24,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:55:24,602 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:55:24,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24 WrapperNode [2025-03-17 11:55:24,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:55:24,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:55:24,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:55:24,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:55:24,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,638 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 206 [2025-03-17 11:55:24,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:55:24,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:55:24,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:55:24,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:55:24,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,662 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-17 11:55:24,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:55:24,678 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:55:24,678 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:55:24,678 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:55:24,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (1/1) ... [2025-03-17 11:55:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:55:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:24,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:55:24,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-03-17 11:55:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:55:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:55:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 11:55:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 11:55:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:55:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:55:24,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:55:24,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:55:24,817 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:55:24,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:55:25,216 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2025-03-17 11:55:25,217 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:55:25,224 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:55:25,224 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:55:25,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:55:25 BoogieIcfgContainer [2025-03-17 11:55:25,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:55:25,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:55:25,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:55:25,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:55:25,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:55:24" (1/3) ... [2025-03-17 11:55:25,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c220ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:55:25, skipping insertion in model container [2025-03-17 11:55:25,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:24" (2/3) ... [2025-03-17 11:55:25,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c220ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:55:25, skipping insertion in model container [2025-03-17 11:55:25,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:55:25" (3/3) ... [2025-03-17 11:55:25,235 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0217.i [2025-03-17 11:55:25,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:55:25,250 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0217.i that has 2 procedures, 162 locations, 1 initial locations, 6 loop locations, and 67 error locations. [2025-03-17 11:55:25,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:55:25,298 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;@84af4c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:55:25,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-03-17 11:55:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 91 states have (on average 2.0) internal successors, (182), 158 states have internal predecessors, (182), 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-17 11:55:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:55:25,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:25,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:55:25,306 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-17 11:55:25,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash 209752406, now seen corresponding path program 1 times [2025-03-17 11:55:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:25,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528919026] [2025-03-17 11:55:25,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:25,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:55:25,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:55:25,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:25,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:25,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528919026] [2025-03-17 11:55:25,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528919026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:25,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:25,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:25,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830344374] [2025-03-17 11:55:25,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:25,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:55:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:25,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:55:25,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:55:25,414 INFO L87 Difference]: Start difference. First operand has 162 states, 91 states have (on average 2.0) internal successors, (182), 158 states have internal predecessors, (182), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:25,427 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2025-03-17 11:55:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:55:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:55:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:25,432 INFO L225 Difference]: With dead ends: 162 [2025-03-17 11:55:25,432 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 11:55:25,433 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-17 11:55:25,434 INFO L435 NwaCegarLoop]: 181 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, 181 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-17 11:55:25,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 11:55:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-17 11:55:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 156 states have internal predecessors, (175), 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-17 11:55:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2025-03-17 11:55:25,462 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 5 [2025-03-17 11:55:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:25,463 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2025-03-17 11:55:25,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2025-03-17 11:55:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:55:25,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:25,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:55:25,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:55:25,463 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-17 11:55:25,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2083675590, now seen corresponding path program 1 times [2025-03-17 11:55:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:25,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147875908] [2025-03-17 11:55:25,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:25,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:25,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:55:25,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:55:25,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:25,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147875908] [2025-03-17 11:55:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147875908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:25,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:25,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:55:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364734245] [2025-03-17 11:55:25,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:25,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:25,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:25,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:25,549 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 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-17 11:55:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:25,756 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2025-03-17 11:55:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:25,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-17 11:55:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:25,759 INFO L225 Difference]: With dead ends: 313 [2025-03-17 11:55:25,761 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 11:55:25,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:25,762 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:25,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 227 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 11:55:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 222. [2025-03-17 11:55:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 149 states have (on average 1.912751677852349) internal successors, (285), 215 states have internal predecessors, (285), 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-17 11:55:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 293 transitions. [2025-03-17 11:55:25,779 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 293 transitions. Word has length 6 [2025-03-17 11:55:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:25,781 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 293 transitions. [2025-03-17 11:55:25,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-17 11:55:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 293 transitions. [2025-03-17 11:55:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:55:25,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:25,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:55:25,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:55:25,783 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-17 11:55:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2083675589, now seen corresponding path program 1 times [2025-03-17 11:55:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:25,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433580529] [2025-03-17 11:55:25,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:25,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:55:25,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:55:25,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:25,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433580529] [2025-03-17 11:55:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433580529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849453087] [2025-03-17 11:55:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:25,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:25,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:25,893 INFO L87 Difference]: Start difference. First operand 222 states and 293 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 11:55:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:26,035 INFO L93 Difference]: Finished difference Result 342 states and 436 transitions. [2025-03-17 11:55:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:26,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 11:55:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:26,036 INFO L225 Difference]: With dead ends: 342 [2025-03-17 11:55:26,036 INFO L226 Difference]: Without dead ends: 342 [2025-03-17 11:55:26,037 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-17 11:55:26,037 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 99 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:26,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 387 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-17 11:55:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 292. [2025-03-17 11:55:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.8732394366197183) internal successors, (399), 281 states have internal predecessors, (399), 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-17 11:55:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 415 transitions. [2025-03-17 11:55:26,065 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 415 transitions. Word has length 6 [2025-03-17 11:55:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:26,066 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 415 transitions. [2025-03-17 11:55:26,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 11:55:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 415 transitions. [2025-03-17 11:55:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:55:26,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:26,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:55:26,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:55:26,066 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-17 11:55:26,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2083675558, now seen corresponding path program 1 times [2025-03-17 11:55:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148789839] [2025-03-17 11:55:26,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:26,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:55:26,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:55:26,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:26,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:26,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148789839] [2025-03-17 11:55:26,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148789839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:26,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:26,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:26,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276173911] [2025-03-17 11:55:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:26,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:26,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:26,186 INFO L87 Difference]: Start difference. First operand 292 states and 415 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 11:55:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:26,312 INFO L93 Difference]: Finished difference Result 341 states and 434 transitions. [2025-03-17 11:55:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:26,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 11:55:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:26,314 INFO L225 Difference]: With dead ends: 341 [2025-03-17 11:55:26,314 INFO L226 Difference]: Without dead ends: 341 [2025-03-17 11:55:26,314 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-17 11:55:26,315 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 97 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:26,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 388 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-17 11:55:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 292. [2025-03-17 11:55:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.8732394366197183) internal successors, (399), 281 states have internal predecessors, (399), 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-17 11:55:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 415 transitions. [2025-03-17 11:55:26,326 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 415 transitions. Word has length 6 [2025-03-17 11:55:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:26,326 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 415 transitions. [2025-03-17 11:55:26,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 11:55:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 415 transitions. [2025-03-17 11:55:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:55:26,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:26,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:26,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:55:26,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:26,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash 382815448, now seen corresponding path program 1 times [2025-03-17 11:55:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:26,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638212283] [2025-03-17 11:55:26,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:26,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:55:26,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:55:26,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:26,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638212283] [2025-03-17 11:55:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638212283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:26,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:26,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629500656] [2025-03-17 11:55:26,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:26,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:26,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:26,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:26,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:26,522 INFO L87 Difference]: Start difference. First operand 292 states and 415 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:26,669 INFO L93 Difference]: Finished difference Result 433 states and 588 transitions. [2025-03-17 11:55:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:55:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:26,672 INFO L225 Difference]: With dead ends: 433 [2025-03-17 11:55:26,672 INFO L226 Difference]: Without dead ends: 433 [2025-03-17 11:55:26,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:26,673 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 128 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:26,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 705 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-17 11:55:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 332. [2025-03-17 11:55:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 250 states have (on average 1.856) internal successors, (464), 319 states have internal predecessors, (464), 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-17 11:55:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 484 transitions. [2025-03-17 11:55:26,682 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 484 transitions. Word has length 9 [2025-03-17 11:55:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:26,682 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 484 transitions. [2025-03-17 11:55:26,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 484 transitions. [2025-03-17 11:55:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:55:26,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:26,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:26,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:55:26,683 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-17 11:55:26,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash 382815096, now seen corresponding path program 1 times [2025-03-17 11:55:26,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:26,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456577577] [2025-03-17 11:55:26,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:26,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:26,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:55:26,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:55:26,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:26,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:26,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:26,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456577577] [2025-03-17 11:55:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456577577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:55:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887427022] [2025-03-17 11:55:26,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:26,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:26,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:26,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:26,703 INFO L87 Difference]: Start difference. First operand 332 states and 484 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:26,799 INFO L93 Difference]: Finished difference Result 394 states and 543 transitions. [2025-03-17 11:55:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:26,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:55:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:26,801 INFO L225 Difference]: With dead ends: 394 [2025-03-17 11:55:26,801 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 11:55:26,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:26,802 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 73 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:26,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 260 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 11:55:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 333. [2025-03-17 11:55:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 251 states have (on average 1.848605577689243) internal successors, (464), 320 states have internal predecessors, (464), 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-17 11:55:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 484 transitions. [2025-03-17 11:55:26,813 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 484 transitions. Word has length 9 [2025-03-17 11:55:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:26,813 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 484 transitions. [2025-03-17 11:55:26,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 484 transitions. [2025-03-17 11:55:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:55:26,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:26,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:26,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:55:26,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:26,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash 383738969, now seen corresponding path program 1 times [2025-03-17 11:55:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:26,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104101747] [2025-03-17 11:55:26,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:26,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:55:26,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:55:26,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:26,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:26,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104101747] [2025-03-17 11:55:26,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104101747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:26,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:26,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577303079] [2025-03-17 11:55:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:26,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:26,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:26,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:26,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:26,891 INFO L87 Difference]: Start difference. First operand 333 states and 484 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:27,013 INFO L93 Difference]: Finished difference Result 424 states and 576 transitions. [2025-03-17 11:55:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:55:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:27,015 INFO L225 Difference]: With dead ends: 424 [2025-03-17 11:55:27,015 INFO L226 Difference]: Without dead ends: 419 [2025-03-17 11:55:27,015 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-17 11:55:27,016 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 115 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:27,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 708 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-17 11:55:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 328. [2025-03-17 11:55:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 246 states have (on average 1.8617886178861789) internal successors, (458), 315 states have internal predecessors, (458), 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-17 11:55:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 478 transitions. [2025-03-17 11:55:27,023 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 478 transitions. Word has length 9 [2025-03-17 11:55:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:27,023 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 478 transitions. [2025-03-17 11:55:27,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 478 transitions. [2025-03-17 11:55:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:55:27,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:27,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:27,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:55:27,024 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-17 11:55:27,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash -820720318, now seen corresponding path program 1 times [2025-03-17 11:55:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:27,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762225131] [2025-03-17 11:55:27,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:27,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:27,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:55:27,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:55:27,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:27,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:27,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:27,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762225131] [2025-03-17 11:55:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762225131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:27,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:27,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222362268] [2025-03-17 11:55:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:27,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:27,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:27,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:27,062 INFO L87 Difference]: Start difference. First operand 328 states and 478 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 11:55:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:27,239 INFO L93 Difference]: Finished difference Result 435 states and 572 transitions. [2025-03-17 11:55:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:27,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2025-03-17 11:55:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:27,241 INFO L225 Difference]: With dead ends: 435 [2025-03-17 11:55:27,241 INFO L226 Difference]: Without dead ends: 435 [2025-03-17 11:55:27,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:27,242 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 165 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:27,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 328 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-17 11:55:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 334. [2025-03-17 11:55:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 252 states have (on average 1.8412698412698412) internal successors, (464), 321 states have internal predecessors, (464), 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-17 11:55:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 484 transitions. [2025-03-17 11:55:27,250 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 484 transitions. Word has length 14 [2025-03-17 11:55:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:27,250 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 484 transitions. [2025-03-17 11:55:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 11:55:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 484 transitions. [2025-03-17 11:55:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:55:27,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:27,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:27,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:55:27,251 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-17 11:55:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash -820720317, now seen corresponding path program 1 times [2025-03-17 11:55:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236317137] [2025-03-17 11:55:27,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:27,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:55:27,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:55:27,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:27,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:27,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236317137] [2025-03-17 11:55:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236317137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:27,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:27,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:27,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566685807] [2025-03-17 11:55:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:27,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:27,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:27,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:27,316 INFO L87 Difference]: Start difference. First operand 334 states and 484 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 11:55:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:27,441 INFO L93 Difference]: Finished difference Result 379 states and 493 transitions. [2025-03-17 11:55:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2025-03-17 11:55:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:27,443 INFO L225 Difference]: With dead ends: 379 [2025-03-17 11:55:27,443 INFO L226 Difference]: Without dead ends: 379 [2025-03-17 11:55:27,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:27,443 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 97 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 416 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-17 11:55:27,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 416 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-17 11:55:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 334. [2025-03-17 11:55:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 252 states have (on average 1.8055555555555556) internal successors, (455), 321 states have internal predecessors, (455), 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-17 11:55:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 475 transitions. [2025-03-17 11:55:27,453 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 475 transitions. Word has length 14 [2025-03-17 11:55:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:27,454 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 475 transitions. [2025-03-17 11:55:27,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 11:55:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 475 transitions. [2025-03-17 11:55:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:55:27,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:27,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:27,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:55:27,456 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-17 11:55:27,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash 937829760, now seen corresponding path program 1 times [2025-03-17 11:55:27,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:27,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251149776] [2025-03-17 11:55:27,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:27,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:55:27,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:55:27,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:27,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251149776] [2025-03-17 11:55:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251149776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:27,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:27,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541594901] [2025-03-17 11:55:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:27,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:27,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:27,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:27,551 INFO L87 Difference]: Start difference. First operand 334 states and 475 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-17 11:55:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:27,730 INFO L93 Difference]: Finished difference Result 451 states and 593 transitions. [2025-03-17 11:55:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:27,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 16 [2025-03-17 11:55:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:27,732 INFO L225 Difference]: With dead ends: 451 [2025-03-17 11:55:27,732 INFO L226 Difference]: Without dead ends: 451 [2025-03-17 11:55:27,732 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-17 11:55:27,732 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 335 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:27,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 312 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-17 11:55:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 331. [2025-03-17 11:55:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 253 states have (on average 1.774703557312253) internal successors, (449), 318 states have internal predecessors, (449), 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-17 11:55:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 469 transitions. [2025-03-17 11:55:27,741 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 469 transitions. Word has length 16 [2025-03-17 11:55:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:27,741 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 469 transitions. [2025-03-17 11:55:27,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-17 11:55:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 469 transitions. [2025-03-17 11:55:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:55:27,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:27,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:27,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:55:27,744 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-17 11:55:27,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash 937829761, now seen corresponding path program 1 times [2025-03-17 11:55:27,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:27,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11239996] [2025-03-17 11:55:27,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:27,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:55:27,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:55:27,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:27,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11239996] [2025-03-17 11:55:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11239996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:27,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889530300] [2025-03-17 11:55:27,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:27,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:27,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:27,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:27,894 INFO L87 Difference]: Start difference. First operand 331 states and 469 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-17 11:55:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:28,259 INFO L93 Difference]: Finished difference Result 479 states and 620 transitions. [2025-03-17 11:55:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 16 [2025-03-17 11:55:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:28,261 INFO L225 Difference]: With dead ends: 479 [2025-03-17 11:55:28,265 INFO L226 Difference]: Without dead ends: 479 [2025-03-17 11:55:28,266 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-17 11:55:28,266 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 248 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:28,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 514 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-17 11:55:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 364. [2025-03-17 11:55:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 284 states have (on average 1.7570422535211268) internal successors, (499), 350 states have internal predecessors, (499), 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-17 11:55:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 523 transitions. [2025-03-17 11:55:28,279 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 523 transitions. Word has length 16 [2025-03-17 11:55:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:28,279 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 523 transitions. [2025-03-17 11:55:28,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-17 11:55:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 523 transitions. [2025-03-17 11:55:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:55:28,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:28,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:28,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:55:28,281 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-17 11:55:28,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash -869624702, now seen corresponding path program 1 times [2025-03-17 11:55:28,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:28,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173747123] [2025-03-17 11:55:28,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:28,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:55:28,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:55:28,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:28,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:28,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173747123] [2025-03-17 11:55:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173747123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:28,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:28,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646934620] [2025-03-17 11:55:28,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:28,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:28,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:28,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:28,340 INFO L87 Difference]: Start difference. First operand 364 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-17 11:55:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:28,364 INFO L93 Difference]: Finished difference Result 374 states and 535 transitions. [2025-03-17 11:55:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 16 [2025-03-17 11:55:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:28,366 INFO L225 Difference]: With dead ends: 374 [2025-03-17 11:55:28,366 INFO L226 Difference]: Without dead ends: 374 [2025-03-17 11:55:28,366 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-17 11:55:28,366 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 876 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-17 11:55:28,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 876 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-17 11:55:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-03-17 11:55:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 291 states have (on average 1.7353951890034365) internal successors, (505), 359 states have internal predecessors, (505), 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-17 11:55:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 535 transitions. [2025-03-17 11:55:28,393 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 535 transitions. Word has length 16 [2025-03-17 11:55:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:28,394 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 535 transitions. [2025-03-17 11:55:28,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-17 11:55:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 535 transitions. [2025-03-17 11:55:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:55:28,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:28,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:28,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:55:28,395 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-17 11:55:28,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:28,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1188500254, now seen corresponding path program 1 times [2025-03-17 11:55:28,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:28,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735881938] [2025-03-17 11:55:28,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:28,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:55:28,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:55:28,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:28,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735881938] [2025-03-17 11:55:28,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735881938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:28,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:28,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:28,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038265413] [2025-03-17 11:55:28,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:28,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:55:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:28,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:55:28,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:28,591 INFO L87 Difference]: Start difference. First operand 374 states and 535 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-17 11:55:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:29,018 INFO L93 Difference]: Finished difference Result 505 states and 661 transitions. [2025-03-17 11:55:29,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:29,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-17 11:55:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:29,020 INFO L225 Difference]: With dead ends: 505 [2025-03-17 11:55:29,020 INFO L226 Difference]: Without dead ends: 505 [2025-03-17 11:55:29,020 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-17 11:55:29,020 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 237 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:29,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 679 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-17 11:55:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 371. [2025-03-17 11:55:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 288 states have (on average 1.7361111111111112) internal successors, (500), 356 states have internal predecessors, (500), 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-17 11:55:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 530 transitions. [2025-03-17 11:55:29,030 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 530 transitions. Word has length 17 [2025-03-17 11:55:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:29,030 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 530 transitions. [2025-03-17 11:55:29,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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-17 11:55:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 530 transitions. [2025-03-17 11:55:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:55:29,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:29,031 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] [2025-03-17 11:55:29,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:55:29,031 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-17 11:55:29,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash -443165029, now seen corresponding path program 1 times [2025-03-17 11:55:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182934970] [2025-03-17 11:55:29,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:29,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:29,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:29,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:29,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:29,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182934970] [2025-03-17 11:55:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182934970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:29,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:29,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757485425] [2025-03-17 11:55:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:29,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:29,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:29,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:29,178 INFO L87 Difference]: Start difference. First operand 371 states and 530 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-17 11:55:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:29,364 INFO L93 Difference]: Finished difference Result 505 states and 685 transitions. [2025-03-17 11:55:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:29,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 20 [2025-03-17 11:55:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:29,366 INFO L225 Difference]: With dead ends: 505 [2025-03-17 11:55:29,366 INFO L226 Difference]: Without dead ends: 505 [2025-03-17 11:55:29,366 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-17 11:55:29,366 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 144 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:29,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 997 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-17 11:55:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 389. [2025-03-17 11:55:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 306 states have (on average 1.7124183006535947) internal successors, (524), 372 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-17 11:55:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 554 transitions. [2025-03-17 11:55:29,374 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 554 transitions. Word has length 20 [2025-03-17 11:55:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:29,374 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 554 transitions. [2025-03-17 11:55:29,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-17 11:55:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 554 transitions. [2025-03-17 11:55:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:55:29,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:29,376 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] [2025-03-17 11:55:29,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:55:29,376 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-17 11:55:29,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1761883653, now seen corresponding path program 1 times [2025-03-17 11:55:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:29,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856900250] [2025-03-17 11:55:29,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:29,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:29,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:29,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:29,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856900250] [2025-03-17 11:55:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856900250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:29,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:29,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:29,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234348608] [2025-03-17 11:55:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:29,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:29,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:29,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:29,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:29,551 INFO L87 Difference]: Start difference. First operand 389 states and 554 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-17 11:55:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:29,820 INFO L93 Difference]: Finished difference Result 475 states and 644 transitions. [2025-03-17 11:55:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:29,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 20 [2025-03-17 11:55:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:29,822 INFO L225 Difference]: With dead ends: 475 [2025-03-17 11:55:29,822 INFO L226 Difference]: Without dead ends: 475 [2025-03-17 11:55:29,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:29,822 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 105 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1014 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:29,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1014 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-17 11:55:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 383. [2025-03-17 11:55:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 300 states have (on average 1.71) internal successors, (513), 366 states have internal predecessors, (513), 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-17 11:55:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 543 transitions. [2025-03-17 11:55:29,832 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 543 transitions. Word has length 20 [2025-03-17 11:55:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:29,833 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 543 transitions. [2025-03-17 11:55:29,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-17 11:55:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 543 transitions. [2025-03-17 11:55:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:55:29,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:29,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:29,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:55:29,834 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-17 11:55:29,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash -277609092, now seen corresponding path program 1 times [2025-03-17 11:55:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176970150] [2025-03-17 11:55:29,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:29,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:55:29,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:55:29,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:29,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:29,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:29,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176970150] [2025-03-17 11:55:29,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176970150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:29,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:29,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437620837] [2025-03-17 11:55:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:29,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:29,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:29,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:29,951 INFO L87 Difference]: Start difference. First operand 383 states and 543 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-17 11:55:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,180 INFO L93 Difference]: Finished difference Result 496 states and 672 transitions. [2025-03-17 11:55:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:30,180 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-17 11:55:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,182 INFO L225 Difference]: With dead ends: 496 [2025-03-17 11:55:30,182 INFO L226 Difference]: Without dead ends: 496 [2025-03-17 11:55:30,182 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-17 11:55:30,182 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 114 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:30,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1137 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-17 11:55:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 391. [2025-03-17 11:55:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 308 states have (on average 1.6915584415584415) internal successors, (521), 372 states have internal predecessors, (521), 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-17 11:55:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 551 transitions. [2025-03-17 11:55:30,192 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 551 transitions. Word has length 21 [2025-03-17 11:55:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:30,192 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 551 transitions. [2025-03-17 11:55:30,192 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-17 11:55:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 551 transitions. [2025-03-17 11:55:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:55:30,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:30,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:55:30,193 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-17 11:55:30,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1216206506, now seen corresponding path program 1 times [2025-03-17 11:55:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095425903] [2025-03-17 11:55:30,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:55:30,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:55:30,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:30,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095425903] [2025-03-17 11:55:30,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095425903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:30,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:30,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:30,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175838004] [2025-03-17 11:55:30,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:30,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:30,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:30,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:30,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:30,234 INFO L87 Difference]: Start difference. First operand 391 states and 551 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-17 11:55:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,373 INFO L93 Difference]: Finished difference Result 483 states and 629 transitions. [2025-03-17 11:55:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-17 11:55:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,375 INFO L225 Difference]: With dead ends: 483 [2025-03-17 11:55:30,376 INFO L226 Difference]: Without dead ends: 483 [2025-03-17 11:55:30,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:30,376 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 174 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:30,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 336 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-17 11:55:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 411. [2025-03-17 11:55:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 328 states have (on average 1.7103658536585367) internal successors, (561), 392 states have internal predecessors, (561), 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-17 11:55:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 591 transitions. [2025-03-17 11:55:30,385 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 591 transitions. Word has length 21 [2025-03-17 11:55:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:30,385 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 591 transitions. [2025-03-17 11:55:30,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-17 11:55:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 591 transitions. [2025-03-17 11:55:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:55:30,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:30,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:55:30,387 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-17 11:55:30,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1216206507, now seen corresponding path program 1 times [2025-03-17 11:55:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799900873] [2025-03-17 11:55:30,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:55:30,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:55:30,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:30,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799900873] [2025-03-17 11:55:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799900873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:30,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:30,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:55:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943847886] [2025-03-17 11:55:30,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:30,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:30,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:30,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:30,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:30,513 INFO L87 Difference]: Start difference. First operand 411 states and 591 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) 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-17 11:55:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,637 INFO L93 Difference]: Finished difference Result 332 states and 442 transitions. [2025-03-17 11:55:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:30,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) 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-17 11:55:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,638 INFO L225 Difference]: With dead ends: 332 [2025-03-17 11:55:30,638 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 11:55:30,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:30,639 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 56 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 914 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-17 11:55:30,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 914 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 11:55:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 302. [2025-03-17 11:55:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 227 states have (on average 1.7048458149779735) internal successors, (387), 289 states have internal predecessors, (387), 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-17 11:55:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 405 transitions. [2025-03-17 11:55:30,644 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 405 transitions. Word has length 21 [2025-03-17 11:55:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 405 transitions. [2025-03-17 11:55:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) 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-17 11:55:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 405 transitions. [2025-03-17 11:55:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:55:30,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:30,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:55:30,646 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-17 11:55:30,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash 262180173, now seen corresponding path program 1 times [2025-03-17 11:55:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235187781] [2025-03-17 11:55:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:55:30,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:55:30,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:30,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:30,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235187781] [2025-03-17 11:55:30,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235187781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:30,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934691914] [2025-03-17 11:55:30,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:30,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:30,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:30,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:30,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:30,685 INFO L87 Difference]: Start difference. First operand 302 states and 405 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-17 11:55:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,698 INFO L93 Difference]: Finished difference Result 311 states and 414 transitions. [2025-03-17 11:55:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:30,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 24 [2025-03-17 11:55:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,700 INFO L225 Difference]: With dead ends: 311 [2025-03-17 11:55:30,700 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 11:55:30,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:30,700 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 1 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 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-17 11:55:30,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 11:55:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2025-03-17 11:55:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 236 states have (on average 1.6779661016949152) internal successors, (396), 298 states have internal predecessors, (396), 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-17 11:55:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 414 transitions. [2025-03-17 11:55:30,705 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 414 transitions. Word has length 24 [2025-03-17 11:55:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:30,706 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 414 transitions. [2025-03-17 11:55:30,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-17 11:55:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 414 transitions. [2025-03-17 11:55:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:55:30,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:30,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:55:30,706 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-17 11:55:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash 263129491, now seen corresponding path program 1 times [2025-03-17 11:55:30,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032952901] [2025-03-17 11:55:30,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:55:30,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:55:30,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:30,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032952901] [2025-03-17 11:55:30,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032952901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:30,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:30,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:30,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110928664] [2025-03-17 11:55:30,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:30,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:30,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:30,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:30,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:30,731 INFO L87 Difference]: Start difference. First operand 311 states and 414 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-17 11:55:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,791 INFO L93 Difference]: Finished difference Result 308 states and 405 transitions. [2025-03-17 11:55:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 24 [2025-03-17 11:55:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,792 INFO L225 Difference]: With dead ends: 308 [2025-03-17 11:55:30,792 INFO L226 Difference]: Without dead ends: 308 [2025-03-17 11:55:30,792 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-17 11:55:30,793 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 28 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:30,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 235 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-17 11:55:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-17 11:55:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 236 states have (on average 1.6398305084745763) internal successors, (387), 295 states have internal predecessors, (387), 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-17 11:55:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 405 transitions. [2025-03-17 11:55:30,798 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 405 transitions. Word has length 24 [2025-03-17 11:55:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:30,799 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 405 transitions. [2025-03-17 11:55:30,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-17 11:55:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 405 transitions. [2025-03-17 11:55:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:55:30,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:30,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:55:30,799 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-17 11:55:30,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash 263129492, now seen corresponding path program 1 times [2025-03-17 11:55:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341686373] [2025-03-17 11:55:30,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:55:30,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:55:30,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:30,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:30,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341686373] [2025-03-17 11:55:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341686373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:30,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:30,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550018331] [2025-03-17 11:55:30,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:30,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:30,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:30,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:30,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:30,848 INFO L87 Difference]: Start difference. First operand 308 states and 405 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-17 11:55:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,917 INFO L93 Difference]: Finished difference Result 369 states and 483 transitions. [2025-03-17 11:55:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:30,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 24 [2025-03-17 11:55:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,919 INFO L225 Difference]: With dead ends: 369 [2025-03-17 11:55:30,919 INFO L226 Difference]: Without dead ends: 369 [2025-03-17 11:55:30,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:30,919 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 67 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 260 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-17 11:55:30,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 260 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-17 11:55:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2025-03-17 11:55:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 292 states have (on average 1.5924657534246576) internal successors, (465), 350 states have internal predecessors, (465), 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-17 11:55:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 483 transitions. [2025-03-17 11:55:30,925 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 483 transitions. Word has length 24 [2025-03-17 11:55:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:30,926 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 483 transitions. [2025-03-17 11:55:30,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-17 11:55:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 483 transitions. [2025-03-17 11:55:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:30,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:30,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:55:30,930 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-17 11:55:30,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash -896074282, now seen corresponding path program 1 times [2025-03-17 11:55:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634295418] [2025-03-17 11:55:30,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:30,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:30,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634295418] [2025-03-17 11:55:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634295418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:30,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:30,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:30,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618492951] [2025-03-17 11:55:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:30,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:30,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:30,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:30,970 INFO L87 Difference]: Start difference. First operand 363 states and 483 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-17 11:55:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,989 INFO L93 Difference]: Finished difference Result 408 states and 535 transitions. [2025-03-17 11:55:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-17 11:55:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,991 INFO L225 Difference]: With dead ends: 408 [2025-03-17 11:55:30,991 INFO L226 Difference]: Without dead ends: 408 [2025-03-17 11:55:30,991 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-17 11:55:30,992 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 45 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 830 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-17 11:55:30,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 830 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-17 11:55:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 363. [2025-03-17 11:55:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 292 states have (on average 1.582191780821918) internal successors, (462), 350 states have internal predecessors, (462), 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-17 11:55:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 480 transitions. [2025-03-17 11:55:31,001 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 480 transitions. Word has length 25 [2025-03-17 11:55:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,001 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 480 transitions. [2025-03-17 11:55:31,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-17 11:55:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 480 transitions. [2025-03-17 11:55:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:31,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:55:31,002 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-17 11:55:31,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1893146635, now seen corresponding path program 1 times [2025-03-17 11:55:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968589187] [2025-03-17 11:55:31,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:31,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:31,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968589187] [2025-03-17 11:55:31,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968589187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:31,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126014367] [2025-03-17 11:55:31,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:31,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:31,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:31,057 INFO L87 Difference]: Start difference. First operand 363 states and 480 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-17 11:55:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,146 INFO L93 Difference]: Finished difference Result 425 states and 561 transitions. [2025-03-17 11:55:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:31,147 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-17 11:55:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,148 INFO L225 Difference]: With dead ends: 425 [2025-03-17 11:55:31,148 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 11:55:31,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:31,149 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 50 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 363 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-17 11:55:31,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 363 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 11:55:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 363. [2025-03-17 11:55:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 292 states have (on average 1.582191780821918) internal successors, (462), 350 states have internal predecessors, (462), 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-17 11:55:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 480 transitions. [2025-03-17 11:55:31,155 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 480 transitions. Word has length 25 [2025-03-17 11:55:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,155 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 480 transitions. [2025-03-17 11:55:31,155 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-17 11:55:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 480 transitions. [2025-03-17 11:55:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:31,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:31,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:55:31,162 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-17 11:55:31,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,162 INFO L85 PathProgramCache]: Analyzing trace with hash 604869302, now seen corresponding path program 1 times [2025-03-17 11:55:31,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312301195] [2025-03-17 11:55:31,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:31,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:31,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312301195] [2025-03-17 11:55:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312301195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302944960] [2025-03-17 11:55:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:31,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:31,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:31,207 INFO L87 Difference]: Start difference. First operand 363 states and 480 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-17 11:55:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,223 INFO L93 Difference]: Finished difference Result 306 states and 393 transitions. [2025-03-17 11:55:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:31,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-17 11:55:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,225 INFO L225 Difference]: With dead ends: 306 [2025-03-17 11:55:31,225 INFO L226 Difference]: Without dead ends: 306 [2025-03-17 11:55:31,225 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-17 11:55:31,225 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 840 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-17 11:55:31,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-17 11:55:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-17 11:55:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 236 states have (on average 1.5889830508474576) internal successors, (375), 293 states have internal predecessors, (375), 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-17 11:55:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 393 transitions. [2025-03-17 11:55:31,230 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 393 transitions. Word has length 25 [2025-03-17 11:55:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,230 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 393 transitions. [2025-03-17 11:55:31,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-17 11:55:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 393 transitions. [2025-03-17 11:55:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:55:31,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,231 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-17 11:55:31,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:55:31,231 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-17 11:55:31,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash -535626227, now seen corresponding path program 1 times [2025-03-17 11:55:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583718908] [2025-03-17 11:55:31,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:55:31,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:55:31,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,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-17 11:55:31,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583718908] [2025-03-17 11:55:31,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583718908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:31,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34357372] [2025-03-17 11:55:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:31,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:31,289 INFO L87 Difference]: Start difference. First operand 306 states and 393 transitions. Second operand has 5 states, 4 states have (on average 6.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-17 11:55:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,329 INFO L93 Difference]: Finished difference Result 390 states and 504 transitions. [2025-03-17 11:55:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:31,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-17 11:55:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,331 INFO L225 Difference]: With dead ends: 390 [2025-03-17 11:55:31,331 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 11:55:31,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:31,331 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 66 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:31,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 454 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 11:55:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 374. [2025-03-17 11:55:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 304 states have (on average 1.569078947368421) internal successors, (477), 361 states have internal predecessors, (477), 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-17 11:55:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 495 transitions. [2025-03-17 11:55:31,341 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 495 transitions. Word has length 26 [2025-03-17 11:55:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,342 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 495 transitions. [2025-03-17 11:55:31,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-17 11:55:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 495 transitions. [2025-03-17 11:55:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:55:31,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,342 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-17 11:55:31,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:55:31,343 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-17 11:55:31,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash -535626193, now seen corresponding path program 1 times [2025-03-17 11:55:31,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891618387] [2025-03-17 11:55:31,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:55:31,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:55:31,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891618387] [2025-03-17 11:55:31,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891618387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:55:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811101273] [2025-03-17 11:55:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:31,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:31,414 INFO L87 Difference]: Start difference. First operand 374 states and 495 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-17 11:55:31,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,513 INFO L93 Difference]: Finished difference Result 430 states and 559 transitions. [2025-03-17 11:55:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:31,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-17 11:55:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,515 INFO L225 Difference]: With dead ends: 430 [2025-03-17 11:55:31,515 INFO L226 Difference]: Without dead ends: 430 [2025-03-17 11:55:31,515 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-17 11:55:31,516 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 16 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 714 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-17 11:55:31,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 714 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-17 11:55:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 422. [2025-03-17 11:55:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 352 states have (on average 1.5113636363636365) internal successors, (532), 409 states have internal predecessors, (532), 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-17 11:55:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 550 transitions. [2025-03-17 11:55:31,522 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 550 transitions. Word has length 26 [2025-03-17 11:55:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,522 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 550 transitions. [2025-03-17 11:55:31,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-17 11:55:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 550 transitions. [2025-03-17 11:55:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:55:31,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,522 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-17 11:55:31,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:55:31,523 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-17 11:55:31,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1752219694, now seen corresponding path program 1 times [2025-03-17 11:55:31,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134299554] [2025-03-17 11:55:31,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:55:31,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:55:31,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134299554] [2025-03-17 11:55:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134299554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974142392] [2025-03-17 11:55:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:31,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:31,584 INFO L87 Difference]: Start difference. First operand 422 states and 550 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-17 11:55:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,659 INFO L93 Difference]: Finished difference Result 447 states and 562 transitions. [2025-03-17 11:55:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-17 11:55:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,660 INFO L225 Difference]: With dead ends: 447 [2025-03-17 11:55:31,660 INFO L226 Difference]: Without dead ends: 447 [2025-03-17 11:55:31,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:31,660 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 57 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:31,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 279 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-17 11:55:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 335. [2025-03-17 11:55:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 266 states have (on average 1.518796992481203) internal successors, (404), 322 states have internal predecessors, (404), 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-17 11:55:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 422 transitions. [2025-03-17 11:55:31,667 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 422 transitions. Word has length 27 [2025-03-17 11:55:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,667 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 422 transitions. [2025-03-17 11:55:31,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-17 11:55:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 422 transitions. [2025-03-17 11:55:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:55:31,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:31,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:55:31,669 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-17 11:55:31,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2019074987, now seen corresponding path program 1 times [2025-03-17 11:55:31,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169870035] [2025-03-17 11:55:31,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:55:31,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:55:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169870035] [2025-03-17 11:55:31,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169870035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:31,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596532440] [2025-03-17 11:55:31,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:31,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:31,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:31,722 INFO L87 Difference]: Start difference. First operand 335 states and 422 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-17 11:55:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,819 INFO L93 Difference]: Finished difference Result 336 states and 422 transitions. [2025-03-17 11:55:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 33 [2025-03-17 11:55:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,820 INFO L225 Difference]: With dead ends: 336 [2025-03-17 11:55:31,820 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 11:55:31,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:31,821 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 52 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:31,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 418 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 11:55:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2025-03-17 11:55:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 266 states have (on average 1.5112781954887218) internal successors, (402), 321 states have internal predecessors, (402), 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-17 11:55:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 420 transitions. [2025-03-17 11:55:31,826 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 420 transitions. Word has length 33 [2025-03-17 11:55:31,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,827 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 420 transitions. [2025-03-17 11:55:31,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-17 11:55:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 420 transitions. [2025-03-17 11:55:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:55:31,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:31,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:55:31,828 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-17 11:55:31,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2019074988, now seen corresponding path program 1 times [2025-03-17 11:55:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123873065] [2025-03-17 11:55:31,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:55:31,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:55:31,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123873065] [2025-03-17 11:55:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123873065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:31,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051938920] [2025-03-17 11:55:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:31,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:31,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:31,937 INFO L87 Difference]: Start difference. First operand 334 states and 420 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-17 11:55:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:32,032 INFO L93 Difference]: Finished difference Result 335 states and 420 transitions. [2025-03-17 11:55:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:32,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 33 [2025-03-17 11:55:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:32,033 INFO L225 Difference]: With dead ends: 335 [2025-03-17 11:55:32,033 INFO L226 Difference]: Without dead ends: 335 [2025-03-17 11:55:32,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:32,034 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 40 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:32,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 436 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-17 11:55:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2025-03-17 11:55:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 266 states have (on average 1.5037593984962405) internal successors, (400), 320 states have internal predecessors, (400), 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-17 11:55:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 418 transitions. [2025-03-17 11:55:32,042 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 418 transitions. Word has length 33 [2025-03-17 11:55:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:32,042 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 418 transitions. [2025-03-17 11:55:32,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-17 11:55:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 418 transitions. [2025-03-17 11:55:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:55:32,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:32,042 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-17 11:55:32,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:55:32,043 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-17 11:55:32,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash -994152728, now seen corresponding path program 1 times [2025-03-17 11:55:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:32,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27864925] [2025-03-17 11:55:32,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:32,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:55:32,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:55:32,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:32,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:32,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:32,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27864925] [2025-03-17 11:55:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27864925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:32,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:32,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797447800] [2025-03-17 11:55:32,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:32,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:32,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:32,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:32,109 INFO L87 Difference]: Start difference. First operand 333 states and 418 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-17 11:55:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:32,186 INFO L93 Difference]: Finished difference Result 376 states and 468 transitions. [2025-03-17 11:55:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-17 11:55:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:32,188 INFO L225 Difference]: With dead ends: 376 [2025-03-17 11:55:32,188 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 11:55:32,188 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-17 11:55:32,188 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 100 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:32,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 340 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 11:55:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 330. [2025-03-17 11:55:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 266 states have (on average 1.481203007518797) internal successors, (394), 317 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-17 11:55:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 412 transitions. [2025-03-17 11:55:32,193 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 412 transitions. Word has length 35 [2025-03-17 11:55:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:32,193 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 412 transitions. [2025-03-17 11:55:32,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-17 11:55:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 412 transitions. [2025-03-17 11:55:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:55:32,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:32,194 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-17 11:55:32,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:55:32,194 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-17 11:55:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash -994152727, now seen corresponding path program 1 times [2025-03-17 11:55:32,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:32,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133226068] [2025-03-17 11:55:32,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:32,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:55:32,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:55:32,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:32,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:32,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:32,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133226068] [2025-03-17 11:55:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133226068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:32,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:32,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727511993] [2025-03-17 11:55:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:32,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:32,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:32,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:32,300 INFO L87 Difference]: Start difference. First operand 330 states and 412 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-17 11:55:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:32,439 INFO L93 Difference]: Finished difference Result 375 states and 466 transitions. [2025-03-17 11:55:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:32,439 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-17 11:55:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:32,440 INFO L225 Difference]: With dead ends: 375 [2025-03-17 11:55:32,440 INFO L226 Difference]: Without dead ends: 375 [2025-03-17 11:55:32,440 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-17 11:55:32,441 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 291 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:32,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 421 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-17 11:55:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 329. [2025-03-17 11:55:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 266 states have (on average 1.4736842105263157) internal successors, (392), 316 states have internal predecessors, (392), 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-17 11:55:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 410 transitions. [2025-03-17 11:55:32,447 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 410 transitions. Word has length 35 [2025-03-17 11:55:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:32,447 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 410 transitions. [2025-03-17 11:55:32,447 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-17 11:55:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 410 transitions. [2025-03-17 11:55:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:55:32,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:32,447 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-17 11:55:32,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:55:32,448 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-17 11:55:32,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -994152699, now seen corresponding path program 1 times [2025-03-17 11:55:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253834827] [2025-03-17 11:55:32,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:32,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:55:32,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:55:32,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:32,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:32,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253834827] [2025-03-17 11:55:32,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253834827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:32,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:32,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655900303] [2025-03-17 11:55:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:32,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:32,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:32,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:32,587 INFO L87 Difference]: Start difference. First operand 329 states and 410 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-17 11:55:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:32,795 INFO L93 Difference]: Finished difference Result 382 states and 435 transitions. [2025-03-17 11:55:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-17 11:55:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:32,797 INFO L225 Difference]: With dead ends: 382 [2025-03-17 11:55:32,797 INFO L226 Difference]: Without dead ends: 382 [2025-03-17 11:55:32,797 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-17 11:55:32,797 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 167 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:32,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 366 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-17 11:55:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 329. [2025-03-17 11:55:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 266 states have (on average 1.4661654135338347) internal successors, (390), 316 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-17 11:55:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 408 transitions. [2025-03-17 11:55:32,803 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 408 transitions. Word has length 35 [2025-03-17 11:55:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:32,803 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 408 transitions. [2025-03-17 11:55:32,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-17 11:55:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 408 transitions. [2025-03-17 11:55:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 11:55:32,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:32,804 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] [2025-03-17 11:55:32,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:55:32,804 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-17 11:55:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1488220956, now seen corresponding path program 1 times [2025-03-17 11:55:32,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:32,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817612621] [2025-03-17 11:55:32,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:32,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:32,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:55:32,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:55:32,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:32,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:32,921 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-17 11:55:32,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:32,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817612621] [2025-03-17 11:55:32,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817612621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:32,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:32,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39429655] [2025-03-17 11:55:32,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:32,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:32,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:32,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:32,923 INFO L87 Difference]: Start difference. First operand 329 states and 408 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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-17 11:55:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:33,024 INFO L93 Difference]: Finished difference Result 333 states and 412 transitions. [2025-03-17 11:55:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:33,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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 46 [2025-03-17 11:55:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:33,025 INFO L225 Difference]: With dead ends: 333 [2025-03-17 11:55:33,025 INFO L226 Difference]: Without dead ends: 333 [2025-03-17 11:55:33,026 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-17 11:55:33,026 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 251 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:33,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 283 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-17 11:55:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2025-03-17 11:55:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 268 states have (on average 1.462686567164179) internal successors, (392), 317 states have internal predecessors, (392), 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-17 11:55:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 410 transitions. [2025-03-17 11:55:33,031 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 410 transitions. Word has length 46 [2025-03-17 11:55:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:33,031 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 410 transitions. [2025-03-17 11:55:33,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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-17 11:55:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 410 transitions. [2025-03-17 11:55:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 11:55:33,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:33,032 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] [2025-03-17 11:55:33,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:55:33,032 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-17 11:55:33,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1488220987, now seen corresponding path program 1 times [2025-03-17 11:55:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:33,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010100072] [2025-03-17 11:55:33,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:33,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:55:33,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:55:33,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:33,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:33,143 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-17 11:55:33,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:33,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010100072] [2025-03-17 11:55:33,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010100072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:33,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:33,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:33,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789938798] [2025-03-17 11:55:33,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:33,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:33,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:33,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:33,145 INFO L87 Difference]: Start difference. First operand 330 states and 410 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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-17 11:55:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:33,244 INFO L93 Difference]: Finished difference Result 332 states and 410 transitions. [2025-03-17 11:55:33,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:33,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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 46 [2025-03-17 11:55:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:33,245 INFO L225 Difference]: With dead ends: 332 [2025-03-17 11:55:33,245 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 11:55:33,245 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-17 11:55:33,245 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 128 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:33,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 283 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 11:55:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 327. [2025-03-17 11:55:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 266 states have (on average 1.4548872180451127) internal successors, (387), 314 states have internal predecessors, (387), 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-17 11:55:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 405 transitions. [2025-03-17 11:55:33,250 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 405 transitions. Word has length 46 [2025-03-17 11:55:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:33,250 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 405 transitions. [2025-03-17 11:55:33,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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-17 11:55:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 405 transitions. [2025-03-17 11:55:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 11:55:33,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:33,251 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] [2025-03-17 11:55:33,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:55:33,251 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-17 11:55:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash 739445600, now seen corresponding path program 1 times [2025-03-17 11:55:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257651011] [2025-03-17 11:55:33,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:33,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:55:33,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:55:33,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:33,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:33,387 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-17 11:55:33,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:33,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257651011] [2025-03-17 11:55:33,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257651011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:33,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441095049] [2025-03-17 11:55:33,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:33,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:33,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:33,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:33,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:33,389 INFO L87 Difference]: Start difference. First operand 327 states and 405 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-17 11:55:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:33,498 INFO L93 Difference]: Finished difference Result 328 states and 404 transitions. [2025-03-17 11:55:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:33,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 48 [2025-03-17 11:55:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:33,499 INFO L225 Difference]: With dead ends: 328 [2025-03-17 11:55:33,499 INFO L226 Difference]: Without dead ends: 328 [2025-03-17 11:55:33,500 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-17 11:55:33,500 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 135 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 316 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-17 11:55:33,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-17 11:55:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2025-03-17 11:55:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 266 states have (on average 1.4398496240601504) internal successors, (383), 312 states have internal predecessors, (383), 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-17 11:55:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 401 transitions. [2025-03-17 11:55:33,505 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 401 transitions. Word has length 48 [2025-03-17 11:55:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:33,506 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 401 transitions. [2025-03-17 11:55:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-17 11:55:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 401 transitions. [2025-03-17 11:55:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:33,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:33,506 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] [2025-03-17 11:55:33,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:55:33,507 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1356938153, now seen corresponding path program 1 times [2025-03-17 11:55:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47228623] [2025-03-17 11:55:33,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:33,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:33,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:33,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:33,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:34,153 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-17 11:55:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:34,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47228623] [2025-03-17 11:55:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47228623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:34,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:34,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:55:34,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244747297] [2025-03-17 11:55:34,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:34,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:34,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:34,154 INFO L87 Difference]: Start difference. First operand 325 states and 401 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-17 11:55:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:34,510 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2025-03-17 11:55:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:34,510 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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 49 [2025-03-17 11:55:34,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:34,511 INFO L225 Difference]: With dead ends: 355 [2025-03-17 11:55:34,511 INFO L226 Difference]: Without dead ends: 355 [2025-03-17 11:55:34,511 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-17 11:55:34,511 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 77 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:34,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 822 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-17 11:55:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 348. [2025-03-17 11:55:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 289 states have (on average 1.4083044982698962) internal successors, (407), 335 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-17 11:55:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 425 transitions. [2025-03-17 11:55:34,516 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 425 transitions. Word has length 49 [2025-03-17 11:55:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:34,517 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 425 transitions. [2025-03-17 11:55:34,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-17 11:55:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 425 transitions. [2025-03-17 11:55:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:55:34,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:34,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:34,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:55:34,518 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:34,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1872547995, now seen corresponding path program 1 times [2025-03-17 11:55:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:34,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529308293] [2025-03-17 11:55:34,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:34,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:55:34,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:55:34,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:34,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,145 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-17 11:55:35,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529308293] [2025-03-17 11:55:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529308293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:55:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550872112] [2025-03-17 11:55:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:55:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:55:35,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:55:35,147 INFO L87 Difference]: Start difference. First operand 348 states and 425 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 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-17 11:55:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,779 INFO L93 Difference]: Finished difference Result 709 states and 880 transitions. [2025-03-17 11:55:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:55:35,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 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 50 [2025-03-17 11:55:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,781 INFO L225 Difference]: With dead ends: 709 [2025-03-17 11:55:35,781 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 11:55:35,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:55:35,781 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 476 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1192 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:55:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 11:55:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 513. [2025-03-17 11:55:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 446 states have (on average 1.4304932735426008) internal successors, (638), 496 states have internal predecessors, (638), 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-17 11:55:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 668 transitions. [2025-03-17 11:55:35,788 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 668 transitions. Word has length 50 [2025-03-17 11:55:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,788 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 668 transitions. [2025-03-17 11:55:35,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 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-17 11:55:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 668 transitions. [2025-03-17 11:55:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:55:35,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,789 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] [2025-03-17 11:55:35,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:55:35,789 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:35,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1872547994, now seen corresponding path program 1 times [2025-03-17 11:55:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826809102] [2025-03-17 11:55:35,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:55:35,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:55:35,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,235 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-17 11:55:36,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826809102] [2025-03-17 11:55:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826809102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:55:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814791263] [2025-03-17 11:55:36,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:55:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:55:36,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:36,237 INFO L87 Difference]: Start difference. First operand 513 states and 668 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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-17 11:55:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,635 INFO L93 Difference]: Finished difference Result 746 states and 945 transitions. [2025-03-17 11:55:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:36,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 50 [2025-03-17 11:55:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,637 INFO L225 Difference]: With dead ends: 746 [2025-03-17 11:55:36,637 INFO L226 Difference]: Without dead ends: 746 [2025-03-17 11:55:36,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:55:36,638 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 411 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1097 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-17 11:55:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 541. [2025-03-17 11:55:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 471 states have (on average 1.4288747346072186) internal successors, (673), 522 states have internal predecessors, (673), 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-17 11:55:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 709 transitions. [2025-03-17 11:55:36,653 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 709 transitions. Word has length 50 [2025-03-17 11:55:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,653 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 709 transitions. [2025-03-17 11:55:36,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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-17 11:55:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 709 transitions. [2025-03-17 11:55:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:55:36,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,653 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] [2025-03-17 11:55:36,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:55:36,654 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-17 11:55:36,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1872547643, now seen corresponding path program 1 times [2025-03-17 11:55:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685236429] [2025-03-17 11:55:36,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:55:36,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:55:36,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:37,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-17 11:55:37,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:37,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685236429] [2025-03-17 11:55:37,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685236429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:37,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:37,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:55:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178939731] [2025-03-17 11:55:37,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:37,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:55:37,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:37,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:55:37,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:37,128 INFO L87 Difference]: Start difference. First operand 541 states and 709 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-17 11:55:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:37,616 INFO L93 Difference]: Finished difference Result 608 states and 749 transitions. [2025-03-17 11:55:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 50 [2025-03-17 11:55:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:37,618 INFO L225 Difference]: With dead ends: 608 [2025-03-17 11:55:37,618 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 11:55:37,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:55:37,619 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 250 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:37,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 991 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 11:55:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 543. [2025-03-17 11:55:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 473 states have (on average 1.4249471458773784) internal successors, (674), 524 states have internal predecessors, (674), 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-17 11:55:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 710 transitions. [2025-03-17 11:55:37,631 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 710 transitions. Word has length 50 [2025-03-17 11:55:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:37,631 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 710 transitions. [2025-03-17 11:55:37,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-17 11:55:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 710 transitions. [2025-03-17 11:55:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:55:37,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:37,633 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] [2025-03-17 11:55:37,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 11:55:37,633 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1197855466, now seen corresponding path program 1 times [2025-03-17 11:55:37,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:37,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200201313] [2025-03-17 11:55:37,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:37,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:37,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:55:37,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:55:37,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:37,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:38,242 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-17 11:55:38,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:38,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200201313] [2025-03-17 11:55:38,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200201313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 11:55:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045802349] [2025-03-17 11:55:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:38,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:55:38,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:38,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:55:38,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:55:38,245 INFO L87 Difference]: Start difference. First operand 543 states and 710 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 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-17 11:55:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:38,823 INFO L93 Difference]: Finished difference Result 610 states and 753 transitions. [2025-03-17 11:55:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 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 50 [2025-03-17 11:55:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:38,824 INFO L225 Difference]: With dead ends: 610 [2025-03-17 11:55:38,824 INFO L226 Difference]: Without dead ends: 610 [2025-03-17 11:55:38,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:55:38,825 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 205 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:38,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1296 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-17 11:55:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 531. [2025-03-17 11:55:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 461 states have (on average 1.4360086767895879) internal successors, (662), 512 states have internal predecessors, (662), 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-17 11:55:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 698 transitions. [2025-03-17 11:55:38,833 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 698 transitions. Word has length 50 [2025-03-17 11:55:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:38,833 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 698 transitions. [2025-03-17 11:55:38,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 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-17 11:55:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 698 transitions. [2025-03-17 11:55:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:38,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:38,834 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-17 11:55:38,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 11:55:38,834 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:38,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash 383609213, now seen corresponding path program 1 times [2025-03-17 11:55:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:38,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40547196] [2025-03-17 11:55:38,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:38,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:38,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:38,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:39,751 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-17 11:55:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:39,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40547196] [2025-03-17 11:55:39,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40547196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:39,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67765440] [2025-03-17 11:55:39,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:39,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:39,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:39,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:55:39,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:39,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:39,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:39,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:39,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 11:55:39,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:39,949 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-17 11:55:40,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:40,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:40,332 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-17 11:55:40,336 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 22 [2025-03-17 11:55:40,637 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:40,639 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 15 treesize of output 7 [2025-03-17 11:55:40,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:55:40,646 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:40,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-17 11:55:40,659 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-17 11:55:40,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:40,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67765440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:40,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:40,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2025-03-17 11:55:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801238250] [2025-03-17 11:55:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:40,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:40,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:40,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:55:40,663 INFO L87 Difference]: Start difference. First operand 531 states and 698 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:41,213 INFO L93 Difference]: Finished difference Result 794 states and 1032 transitions. [2025-03-17 11:55:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:55:41,214 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:41,216 INFO L225 Difference]: With dead ends: 794 [2025-03-17 11:55:41,216 INFO L226 Difference]: Without dead ends: 794 [2025-03-17 11:55:41,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:55:41,216 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 377 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:41,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1059 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 626 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-03-17 11:55:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 565. [2025-03-17 11:55:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 491 states have (on average 1.429735234215886) internal successors, (702), 544 states have internal predecessors, (702), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) [2025-03-17 11:55:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 744 transitions. [2025-03-17 11:55:41,230 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 744 transitions. Word has length 51 [2025-03-17 11:55:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:41,231 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 744 transitions. [2025-03-17 11:55:41,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 744 transitions. [2025-03-17 11:55:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:41,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:41,232 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-17 11:55:41,239 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-17 11:55:41,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:41,437 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-17 11:55:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:41,437 INFO L85 PathProgramCache]: Analyzing trace with hash 383609212, now seen corresponding path program 1 times [2025-03-17 11:55:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835578480] [2025-03-17 11:55:41,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:41,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:41,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:41,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:41,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:41,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:41,866 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-17 11:55:41,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:41,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835578480] [2025-03-17 11:55:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835578480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:41,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:41,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 11:55:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701803144] [2025-03-17 11:55:41,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:41,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 11:55:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:41,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 11:55:41,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:55:41,868 INFO L87 Difference]: Start difference. First operand 565 states and 744 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-17 11:55:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:42,382 INFO L93 Difference]: Finished difference Result 930 states and 1213 transitions. [2025-03-17 11:55:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:55:42,383 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-17 11:55:42,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:42,385 INFO L225 Difference]: With dead ends: 930 [2025-03-17 11:55:42,385 INFO L226 Difference]: Without dead ends: 930 [2025-03-17 11:55:42,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:55:42,385 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 399 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:42,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1488 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-17 11:55:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 644. [2025-03-17 11:55:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 562 states have (on average 1.414590747330961) internal successors, (795), 619 states have internal predecessors, (795), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 15 states have call predecessors, (36), 18 states have call successors, (36) [2025-03-17 11:55:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 849 transitions. [2025-03-17 11:55:42,393 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 849 transitions. Word has length 51 [2025-03-17 11:55:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:42,394 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 849 transitions. [2025-03-17 11:55:42,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-17 11:55:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 849 transitions. [2025-03-17 11:55:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:42,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:42,394 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-17 11:55:42,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 11:55:42,394 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:42,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash 383608861, now seen corresponding path program 1 times [2025-03-17 11:55:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123392145] [2025-03-17 11:55:42,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:42,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:42,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:42,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:42,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:42,778 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-17 11:55:42,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:42,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123392145] [2025-03-17 11:55:42,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123392145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:42,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:42,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 11:55:42,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708861039] [2025-03-17 11:55:42,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:55:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:42,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:55:42,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:55:42,781 INFO L87 Difference]: Start difference. First operand 644 states and 849 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-17 11:55:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:43,129 INFO L93 Difference]: Finished difference Result 942 states and 1233 transitions. [2025-03-17 11:55:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:55:43,129 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-17 11:55:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:43,132 INFO L225 Difference]: With dead ends: 942 [2025-03-17 11:55:43,132 INFO L226 Difference]: Without dead ends: 942 [2025-03-17 11:55:43,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:55:43,132 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 527 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:43,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1492 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-17 11:55:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 740. [2025-03-17 11:55:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 650 states have (on average 1.4538461538461538) internal successors, (945), 711 states have internal predecessors, (945), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-17 11:55:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1011 transitions. [2025-03-17 11:55:43,144 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1011 transitions. Word has length 51 [2025-03-17 11:55:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:43,144 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1011 transitions. [2025-03-17 11:55:43,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-17 11:55:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1011 transitions. [2025-03-17 11:55:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:43,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:43,145 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-17 11:55:43,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 11:55:43,145 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:43,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 384532734, now seen corresponding path program 1 times [2025-03-17 11:55:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135553765] [2025-03-17 11:55:43,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:43,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:43,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:43,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:43,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:43,439 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-17 11:55:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135553765] [2025-03-17 11:55:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135553765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363781898] [2025-03-17 11:55:43,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:43,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:43,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:43,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:43,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:55:43,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:43,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:43,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:43,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:43,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 11:55:43,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:43,582 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-17 11:55:43,870 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 13 treesize of output 9 [2025-03-17 11:55:43,873 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-17 11:55:44,036 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:44,037 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-17 11:55:44,039 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:44,040 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 19 treesize of output 7 [2025-03-17 11:55:44,083 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-17 11:55:44,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363781898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:44,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:44,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2025-03-17 11:55:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936672178] [2025-03-17 11:55:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:44,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:44,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:44,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:55:44,084 INFO L87 Difference]: Start difference. First operand 740 states and 1011 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:44,427 INFO L93 Difference]: Finished difference Result 1038 states and 1390 transitions. [2025-03-17 11:55:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:55:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:44,430 INFO L225 Difference]: With dead ends: 1038 [2025-03-17 11:55:44,431 INFO L226 Difference]: Without dead ends: 1038 [2025-03-17 11:55:44,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:55:44,431 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 277 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:44,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 920 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-03-17 11:55:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 839. [2025-03-17 11:55:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 737 states have (on average 1.4640434192673) internal successors, (1079), 804 states have internal predecessors, (1079), 28 states have call successors, (28), 14 states have call predecessors, (28), 28 states have return successors, (56), 20 states have call predecessors, (56), 28 states have call successors, (56) [2025-03-17 11:55:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1163 transitions. [2025-03-17 11:55:44,441 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1163 transitions. Word has length 51 [2025-03-17 11:55:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:44,441 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1163 transitions. [2025-03-17 11:55:44,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1163 transitions. [2025-03-17 11:55:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:44,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:44,442 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-17 11:55:44,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:44,642 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,SelfDestructingSolverStorable43 [2025-03-17 11:55:44,642 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-17 11:55:44,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:44,643 INFO L85 PathProgramCache]: Analyzing trace with hash 384532733, now seen corresponding path program 1 times [2025-03-17 11:55:44,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:44,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233717819] [2025-03-17 11:55:44,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:44,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:44,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:44,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:44,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:45,645 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-17 11:55:45,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233717819] [2025-03-17 11:55:45,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233717819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947243473] [2025-03-17 11:55:45,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:45,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:45,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:45,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:55:45,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:45,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:45,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:45,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:45,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 11:55:45,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:45,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:55:46,037 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-17 11:55:46,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:46,175 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-17 11:55:46,195 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-17 11:55:46,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947243473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:46,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 28 [2025-03-17 11:55:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841147877] [2025-03-17 11:55:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:46,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:46,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:46,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:55:46,196 INFO L87 Difference]: Start difference. First operand 839 states and 1163 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:46,586 INFO L93 Difference]: Finished difference Result 1073 states and 1462 transitions. [2025-03-17 11:55:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:46,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:46,589 INFO L225 Difference]: With dead ends: 1073 [2025-03-17 11:55:46,589 INFO L226 Difference]: Without dead ends: 1073 [2025-03-17 11:55:46,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 11:55:46,590 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 259 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:46,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1029 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-03-17 11:55:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 868. [2025-03-17 11:55:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 762 states have (on average 1.463254593175853) internal successors, (1115), 831 states have internal predecessors, (1115), 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-17 11:55:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1205 transitions. [2025-03-17 11:55:46,599 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1205 transitions. Word has length 51 [2025-03-17 11:55:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:46,599 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1205 transitions. [2025-03-17 11:55:46,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 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-17 11:55:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1205 transitions. [2025-03-17 11:55:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:46,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:46,600 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-17 11:55:46,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:55:46,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:46,801 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash 384532382, now seen corresponding path program 1 times [2025-03-17 11:55:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:46,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001533786] [2025-03-17 11:55:46,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:46,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:46,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:46,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:46,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:46,926 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-17 11:55:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001533786] [2025-03-17 11:55:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001533786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:46,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:55:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189527381] [2025-03-17 11:55:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:46,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:55:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:46,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:55:46,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:46,928 INFO L87 Difference]: Start difference. First operand 868 states and 1205 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-17 11:55:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:47,126 INFO L93 Difference]: Finished difference Result 1243 states and 1706 transitions. [2025-03-17 11:55:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:55:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-17 11:55:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:47,129 INFO L225 Difference]: With dead ends: 1243 [2025-03-17 11:55:47,130 INFO L226 Difference]: Without dead ends: 1243 [2025-03-17 11:55:47,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:47,130 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 159 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:47,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1221 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-03-17 11:55:47,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1034. [2025-03-17 11:55:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 908 states have (on average 1.4801762114537445) internal successors, (1344), 987 states have internal predecessors, (1344), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2025-03-17 11:55:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1464 transitions. [2025-03-17 11:55:47,141 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1464 transitions. Word has length 51 [2025-03-17 11:55:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:47,141 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1464 transitions. [2025-03-17 11:55:47,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-17 11:55:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1464 transitions. [2025-03-17 11:55:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:47,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:47,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] [2025-03-17 11:55:47,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-17 11:55:47,142 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:47,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:47,142 INFO L85 PathProgramCache]: Analyzing trace with hash 617100886, now seen corresponding path program 1 times [2025-03-17 11:55:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405348506] [2025-03-17 11:55:47,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:47,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:47,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:47,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:47,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:47,385 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-17 11:55:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405348506] [2025-03-17 11:55:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405348506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:47,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:47,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:55:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079097607] [2025-03-17 11:55:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:47,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:47,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:47,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:47,386 INFO L87 Difference]: Start difference. First operand 1034 states and 1464 transitions. Second operand has 11 states, 10 states have (on average 4.9) 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-17 11:55:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:47,649 INFO L93 Difference]: Finished difference Result 1317 states and 1820 transitions. [2025-03-17 11:55:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:55:47,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) 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-17 11:55:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:47,652 INFO L225 Difference]: With dead ends: 1317 [2025-03-17 11:55:47,652 INFO L226 Difference]: Without dead ends: 1317 [2025-03-17 11:55:47,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:55:47,652 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 409 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:47,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 947 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2025-03-17 11:55:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1004. [2025-03-17 11:55:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 882 states have (on average 1.481859410430839) internal successors, (1307), 959 states have internal predecessors, (1307), 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-17 11:55:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1421 transitions. [2025-03-17 11:55:47,663 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1421 transitions. Word has length 51 [2025-03-17 11:55:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:47,663 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1421 transitions. [2025-03-17 11:55:47,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) 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-17 11:55:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1421 transitions. [2025-03-17 11:55:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:47,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:47,663 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-17 11:55:47,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-17 11:55:47,664 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-17 11:55:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash 617100885, now seen corresponding path program 1 times [2025-03-17 11:55:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774241701] [2025-03-17 11:55:47,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:47,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:47,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:47,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:47,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:47,864 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-17 11:55:47,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:47,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774241701] [2025-03-17 11:55:47,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774241701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:47,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:47,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:55:47,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442462843] [2025-03-17 11:55:47,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:47,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:47,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:47,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:47,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:47,866 INFO L87 Difference]: Start difference. First operand 1004 states and 1421 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-17 11:55:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:48,169 INFO L93 Difference]: Finished difference Result 1321 states and 1855 transitions. [2025-03-17 11:55:48,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:48,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-17 11:55:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:48,173 INFO L225 Difference]: With dead ends: 1321 [2025-03-17 11:55:48,173 INFO L226 Difference]: Without dead ends: 1321 [2025-03-17 11:55:48,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:55:48,173 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 311 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:48,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 986 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-17 11:55:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1032. [2025-03-17 11:55:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 906 states have (on average 1.4812362030905077) internal successors, (1342), 985 states have internal predecessors, (1342), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2025-03-17 11:55:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1462 transitions. [2025-03-17 11:55:48,187 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1462 transitions. Word has length 51 [2025-03-17 11:55:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:48,187 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1462 transitions. [2025-03-17 11:55:48,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-17 11:55:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1462 transitions. [2025-03-17 11:55:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:48,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:48,188 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-17 11:55:48,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-17 11:55:48,188 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:48,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:48,189 INFO L85 PathProgramCache]: Analyzing trace with hash 617100534, now seen corresponding path program 1 times [2025-03-17 11:55:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:48,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883625964] [2025-03-17 11:55:48,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:48,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:48,604 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-17 11:55:48,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883625964] [2025-03-17 11:55:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883625964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 11:55:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992860548] [2025-03-17 11:55:48,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:48,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:55:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:48,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:55:48,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:55:48,607 INFO L87 Difference]: Start difference. First operand 1032 states and 1462 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-17 11:55:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:49,194 INFO L93 Difference]: Finished difference Result 1408 states and 1947 transitions. [2025-03-17 11:55:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:55:49,194 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-17 11:55:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:49,197 INFO L225 Difference]: With dead ends: 1408 [2025-03-17 11:55:49,197 INFO L226 Difference]: Without dead ends: 1408 [2025-03-17 11:55:49,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:55:49,198 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 302 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:49,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 3253 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-17 11:55:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1079. [2025-03-17 11:55:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 953 states have (on average 1.4805876180482687) internal successors, (1411), 1032 states have internal predecessors, (1411), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2025-03-17 11:55:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1531 transitions. [2025-03-17 11:55:49,209 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1531 transitions. Word has length 51 [2025-03-17 11:55:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:49,209 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1531 transitions. [2025-03-17 11:55:49,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-17 11:55:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1531 transitions. [2025-03-17 11:55:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:49,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:49,209 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-17 11:55:49,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-17 11:55:49,209 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:49,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash 618024407, now seen corresponding path program 1 times [2025-03-17 11:55:49,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:49,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007000965] [2025-03-17 11:55:49,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:49,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:49,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:49,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:49,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:49,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:49,570 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-17 11:55:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007000965] [2025-03-17 11:55:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007000965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500267740] [2025-03-17 11:55:49,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:49,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:49,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:49,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:49,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:55:49,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:49,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:49,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:49,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:49,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 11:55:49,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:49,757 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-17 11:55:49,995 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-17 11:55:49,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:50,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 11:55:50,050 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-17 11:55:50,164 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-17 11:55:50,175 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-17 11:55:50,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500267740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:50,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:50,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2025-03-17 11:55:50,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016664782] [2025-03-17 11:55:50,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:50,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:50,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:50,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:55:50,176 INFO L87 Difference]: Start difference. First operand 1079 states and 1531 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-17 11:55:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:50,814 INFO L93 Difference]: Finished difference Result 1484 states and 2066 transitions. [2025-03-17 11:55:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:55:50,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-17 11:55:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:50,821 INFO L225 Difference]: With dead ends: 1484 [2025-03-17 11:55:50,823 INFO L226 Difference]: Without dead ends: 1484 [2025-03-17 11:55:50,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:55:50,824 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 312 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:50,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1902 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:55:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-03-17 11:55:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1253. [2025-03-17 11:55:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1107 states have (on average 1.4932249322493225) internal successors, (1653), 1196 states have internal predecessors, (1653), 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-17 11:55:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1803 transitions. [2025-03-17 11:55:50,841 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1803 transitions. Word has length 51 [2025-03-17 11:55:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:50,841 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1803 transitions. [2025-03-17 11:55:50,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-17 11:55:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1803 transitions. [2025-03-17 11:55:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:50,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:50,842 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-17 11:55:50,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:51,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-17 11:55:51,044 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-17 11:55:51,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash 618024406, now seen corresponding path program 1 times [2025-03-17 11:55:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:51,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981211924] [2025-03-17 11:55:51,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:51,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:51,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:51,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:51,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:51,328 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-17 11:55:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:51,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981211924] [2025-03-17 11:55:51,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981211924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:51,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661948265] [2025-03-17 11:55:51,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:51,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:51,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:51,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:51,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:55:51,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:51,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:51,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:51,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:51,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 11:55:51,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:51,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:55:51,713 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-17 11:55:51,751 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-17 11:55:51,802 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-17 11:55:51,805 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-17 11:55:51,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661948265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2025-03-17 11:55:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244079240] [2025-03-17 11:55:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:51,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:51,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:51,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:55:51,806 INFO L87 Difference]: Start difference. First operand 1253 states and 1803 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-17 11:55:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:52,313 INFO L93 Difference]: Finished difference Result 1521 states and 2139 transitions. [2025-03-17 11:55:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:52,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-17 11:55:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:52,317 INFO L225 Difference]: With dead ends: 1521 [2025-03-17 11:55:52,317 INFO L226 Difference]: Without dead ends: 1521 [2025-03-17 11:55:52,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:55:52,317 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 276 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:52,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1996 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-03-17 11:55:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1277. [2025-03-17 11:55:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1127 states have (on average 1.4924578527063) internal successors, (1682), 1218 states have internal predecessors, (1682), 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-17 11:55:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1838 transitions. [2025-03-17 11:55:52,331 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1838 transitions. Word has length 51 [2025-03-17 11:55:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:52,331 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1838 transitions. [2025-03-17 11:55:52,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-17 11:55:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1838 transitions. [2025-03-17 11:55:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:52,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:52,333 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-17 11:55:52,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:52,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:52,534 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:52,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash 618024055, now seen corresponding path program 1 times [2025-03-17 11:55:52,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:52,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97904125] [2025-03-17 11:55:52,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:52,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:52,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:52,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:52,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:52,654 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-17 11:55:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97904125] [2025-03-17 11:55:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97904125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:52,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:52,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515367519] [2025-03-17 11:55:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:52,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:52,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:52,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:52,655 INFO L87 Difference]: Start difference. First operand 1277 states and 1838 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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-17 11:55:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:52,813 INFO L93 Difference]: Finished difference Result 1541 states and 2172 transitions. [2025-03-17 11:55:52,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:55:52,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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-17 11:55:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:52,815 INFO L225 Difference]: With dead ends: 1541 [2025-03-17 11:55:52,816 INFO L226 Difference]: Without dead ends: 1541 [2025-03-17 11:55:52,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:52,816 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 142 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:52,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1250 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-03-17 11:55:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1049. [2025-03-17 11:55:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 927 states have (on average 1.483279395900755) internal successors, (1375), 1004 states have internal predecessors, (1375), 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-17 11:55:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1489 transitions. [2025-03-17 11:55:52,827 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1489 transitions. Word has length 51 [2025-03-17 11:55:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1489 transitions. [2025-03-17 11:55:52,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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-17 11:55:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1489 transitions. [2025-03-17 11:55:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 11:55:52,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:52,828 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-17 11:55:52,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-17 11:55:52,828 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-17 11:55:52,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:52,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1356751588, now seen corresponding path program 1 times [2025-03-17 11:55:52,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:52,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275073950] [2025-03-17 11:55:52,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:52,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:55:52,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:55:52,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:52,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:52,999 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-17 11:55:52,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:52,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275073950] [2025-03-17 11:55:52,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275073950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:52,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:52,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252933085] [2025-03-17 11:55:52,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:53,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:53,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:53,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:53,000 INFO L87 Difference]: Start difference. First operand 1049 states and 1489 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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-17 11:55:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:53,109 INFO L93 Difference]: Finished difference Result 1059 states and 1490 transitions. [2025-03-17 11:55:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:53,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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-17 11:55:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:53,114 INFO L225 Difference]: With dead ends: 1059 [2025-03-17 11:55:53,114 INFO L226 Difference]: Without dead ends: 1059 [2025-03-17 11:55:53,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:53,114 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:53,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1186 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-03-17 11:55:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1049. [2025-03-17 11:55:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 927 states have (on average 1.4789644012944985) internal successors, (1371), 1004 states have internal predecessors, (1371), 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-17 11:55:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1485 transitions. [2025-03-17 11:55:53,122 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1485 transitions. Word has length 52 [2025-03-17 11:55:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:53,123 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1485 transitions. [2025-03-17 11:55:53,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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-17 11:55:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1485 transitions. [2025-03-17 11:55:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 11:55:53,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:53,123 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] [2025-03-17 11:55:53,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-17 11:55:53,124 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:53,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1115619070, now seen corresponding path program 1 times [2025-03-17 11:55:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:53,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112403850] [2025-03-17 11:55:53,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:55:53,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:55:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:53,201 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-17 11:55:53,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:53,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112403850] [2025-03-17 11:55:53,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112403850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:53,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:53,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684629207] [2025-03-17 11:55:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:53,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:53,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:53,203 INFO L87 Difference]: Start difference. First operand 1049 states and 1485 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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-17 11:55:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:53,236 INFO L93 Difference]: Finished difference Result 1061 states and 1485 transitions. [2025-03-17 11:55:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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 55 [2025-03-17 11:55:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:53,239 INFO L225 Difference]: With dead ends: 1061 [2025-03-17 11:55:53,239 INFO L226 Difference]: Without dead ends: 1061 [2025-03-17 11:55:53,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:53,239 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 150 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:53,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 515 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-17 11:55:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1048. [2025-03-17 11:55:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 927 states have (on average 1.464940668824164) internal successors, (1358), 1003 states have internal predecessors, (1358), 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-17 11:55:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1472 transitions. [2025-03-17 11:55:53,247 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1472 transitions. Word has length 55 [2025-03-17 11:55:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:53,247 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1472 transitions. [2025-03-17 11:55:53,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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-17 11:55:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1472 transitions. [2025-03-17 11:55:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 11:55:53,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:53,247 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-17 11:55:53,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-17 11:55:53,247 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:53,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash -805956911, now seen corresponding path program 1 times [2025-03-17 11:55:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:53,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420648782] [2025-03-17 11:55:53,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:53,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:53,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:55:53,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:55:53,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:53,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:53,545 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-17 11:55:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420648782] [2025-03-17 11:55:53,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420648782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819763372] [2025-03-17 11:55:53,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:53,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:53,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:53,547 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:53,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:55:53,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:55:53,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:55:53,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:53,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:53,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 11:55:53,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:53,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:53,912 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 22 [2025-03-17 11:55:54,040 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:54,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-17 11:55:54,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-17 11:55:54,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819763372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:54,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-03-17 11:55:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837532646] [2025-03-17 11:55:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:54,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:54,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:55:54,049 INFO L87 Difference]: Start difference. First operand 1048 states and 1472 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 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-17 11:55:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:54,307 INFO L93 Difference]: Finished difference Result 1374 states and 1892 transitions. [2025-03-17 11:55:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:54,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 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-17 11:55:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:54,309 INFO L225 Difference]: With dead ends: 1374 [2025-03-17 11:55:54,309 INFO L226 Difference]: Without dead ends: 1374 [2025-03-17 11:55:54,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:55:54,310 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 386 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:54,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 807 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-17 11:55:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1164. [2025-03-17 11:55:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1113 states have internal predecessors, (1514), 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-17 11:55:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1646 transitions. [2025-03-17 11:55:54,319 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1646 transitions. Word has length 54 [2025-03-17 11:55:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:54,319 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1646 transitions. [2025-03-17 11:55:54,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 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-17 11:55:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1646 transitions. [2025-03-17 11:55:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 11:55:54,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:54,320 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-17 11:55:54,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 11:55:54,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:54,521 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-17 11:55:54,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash 936853424, now seen corresponding path program 1 times [2025-03-17 11:55:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925969863] [2025-03-17 11:55:54,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:54,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:54,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:55:54,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:55:54,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:54,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:54,653 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-17 11:55:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925969863] [2025-03-17 11:55:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925969863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:54,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:54,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126975801] [2025-03-17 11:55:54,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:54,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:55:54,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:54,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:55:54,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:54,654 INFO L87 Difference]: Start difference. First operand 1164 states and 1646 transitions. Second operand has 9 states, 8 states have (on average 6.5) 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-17 11:55:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:54,826 INFO L93 Difference]: Finished difference Result 1560 states and 2176 transitions. [2025-03-17 11:55:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:54,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) 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-17 11:55:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:54,829 INFO L225 Difference]: With dead ends: 1560 [2025-03-17 11:55:54,829 INFO L226 Difference]: Without dead ends: 1560 [2025-03-17 11:55:54,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:54,829 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 155 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:54,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 859 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-03-17 11:55:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1340. [2025-03-17 11:55:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1187 states have (on average 1.4785172704296545) internal successors, (1755), 1279 states have internal predecessors, (1755), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 33 states have call predecessors, (108), 54 states have call successors, (108) [2025-03-17 11:55:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1917 transitions. [2025-03-17 11:55:54,840 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1917 transitions. Word has length 54 [2025-03-17 11:55:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:54,840 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1917 transitions. [2025-03-17 11:55:54,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) 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-17 11:55:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1917 transitions. [2025-03-17 11:55:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 11:55:54,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:54,841 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-17 11:55:54,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-17 11:55:54,841 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-17 11:55:54,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1592421208, now seen corresponding path program 1 times [2025-03-17 11:55:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:54,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243774560] [2025-03-17 11:55:54,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:54,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:55:54,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:55:54,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:54,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:54,997 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-17 11:55:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243774560] [2025-03-17 11:55:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243774560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:55:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650944071] [2025-03-17 11:55:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:54,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:54,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:54,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:54,997 INFO L87 Difference]: Start difference. First operand 1340 states and 1917 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 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-17 11:55:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:55,203 INFO L93 Difference]: Finished difference Result 1671 states and 2341 transitions. [2025-03-17 11:55:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:55,203 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 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-17 11:55:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:55,206 INFO L225 Difference]: With dead ends: 1671 [2025-03-17 11:55:55,206 INFO L226 Difference]: Without dead ends: 1671 [2025-03-17 11:55:55,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:55:55,206 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 389 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:55,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 911 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-17 11:55:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1430. [2025-03-17 11:55:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1265 states have (on average 1.4814229249011859) internal successors, (1874), 1363 states have internal predecessors, (1874), 60 states have call successors, (60), 30 states have call predecessors, (60), 60 states have return successors, (120), 36 states have call predecessors, (120), 60 states have call successors, (120) [2025-03-17 11:55:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2054 transitions. [2025-03-17 11:55:55,220 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2054 transitions. Word has length 54 [2025-03-17 11:55:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:55,220 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 2054 transitions. [2025-03-17 11:55:55,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 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-17 11:55:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2054 transitions. [2025-03-17 11:55:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 11:55:55,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:55,220 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-17 11:55:55,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-17 11:55:55,220 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-17 11:55:55,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash -959735753, now seen corresponding path program 1 times [2025-03-17 11:55:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736479544] [2025-03-17 11:55:55,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:55,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:55:55,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:55:55,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:55,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:55,545 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-17 11:55:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736479544] [2025-03-17 11:55:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736479544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009180534] [2025-03-17 11:55:55,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:55,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:55,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:55,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:55:55,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:55:55,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:55:55,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:55,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:55,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 11:55:55,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:56,005 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-17 11:55:56,036 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-17 11:55:56,085 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-17 11:55:56,090 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-17 11:55:56,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009180534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:56,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-03-17 11:55:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261433473] [2025-03-17 11:55:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:56,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:56,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:56,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:55:56,092 INFO L87 Difference]: Start difference. First operand 1430 states and 2054 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 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-17 11:55:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:56,478 INFO L93 Difference]: Finished difference Result 1663 states and 2320 transitions. [2025-03-17 11:55:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:56,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 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-17 11:55:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:56,482 INFO L225 Difference]: With dead ends: 1663 [2025-03-17 11:55:56,482 INFO L226 Difference]: Without dead ends: 1663 [2025-03-17 11:55:56,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:55:56,482 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 300 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:56,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1953 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-03-17 11:55:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1333. [2025-03-17 11:55:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1180 states have (on average 1.4779661016949153) internal successors, (1744), 1272 states have internal predecessors, (1744), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 33 states have call predecessors, (108), 54 states have call successors, (108) [2025-03-17 11:55:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1906 transitions. [2025-03-17 11:55:56,510 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1906 transitions. Word has length 54 [2025-03-17 11:55:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:56,510 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1906 transitions. [2025-03-17 11:55:56,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 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-17 11:55:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1906 transitions. [2025-03-17 11:55:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 11:55:56,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:56,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:56,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 11:55:56,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:56,712 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:56,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1543171474, now seen corresponding path program 1 times [2025-03-17 11:55:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:56,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732744099] [2025-03-17 11:55:56,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:56,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:55:56,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:55:56,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:56,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:55:57,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732744099] [2025-03-17 11:55:57,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732744099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972817797] [2025-03-17 11:55:57,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:57,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:57,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:57,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:57,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:55:57,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:55:57,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:55:57,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:57,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:57,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 11:55:57,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:57,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:57,542 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 22 [2025-03-17 11:55:57,636 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 11:55:57,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 11:55:57,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:57,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2025-03-17 11:55:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:57,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:57,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972817797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:57,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:55:57,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 22 [2025-03-17 11:55:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451786208] [2025-03-17 11:55:57,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:57,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:55:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:57,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:55:57,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:55:57,806 INFO L87 Difference]: Start difference. First operand 1333 states and 1906 transitions. Second operand has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 20 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:55:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:58,707 INFO L93 Difference]: Finished difference Result 1892 states and 2641 transitions. [2025-03-17 11:55:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:55:58,708 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 20 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-03-17 11:55:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:58,711 INFO L225 Difference]: With dead ends: 1892 [2025-03-17 11:55:58,711 INFO L226 Difference]: Without dead ends: 1892 [2025-03-17 11:55:58,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=331, Invalid=1739, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 11:55:58,711 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1032 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:58,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 2088 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:55:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2025-03-17 11:55:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1353. [2025-03-17 11:55:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1200 states have (on average 1.4758333333333333) internal successors, (1771), 1290 states have internal predecessors, (1771), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 35 states have call predecessors, (108), 54 states have call successors, (108) [2025-03-17 11:55:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1933 transitions. [2025-03-17 11:55:58,724 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1933 transitions. Word has length 56 [2025-03-17 11:55:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:58,724 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1933 transitions. [2025-03-17 11:55:58,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 20 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:55:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1933 transitions. [2025-03-17 11:55:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 11:55:58,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:58,724 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:58,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 11:55:58,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-03-17 11:55:58,925 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:55:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1543171475, now seen corresponding path program 1 times [2025-03-17 11:55:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478996695] [2025-03-17 11:55:58,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:58,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:55:58,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:55:58,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:58,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:55:59,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:59,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478996695] [2025-03-17 11:55:59,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478996695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:59,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75602470] [2025-03-17 11:55:59,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:59,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:59,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:59,610 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:59,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 11:55:59,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:55:59,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:55:59,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:59,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:59,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-17 11:55:59,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:59,768 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-17 11:55:59,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:55:59,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:59,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:56:00,043 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 36 treesize of output 27 [2025-03-17 11:56:00,048 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-17 11:56:00,143 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-17 11:56:00,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-03-17 11:56:00,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 11:56:00,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-17 11:56:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:00,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:00,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75602470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:00,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:56:00,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 28 [2025-03-17 11:56:00,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112643957] [2025-03-17 11:56:00,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:56:00,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 11:56:00,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:00,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 11:56:00,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:56:00,535 INFO L87 Difference]: Start difference. First operand 1353 states and 1933 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:03,249 INFO L93 Difference]: Finished difference Result 2091 states and 2860 transitions. [2025-03-17 11:56:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-17 11:56:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-03-17 11:56:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:03,252 INFO L225 Difference]: With dead ends: 2091 [2025-03-17 11:56:03,252 INFO L226 Difference]: Without dead ends: 2091 [2025-03-17 11:56:03,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=719, Invalid=4683, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 11:56:03,253 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1048 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 2995 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:03,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 2723 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2995 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 11:56:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2025-03-17 11:56:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1421. [2025-03-17 11:56:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1260 states have (on average 1.4682539682539681) internal successors, (1850), 1352 states have internal predecessors, (1850), 58 states have call successors, (58), 29 states have call predecessors, (58), 58 states have return successors, (116), 39 states have call predecessors, (116), 58 states have call successors, (116) [2025-03-17 11:56:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2024 transitions. [2025-03-17 11:56:03,269 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2024 transitions. Word has length 56 [2025-03-17 11:56:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:03,269 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 2024 transitions. [2025-03-17 11:56:03,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2024 transitions. [2025-03-17 11:56:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 11:56:03,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:03,270 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] [2025-03-17 11:56:03,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 11:56:03,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-03-17 11:56:03,470 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:03,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 224452850, now seen corresponding path program 1 times [2025-03-17 11:56:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:03,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611485766] [2025-03-17 11:56:03,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:03,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:56:03,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:56:03,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:03,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:03,709 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-17 11:56:03,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:03,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611485766] [2025-03-17 11:56:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611485766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:56:03,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:56:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:56:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094768070] [2025-03-17 11:56:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:56:03,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:56:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:03,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:56:03,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:56:03,710 INFO L87 Difference]: Start difference. First operand 1421 states and 2024 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-17 11:56:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:03,942 INFO L93 Difference]: Finished difference Result 1677 states and 2346 transitions. [2025-03-17 11:56:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:56:03,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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 56 [2025-03-17 11:56:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:03,946 INFO L225 Difference]: With dead ends: 1677 [2025-03-17 11:56:03,946 INFO L226 Difference]: Without dead ends: 1677 [2025-03-17 11:56:03,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:56:03,947 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 159 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:03,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1405 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:56:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2025-03-17 11:56:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1452. [2025-03-17 11:56:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1287 states have (on average 1.470862470862471) internal successors, (1893), 1381 states have internal predecessors, (1893), 60 states have call successors, (60), 30 states have call predecessors, (60), 60 states have return successors, (120), 40 states have call predecessors, (120), 60 states have call successors, (120) [2025-03-17 11:56:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2073 transitions. [2025-03-17 11:56:03,960 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2073 transitions. Word has length 56 [2025-03-17 11:56:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:03,961 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2073 transitions. [2025-03-17 11:56:03,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-17 11:56:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2073 transitions. [2025-03-17 11:56:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 11:56:03,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:03,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:56:03,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-17 11:56:03,962 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:03,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash -12894118, now seen corresponding path program 1 times [2025-03-17 11:56:03,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:03,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715314748] [2025-03-17 11:56:03,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:03,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:56:03,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:56:03,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:03,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:56:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715314748] [2025-03-17 11:56:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715314748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641575535] [2025-03-17 11:56:04,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:04,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:04,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:04,493 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:04,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 11:56:04,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:56:04,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:56:04,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:04,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:04,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 11:56:04,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:04,681 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-17 11:56:04,949 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 13 treesize of output 9 [2025-03-17 11:56:05,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:56:05,066 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 40 treesize of output 27 [2025-03-17 11:56:05,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:56:05,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:56:05,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:56:05,260 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:56:05,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 11:56:05,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-17 11:56:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:05,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:05,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641575535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:05,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:56:05,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2025-03-17 11:56:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901733404] [2025-03-17 11:56:05,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:56:05,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:56:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:05,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:56:05,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 11:56:05,535 INFO L87 Difference]: Start difference. First operand 1452 states and 2073 transitions. Second operand has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 28 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:08,698 INFO L93 Difference]: Finished difference Result 1908 states and 2644 transitions. [2025-03-17 11:56:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 11:56:08,698 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 28 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-03-17 11:56:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:08,701 INFO L225 Difference]: With dead ends: 1908 [2025-03-17 11:56:08,701 INFO L226 Difference]: Without dead ends: 1908 [2025-03-17 11:56:08,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=611, Invalid=5089, Unknown=0, NotChecked=0, Total=5700 [2025-03-17 11:56:08,702 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 912 mSDsluCounter, 5072 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 5315 SdHoareTripleChecker+Invalid, 5483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:08,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 5315 Invalid, 5483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 11:56:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2025-03-17 11:56:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1432. [2025-03-17 11:56:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1267 states have (on average 1.4727703235990528) internal successors, (1866), 1363 states have internal predecessors, (1866), 60 states have call successors, (60), 30 states have call predecessors, (60), 60 states have return successors, (120), 38 states have call predecessors, (120), 60 states have call successors, (120) [2025-03-17 11:56:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2046 transitions. [2025-03-17 11:56:08,714 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2046 transitions. Word has length 56 [2025-03-17 11:56:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:08,714 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2046 transitions. [2025-03-17 11:56:08,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 28 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2046 transitions. [2025-03-17 11:56:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 11:56:08,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:08,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:56:08,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 11:56:08,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2025-03-17 11:56:08,915 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:08,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1331612743, now seen corresponding path program 1 times [2025-03-17 11:56:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:08,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046121588] [2025-03-17 11:56:08,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:08,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:08,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:56:08,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:56:08,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:08,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:56:09,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:09,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046121588] [2025-03-17 11:56:09,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046121588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:09,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734474836] [2025-03-17 11:56:09,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:09,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:09,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:09,318 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:09,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 11:56:09,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:56:09,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:56:09,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:09,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:09,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 11:56:09,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:09,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:56:09,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-03-17 11:56:09,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:56:09,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:56:09,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2025-03-17 11:56:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:10,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:10,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2025-03-17 11:56:10,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2025-03-17 11:56:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:56:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734474836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:56:10,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:56:10,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 43 [2025-03-17 11:56:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663068283] [2025-03-17 11:56:10,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:56:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 11:56:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:10,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 11:56:10,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1669, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:56:10,717 INFO L87 Difference]: Start difference. First operand 1432 states and 2046 transitions. Second operand has 43 states, 43 states have (on average 3.395348837209302) internal successors, (146), 40 states have internal predecessors, (146), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 11:56:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:12,040 INFO L93 Difference]: Finished difference Result 1659 states and 2305 transitions. [2025-03-17 11:56:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:56:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.395348837209302) internal successors, (146), 40 states have internal predecessors, (146), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 56 [2025-03-17 11:56:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:12,042 INFO L225 Difference]: With dead ends: 1659 [2025-03-17 11:56:12,042 INFO L226 Difference]: Without dead ends: 1657 [2025-03-17 11:56:12,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=362, Invalid=3178, Unknown=0, NotChecked=0, Total=3540 [2025-03-17 11:56:12,044 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 609 mSDsluCounter, 6071 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 6354 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:12,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 6354 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2522 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 11:56:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-17 11:56:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1341. [2025-03-17 11:56:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1188 states have (on average 1.4688552188552189) internal successors, (1745), 1278 states have internal predecessors, (1745), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 35 states have call predecessors, (108), 54 states have call successors, (108) [2025-03-17 11:56:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1907 transitions. [2025-03-17 11:56:12,055 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1907 transitions. Word has length 56 [2025-03-17 11:56:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:12,055 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1907 transitions. [2025-03-17 11:56:12,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.395348837209302) internal successors, (146), 40 states have internal predecessors, (146), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 11:56:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1907 transitions. [2025-03-17 11:56:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:56:12,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:12,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:56:12,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 11:56:12,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2025-03-17 11:56:12,257 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:12,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1169280357, now seen corresponding path program 1 times [2025-03-17 11:56:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:12,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909456209] [2025-03-17 11:56:12,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:12,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:12,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:12,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:12,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:12,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:56:12,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:12,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909456209] [2025-03-17 11:56:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909456209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:12,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67607750] [2025-03-17 11:56:12,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:12,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:12,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:12,500 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:12,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 11:56:12,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:12,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:12,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:12,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:12,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 11:56:12,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:12,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:56:12,819 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-17 11:56:12,895 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 11:56:12,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-17 11:56:12,933 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-17 11:56:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:12,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67607750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:12,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:56:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2025-03-17 11:56:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162787411] [2025-03-17 11:56:12,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:56:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:56:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:12,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:56:12,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:56:12,990 INFO L87 Difference]: Start difference. First operand 1341 states and 1907 transitions. Second operand has 21 states, 20 states have (on average 5.2) internal successors, (104), 19 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:13,542 INFO L93 Difference]: Finished difference Result 1697 states and 2388 transitions. [2025-03-17 11:56:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:56:13,543 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.2) internal successors, (104), 19 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2025-03-17 11:56:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:13,545 INFO L225 Difference]: With dead ends: 1697 [2025-03-17 11:56:13,545 INFO L226 Difference]: Without dead ends: 1697 [2025-03-17 11:56:13,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:56:13,546 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 577 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:13,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1967 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:56:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-17 11:56:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1434. [2025-03-17 11:56:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1269 states have (on average 1.4602048857368006) internal successors, (1853), 1363 states have internal predecessors, (1853), 60 states have call successors, (60), 30 states have call predecessors, (60), 60 states have return successors, (120), 40 states have call predecessors, (120), 60 states have call successors, (120) [2025-03-17 11:56:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2033 transitions. [2025-03-17 11:56:13,559 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2033 transitions. Word has length 57 [2025-03-17 11:56:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:13,559 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2033 transitions. [2025-03-17 11:56:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.2) internal successors, (104), 19 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2033 transitions. [2025-03-17 11:56:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:56:13,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:13,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:56:13,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 11:56:13,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:13,761 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:13,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1169280358, now seen corresponding path program 1 times [2025-03-17 11:56:13,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:13,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720571698] [2025-03-17 11:56:13,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:13,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:13,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:13,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:13,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:56:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720571698] [2025-03-17 11:56:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720571698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057283683] [2025-03-17 11:56:15,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:15,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:15,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:15,063 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:15,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 11:56:15,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:15,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:15,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:15,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:15,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-17 11:56:15,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:15,247 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-17 11:56:15,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:56:15,523 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-17 11:56:15,525 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 13 treesize of output 9 [2025-03-17 11:56:15,659 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:56:15,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 11:56:15,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:56:15,752 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-17 11:56:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:15,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057283683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:15,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:56:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 35 [2025-03-17 11:56:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325989271] [2025-03-17 11:56:15,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:56:15,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 11:56:15,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:15,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 11:56:15,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 11:56:15,960 INFO L87 Difference]: Start difference. First operand 1434 states and 2033 transitions. Second operand has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:17,931 INFO L93 Difference]: Finished difference Result 1707 states and 2398 transitions. [2025-03-17 11:56:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 11:56:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2025-03-17 11:56:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:17,934 INFO L225 Difference]: With dead ends: 1707 [2025-03-17 11:56:17,934 INFO L226 Difference]: Without dead ends: 1707 [2025-03-17 11:56:17,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=451, Invalid=3839, Unknown=0, NotChecked=0, Total=4290 [2025-03-17 11:56:17,935 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 583 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 2772 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:17,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 2642 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2772 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 11:56:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-03-17 11:56:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1434. [2025-03-17 11:56:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1269 states have (on average 1.458628841607565) internal successors, (1851), 1363 states have internal predecessors, (1851), 60 states have call successors, (60), 30 states have call predecessors, (60), 60 states have return successors, (120), 40 states have call predecessors, (120), 60 states have call successors, (120) [2025-03-17 11:56:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2031 transitions. [2025-03-17 11:56:17,947 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2031 transitions. Word has length 57 [2025-03-17 11:56:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2031 transitions. [2025-03-17 11:56:17,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2031 transitions. [2025-03-17 11:56:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:56:17,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:17,947 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-17 11:56:17,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 11:56:18,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2025-03-17 11:56:18,148 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:18,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1631871340, now seen corresponding path program 1 times [2025-03-17 11:56:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262563747] [2025-03-17 11:56:18,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:18,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:18,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:18,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:18,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:56:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262563747] [2025-03-17 11:56:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262563747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470149517] [2025-03-17 11:56:18,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:18,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:18,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:18,250 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:18,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 11:56:18,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:18,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:18,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:18,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:18,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 11:56:18,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:18,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:56:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470149517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:56:18,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:56:18,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2025-03-17 11:56:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118430587] [2025-03-17 11:56:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:56:18,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:56:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:18,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:56:18,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:56:18,590 INFO L87 Difference]: Start difference. First operand 1434 states and 2031 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:56:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:18,686 INFO L93 Difference]: Finished difference Result 1441 states and 1984 transitions. [2025-03-17 11:56:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:56:18,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2025-03-17 11:56:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:18,688 INFO L225 Difference]: With dead ends: 1441 [2025-03-17 11:56:18,688 INFO L226 Difference]: Without dead ends: 1441 [2025-03-17 11:56:18,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:56:18,688 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 221 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 301 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-17 11:56:18,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 301 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:56:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2025-03-17 11:56:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1431. [2025-03-17 11:56:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1269 states have (on average 1.41371158392435) internal successors, (1794), 1360 states have internal predecessors, (1794), 60 states have call successors, (60), 30 states have call predecessors, (60), 60 states have return successors, (120), 40 states have call predecessors, (120), 60 states have call successors, (120) [2025-03-17 11:56:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1974 transitions. [2025-03-17 11:56:18,699 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1974 transitions. Word has length 57 [2025-03-17 11:56:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:18,699 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1974 transitions. [2025-03-17 11:56:18,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:56:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1974 transitions. [2025-03-17 11:56:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:56:18,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:18,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:56:18,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 11:56:18,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:18,900 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:18,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash 175887230, now seen corresponding path program 1 times [2025-03-17 11:56:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:18,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136999293] [2025-03-17 11:56:18,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:18,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:18,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:18,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:18,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:56:19,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:19,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136999293] [2025-03-17 11:56:19,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136999293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:19,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934438049] [2025-03-17 11:56:19,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:19,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:19,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:19,395 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:19,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 11:56:19,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:19,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:19,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:19,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-17 11:56:19,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:19,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:56:19,804 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-17 11:56:19,843 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-17 11:56:19,934 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 11:56:19,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-17 11:56:19,970 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-17 11:56:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:19,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934438049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:20,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:56:20,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2025-03-17 11:56:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320195183] [2025-03-17 11:56:20,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:56:20,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:56:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:20,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:56:20,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:56:20,022 INFO L87 Difference]: Start difference. First operand 1431 states and 1974 transitions. Second operand has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 20 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:20,639 INFO L93 Difference]: Finished difference Result 1686 states and 2286 transitions. [2025-03-17 11:56:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:56:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 20 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2025-03-17 11:56:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:20,642 INFO L225 Difference]: With dead ends: 1686 [2025-03-17 11:56:20,642 INFO L226 Difference]: Without dead ends: 1686 [2025-03-17 11:56:20,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:56:20,642 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 372 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:20,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 2488 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:56:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2025-03-17 11:56:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1453. [2025-03-17 11:56:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1291 states have (on average 1.4120836560805576) internal successors, (1823), 1380 states have internal predecessors, (1823), 60 states have call successors, (60), 30 states have call predecessors, (60), 60 states have return successors, (120), 42 states have call predecessors, (120), 60 states have call successors, (120) [2025-03-17 11:56:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2003 transitions. [2025-03-17 11:56:20,654 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2003 transitions. Word has length 57 [2025-03-17 11:56:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:20,654 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2003 transitions. [2025-03-17 11:56:20,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 20 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2003 transitions. [2025-03-17 11:56:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:56:20,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:20,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:56:20,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 11:56:20,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:20,855 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 175887231, now seen corresponding path program 1 times [2025-03-17 11:56:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003413176] [2025-03-17 11:56:20,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:20,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:20,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:20,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:20,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:56:21,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:21,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003413176] [2025-03-17 11:56:21,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003413176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:21,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46164549] [2025-03-17 11:56:21,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:21,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:21,553 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:21,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 11:56:21,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:21,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:21,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:21,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:21,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-17 11:56:21,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:21,779 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-17 11:56:22,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:56:22,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:56:22,131 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 34 treesize of output 25 [2025-03-17 11:56:22,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 11:56:22,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:56:22,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:56:22,326 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:56:22,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 11:56:22,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-17 11:56:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:22,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46164549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:22,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:56:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2025-03-17 11:56:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359533621] [2025-03-17 11:56:22,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:56:22,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 11:56:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:22,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 11:56:22,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:56:22,583 INFO L87 Difference]: Start difference. First operand 1453 states and 2003 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 26 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:24,048 INFO L93 Difference]: Finished difference Result 1864 states and 2496 transitions. [2025-03-17 11:56:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:56:24,049 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 26 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2025-03-17 11:56:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:24,051 INFO L225 Difference]: With dead ends: 1864 [2025-03-17 11:56:24,051 INFO L226 Difference]: Without dead ends: 1864 [2025-03-17 11:56:24,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=426, Invalid=2330, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 11:56:24,052 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 741 mSDsluCounter, 2990 mSDsCounter, 0 mSdLazyCounter, 2771 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:24,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 3241 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2771 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 11:56:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2025-03-17 11:56:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1383. [2025-03-17 11:56:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1229 states have (on average 1.417412530512612) internal successors, (1742), 1316 states have internal predecessors, (1742), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 38 states have call predecessors, (112), 56 states have call successors, (112) [2025-03-17 11:56:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1910 transitions. [2025-03-17 11:56:24,063 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1910 transitions. Word has length 57 [2025-03-17 11:56:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1910 transitions. [2025-03-17 11:56:24,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 26 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1910 transitions. [2025-03-17 11:56:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:56:24,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:24,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:56:24,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 11:56:24,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-03-17 11:56:24,264 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 11:56:24,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1395173482, now seen corresponding path program 1 times [2025-03-17 11:56:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259618329] [2025-03-17 11:56:24,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:24,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:24,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:24,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:24,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259618329] [2025-03-17 11:56:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259618329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215405017] [2025-03-17 11:56:25,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:25,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:25,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:25,582 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:25,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 11:56:25,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:56:25,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:56:25,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:25,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:25,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-17 11:56:25,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:25,818 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:56:25,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:56:26,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:56:26,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:56:26,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:56:26,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:56:26,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:56:26,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:56:26,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 11:56:26,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 11:56:26,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:56:26,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:56:26,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 11:56:26,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:56:26,475 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:56:26,482 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 11:56:26,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2025-03-17 11:56:26,487 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 22 treesize of output 17 [2025-03-17 11:56:26,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:56:26,876 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:56:26,877 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:56:26,889 INFO L349 Elim1Store]: treesize reduction 34, result has 27.7 percent of original size [2025-03-17 11:56:26,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 44 [2025-03-17 11:56:26,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:56:26,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-17 11:56:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:27,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:27,246 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ |c_ULTIMATE.start_append_one_~list#1.offset| 4) |c_ULTIMATE.start_append_one_~item~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_~#list~0.base|) |c_~#list~0.offset|))) (and (= (select (select .cse0 .cse1) 4) 0) (forall ((v_ArrVal_2147 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_2147) .cse1) 4) 0))))) is different from false [2025-03-17 11:56:33,118 INFO L349 Elim1Store]: treesize reduction 232, result has 51.8 percent of original size [2025-03-17 11:56:33,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 84153 treesize of output 80227 [2025-03-17 11:56:36,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:56:36,895 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 38870 treesize of output 37600