./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:03:00,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:03:00,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:03:00,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:03:00,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:03:00,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:03:00,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:03:00,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:03:00,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:03:00,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:03:00,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:03:00,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:03:00,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:03:00,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:03:00,112 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:03:00,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:03:00,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:03:00,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:03:00,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:03:00,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:03:00,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:03:00,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:03:00,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:03:00,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:03:00,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:03:00,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:03:00,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:03:00,114 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2025-03-08 23:03:00,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:03:00,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:03:00,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:03:00,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:03:00,359 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:03:00,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2025-03-08 23:03:01,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43012ac7/4b7b28216bf841fb8826ff391c98fc44/FLAG7bbb79fa5 [2025-03-08 23:03:01,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:03:01,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2025-03-08 23:03:01,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43012ac7/4b7b28216bf841fb8826ff391c98fc44/FLAG7bbb79fa5 [2025-03-08 23:03:02,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43012ac7/4b7b28216bf841fb8826ff391c98fc44 [2025-03-08 23:03:02,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:03:02,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:03:02,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:03:02,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:03:02,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:03:02,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b2910d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02, skipping insertion in model container [2025-03-08 23:03:02,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:03:02,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:03:02,334 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:03:02,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:03:02,395 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:03:02,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02 WrapperNode [2025-03-08 23:03:02,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:03:02,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:03:02,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:03:02,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:03:02,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,421 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137 [2025-03-08 23:03:02,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:03:02,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:03:02,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:03:02,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:03:02,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,443 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 19 writes are split as follows [0, 19]. [2025-03-08 23:03:02,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:03:02,453 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:03:02,453 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:03:02,453 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:03:02,454 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (1/1) ... [2025-03-08 23:03:02,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:03:02,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:02,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:03:02,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:03:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:03:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:03:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:03:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:03:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:03:02,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:03:02,578 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:03:02,580 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:03:02,963 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2025-03-08 23:03:02,969 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:03:02,980 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:03:02,980 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:03:02,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:03:02 BoogieIcfgContainer [2025-03-08 23:03:02,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:03:02,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:03:02,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:03:02,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:03:02,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:03:02" (1/3) ... [2025-03-08 23:03:02,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675454b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:03:02, skipping insertion in model container [2025-03-08 23:03:02,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:02" (2/3) ... [2025-03-08 23:03:02,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675454b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:03:02, skipping insertion in model container [2025-03-08 23:03:02,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:03:02" (3/3) ... [2025-03-08 23:03:02,988 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2025-03-08 23:03:03,000 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:03:03,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-optional-1.i that has 1 procedures, 153 locations, 1 initial locations, 4 loop locations, and 72 error locations. [2025-03-08 23:03:03,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:03:03,042 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;@54e60965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:03:03,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-08 23:03:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.1) internal successors, (168), 152 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 23:03:03,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:03,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 23:03:03,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:03,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash 197574, now seen corresponding path program 1 times [2025-03-08 23:03:03,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203608198] [2025-03-08 23:03:03,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:03,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:03,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 23:03:03,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 23:03:03,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:03,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:03,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:03,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203608198] [2025-03-08 23:03:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203608198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:03,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:03:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737772811] [2025-03-08 23:03:03,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:03,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:03:03,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:03,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:03:03,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:03:03,225 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.1) internal successors, (168), 152 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:03,411 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2025-03-08 23:03:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:03:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 23:03:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:03,418 INFO L225 Difference]: With dead ends: 146 [2025-03-08 23:03:03,418 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 23:03:03,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:03:03,423 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:03,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 87 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 23:03:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-03-08 23:03:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 81 states have (on average 1.9135802469135803) internal successors, (155), 142 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2025-03-08 23:03:03,458 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 3 [2025-03-08 23:03:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:03,459 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2025-03-08 23:03:03,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2025-03-08 23:03:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 23:03:03,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:03,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 23:03:03,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:03:03,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:03,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash 197575, now seen corresponding path program 1 times [2025-03-08 23:03:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377857496] [2025-03-08 23:03:03,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:03,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 23:03:03,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 23:03:03,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377857496] [2025-03-08 23:03:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377857496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:03,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:03:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836907790] [2025-03-08 23:03:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:03,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:03:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:03,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:03:03,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:03:03,520 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:03,633 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2025-03-08 23:03:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:03:03,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 23:03:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:03,635 INFO L225 Difference]: With dead ends: 134 [2025-03-08 23:03:03,637 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 23:03:03,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:03:03,637 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:03,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 98 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 23:03:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-08 23:03:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 81 states have (on average 1.8024691358024691) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-03-08 23:03:03,648 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 3 [2025-03-08 23:03:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:03,648 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-03-08 23:03:03,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-03-08 23:03:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 23:03:03,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:03,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:03,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:03:03,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:03,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1155225865, now seen corresponding path program 1 times [2025-03-08 23:03:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8125493] [2025-03-08 23:03:03,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:03,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 23:03:03,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 23:03:03,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:03,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:03,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:03,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8125493] [2025-03-08 23:03:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8125493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:03,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:03,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591573541] [2025-03-08 23:03:03,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:03,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:03:03,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:03,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:03:03,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:03,885 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:04,060 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2025-03-08 23:03:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:04,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 23:03:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:04,061 INFO L225 Difference]: With dead ends: 174 [2025-03-08 23:03:04,061 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 23:03:04,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:04,062 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 45 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:04,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 327 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 23:03:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2025-03-08 23:03:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 81 states have (on average 1.7901234567901234) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2025-03-08 23:03:04,067 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 12 [2025-03-08 23:03:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:04,067 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2025-03-08 23:03:04,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2025-03-08 23:03:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 23:03:04,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:04,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:04,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:03:04,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1155225866, now seen corresponding path program 1 times [2025-03-08 23:03:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:04,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269772157] [2025-03-08 23:03:04,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:04,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 23:03:04,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 23:03:04,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:04,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:04,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269772157] [2025-03-08 23:03:04,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269772157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:04,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:04,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:04,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981700945] [2025-03-08 23:03:04,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:04,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:03:04,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:04,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:03:04,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:04,275 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:04,417 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2025-03-08 23:03:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:04,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 23:03:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:04,418 INFO L225 Difference]: With dead ends: 132 [2025-03-08 23:03:04,418 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 23:03:04,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:04,419 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:04,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 362 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 23:03:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-08 23:03:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.7777777777777777) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2025-03-08 23:03:04,423 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 12 [2025-03-08 23:03:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:04,423 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2025-03-08 23:03:04,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2025-03-08 23:03:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 23:03:04,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:04,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:04,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:03:04,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:04,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1949074126, now seen corresponding path program 1 times [2025-03-08 23:03:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:04,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801525980] [2025-03-08 23:03:04,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:04,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 23:03:04,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 23:03:04,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:04,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:04,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801525980] [2025-03-08 23:03:04,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801525980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:04,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:04,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:03:04,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377431030] [2025-03-08 23:03:04,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:04,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:03:04,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:04,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:03:04,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:03:04,503 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:04,656 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2025-03-08 23:03:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 23:03:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:04,657 INFO L225 Difference]: With dead ends: 126 [2025-03-08 23:03:04,657 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 23:03:04,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:04,657 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 155 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:04,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 73 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 23:03:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-03-08 23:03:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 123 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2025-03-08 23:03:04,665 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 13 [2025-03-08 23:03:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:04,665 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2025-03-08 23:03:04,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2025-03-08 23:03:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 23:03:04,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:04,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:03:04,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:04,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:04,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1949074125, now seen corresponding path program 1 times [2025-03-08 23:03:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70527479] [2025-03-08 23:03:04,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:04,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 23:03:04,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 23:03:04,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:04,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:04,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:04,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70527479] [2025-03-08 23:03:04,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70527479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:04,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:04,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:03:04,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084069257] [2025-03-08 23:03:04,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:04,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:03:04,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:04,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:03:04,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:04,784 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:04,991 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2025-03-08 23:03:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:03:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 23:03:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:04,992 INFO L225 Difference]: With dead ends: 166 [2025-03-08 23:03:04,992 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 23:03:04,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:03:04,993 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 303 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:04,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 154 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 23:03:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2025-03-08 23:03:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.5423728813559323) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2025-03-08 23:03:05,003 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 13 [2025-03-08 23:03:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:05,003 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2025-03-08 23:03:05,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2025-03-08 23:03:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:03:05,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:05,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:03:05,004 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:05,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1206768359, now seen corresponding path program 1 times [2025-03-08 23:03:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546366394] [2025-03-08 23:03:05,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:05,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:05,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:03:05,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:03:05,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:05,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:05,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546366394] [2025-03-08 23:03:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546366394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:05,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631297000] [2025-03-08 23:03:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:05,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:03:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:05,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:03:05,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:03:05,041 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:05,127 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2025-03-08 23:03:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:03:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 23:03:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:05,128 INFO L225 Difference]: With dead ends: 163 [2025-03-08 23:03:05,128 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 23:03:05,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:03:05,129 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 155 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:05,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 163 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 23:03:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2025-03-08 23:03:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.5338983050847457) internal successors, (181), 154 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2025-03-08 23:03:05,137 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 16 [2025-03-08 23:03:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:05,137 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2025-03-08 23:03:05,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2025-03-08 23:03:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:03:05,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:05,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:05,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:03:05,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:05,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:05,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1204324764, now seen corresponding path program 1 times [2025-03-08 23:03:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:05,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365637679] [2025-03-08 23:03:05,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:05,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:05,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:03:05,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:03:05,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:05,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365637679] [2025-03-08 23:03:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365637679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:05,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527026593] [2025-03-08 23:03:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:05,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:03:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:05,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:03:05,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:05,223 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:05,339 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2025-03-08 23:03:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:05,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 23:03:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:05,340 INFO L225 Difference]: With dead ends: 154 [2025-03-08 23:03:05,340 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 23:03:05,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:05,341 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:05,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 305 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 23:03:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-08 23:03:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 118 states have (on average 1.5169491525423728) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2025-03-08 23:03:05,348 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 16 [2025-03-08 23:03:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:05,348 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2025-03-08 23:03:05,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2025-03-08 23:03:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:03:05,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:05,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:05,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:03:05,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:05,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1204324763, now seen corresponding path program 1 times [2025-03-08 23:03:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:05,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134677916] [2025-03-08 23:03:05,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:05,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:03:05,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:03:05,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:05,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:05,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:05,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134677916] [2025-03-08 23:03:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134677916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:05,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:05,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393577540] [2025-03-08 23:03:05,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:05,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:03:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:05,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:03:05,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:05,508 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:05,646 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2025-03-08 23:03:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 23:03:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:05,647 INFO L225 Difference]: With dead ends: 153 [2025-03-08 23:03:05,647 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 23:03:05,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:05,648 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:05,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 296 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 23:03:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-08 23:03:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.5) internal successors, (177), 152 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2025-03-08 23:03:05,651 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 16 [2025-03-08 23:03:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:05,651 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2025-03-08 23:03:05,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2025-03-08 23:03:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:03:05,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:05,652 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-08 23:03:05,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 23:03:05,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:05,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1228152094, now seen corresponding path program 1 times [2025-03-08 23:03:05,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:05,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713970] [2025-03-08 23:03:05,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:05,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:05,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:03:05,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:03:05,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:05,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713970] [2025-03-08 23:03:05,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:05,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:05,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:03:05,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295977144] [2025-03-08 23:03:05,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:05,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:03:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:05,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:03:05,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:03:05,834 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:06,081 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2025-03-08 23:03:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:03:06,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-08 23:03:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:06,082 INFO L225 Difference]: With dead ends: 153 [2025-03-08 23:03:06,082 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 23:03:06,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:03:06,082 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 151 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:06,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 250 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 23:03:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-08 23:03:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 151 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2025-03-08 23:03:06,086 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 20 [2025-03-08 23:03:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:06,086 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2025-03-08 23:03:06,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2025-03-08 23:03:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:03:06,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:06,086 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-08 23:03:06,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 23:03:06,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:06,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1228152095, now seen corresponding path program 1 times [2025-03-08 23:03:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:06,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130108769] [2025-03-08 23:03:06,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:06,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:06,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:03:06,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:03:06,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:06,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:06,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-08 23:03:06,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:06,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130108769] [2025-03-08 23:03:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130108769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:06,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:03:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275700238] [2025-03-08 23:03:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:03:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:06,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:03:06,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:03:06,315 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:06,702 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2025-03-08 23:03:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 23:03:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-08 23:03:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:06,703 INFO L225 Difference]: With dead ends: 143 [2025-03-08 23:03:06,703 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 23:03:06,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-08 23:03:06,703 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 164 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:06,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 345 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 23:03:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2025-03-08 23:03:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.4181818181818182) internal successors, (156), 132 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2025-03-08 23:03:06,707 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 20 [2025-03-08 23:03:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:06,707 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2025-03-08 23:03:06,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2025-03-08 23:03:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:03:06,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:06,707 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-08 23:03:06,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:03:06,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:06,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:06,708 INFO L85 PathProgramCache]: Analyzing trace with hash 788917785, now seen corresponding path program 1 times [2025-03-08 23:03:06,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:06,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40876923] [2025-03-08 23:03:06,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:06,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:03:06,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:03:06,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:06,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:06,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:06,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40876923] [2025-03-08 23:03:06,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40876923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:06,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:06,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753569265] [2025-03-08 23:03:06,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:06,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:03:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:06,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:03:06,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:03:06,741 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:06,754 INFO L93 Difference]: Finished difference Result 139 states and 162 transitions. [2025-03-08 23:03:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:03:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 23:03:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:06,754 INFO L225 Difference]: With dead ends: 139 [2025-03-08 23:03:06,754 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 23:03:06,755 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-08 23:03:06,755 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:06,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 312 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:03:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 23:03:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2025-03-08 23:03:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 114 states have (on average 1.4035087719298245) internal successors, (160), 136 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2025-03-08 23:03:06,757 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 21 [2025-03-08 23:03:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:06,757 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2025-03-08 23:03:06,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2025-03-08 23:03:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:03:06,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:06,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:06,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 23:03:06,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:06,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1408427959, now seen corresponding path program 1 times [2025-03-08 23:03:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:06,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269467606] [2025-03-08 23:03:06,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:06,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:03:06,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:03:06,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:06,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:06,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:06,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269467606] [2025-03-08 23:03:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269467606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:06,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:06,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:03:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896593161] [2025-03-08 23:03:06,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:03:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:06,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:03:06,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:03:06,900 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:07,111 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2025-03-08 23:03:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:03:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 23:03:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:07,112 INFO L225 Difference]: With dead ends: 217 [2025-03-08 23:03:07,114 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 23:03:07,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:03:07,114 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:07,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 368 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 23:03:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 151. [2025-03-08 23:03:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 128 states have (on average 1.390625) internal successors, (178), 150 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 178 transitions. [2025-03-08 23:03:07,119 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 178 transitions. Word has length 23 [2025-03-08 23:03:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:07,119 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 178 transitions. [2025-03-08 23:03:07,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 178 transitions. [2025-03-08 23:03:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:03:07,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:07,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:07,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:03:07,122 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:07,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1408427960, now seen corresponding path program 1 times [2025-03-08 23:03:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:07,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192054654] [2025-03-08 23:03:07,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:07,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:03:07,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:03:07,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:07,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:07,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:07,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192054654] [2025-03-08 23:03:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192054654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:07,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:07,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:03:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286498250] [2025-03-08 23:03:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:07,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:03:07,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:07,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:03:07,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:03:07,305 INFO L87 Difference]: Start difference. First operand 151 states and 178 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:07,569 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2025-03-08 23:03:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:03:07,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 23:03:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:07,570 INFO L225 Difference]: With dead ends: 213 [2025-03-08 23:03:07,570 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 23:03:07,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:03:07,571 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 169 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:07,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 419 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 23:03:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 147. [2025-03-08 23:03:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 146 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2025-03-08 23:03:07,575 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 23 [2025-03-08 23:03:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:07,575 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2025-03-08 23:03:07,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2025-03-08 23:03:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:03:07,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:07,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:07,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 23:03:07,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:07,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash 612592493, now seen corresponding path program 1 times [2025-03-08 23:03:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:07,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724690070] [2025-03-08 23:03:07,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:07,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:03:07,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:03:07,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:07,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724690070] [2025-03-08 23:03:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724690070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:03:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558145755] [2025-03-08 23:03:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:07,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:03:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:07,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:03:07,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:03:07,604 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:07,608 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2025-03-08 23:03:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:03:07,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 23:03:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:07,609 INFO L225 Difference]: With dead ends: 149 [2025-03-08 23:03:07,609 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 23:03:07,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:03:07,610 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:07,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:03:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 23:03:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-08 23:03:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 126 states have (on average 1.380952380952381) internal successors, (174), 148 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2025-03-08 23:03:07,612 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 24 [2025-03-08 23:03:07,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:07,612 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2025-03-08 23:03:07,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2025-03-08 23:03:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 23:03:07,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:07,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:07,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 23:03:07,613 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:07,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash 322359469, now seen corresponding path program 1 times [2025-03-08 23:03:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904064828] [2025-03-08 23:03:07,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:07,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:03:07,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:03:07,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:07,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:07,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904064828] [2025-03-08 23:03:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904064828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:07,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:07,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:03:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690972148] [2025-03-08 23:03:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:07,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:03:07,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:07,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:03:07,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:03:07,764 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:07,989 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2025-03-08 23:03:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 23:03:07,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 23:03:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:07,990 INFO L225 Difference]: With dead ends: 212 [2025-03-08 23:03:07,991 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 23:03:07,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:03:07,991 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 202 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:07,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 378 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 23:03:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 155. [2025-03-08 23:03:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.371212121212121) internal successors, (181), 154 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2025-03-08 23:03:07,995 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 26 [2025-03-08 23:03:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:07,995 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2025-03-08 23:03:07,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2025-03-08 23:03:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:03:07,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:07,995 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:07,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:03:07,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 450752367, now seen corresponding path program 1 times [2025-03-08 23:03:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105780261] [2025-03-08 23:03:07,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:03:08,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:03:08,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:08,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:08,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:08,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105780261] [2025-03-08 23:03:08,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105780261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:08,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:08,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:08,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855286994] [2025-03-08 23:03:08,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:08,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:03:08,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:08,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:03:08,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:03:08,034 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:08,046 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2025-03-08 23:03:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:03:08,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 23:03:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:08,047 INFO L225 Difference]: With dead ends: 159 [2025-03-08 23:03:08,047 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 23:03:08,047 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-08 23:03:08,048 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:08,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:03:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 23:03:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-08 23:03:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2025-03-08 23:03:08,053 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 27 [2025-03-08 23:03:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:08,054 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2025-03-08 23:03:08,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2025-03-08 23:03:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:03:08,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:08,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:08,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 23:03:08,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:08,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 790225176, now seen corresponding path program 1 times [2025-03-08 23:03:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:08,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520504060] [2025-03-08 23:03:08,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:08,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:03:08,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:03:08,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:08,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:08,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:08,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520504060] [2025-03-08 23:03:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520504060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:08,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:08,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:03:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705661395] [2025-03-08 23:03:08,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:08,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:03:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:08,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:03:08,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:03:08,223 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:08,543 INFO L93 Difference]: Finished difference Result 287 states and 326 transitions. [2025-03-08 23:03:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 23:03:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 23:03:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:08,545 INFO L225 Difference]: With dead ends: 287 [2025-03-08 23:03:08,545 INFO L226 Difference]: Without dead ends: 287 [2025-03-08 23:03:08,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-08 23:03:08,546 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 323 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:08,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 398 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-08 23:03:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 172. [2025-03-08 23:03:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.348993288590604) internal successors, (201), 171 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2025-03-08 23:03:08,553 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 27 [2025-03-08 23:03:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:08,553 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2025-03-08 23:03:08,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2025-03-08 23:03:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:03:08,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:08,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:08,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 23:03:08,554 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:08,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:08,554 INFO L85 PathProgramCache]: Analyzing trace with hash 790225177, now seen corresponding path program 1 times [2025-03-08 23:03:08,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:08,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282755830] [2025-03-08 23:03:08,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:08,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:03:08,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:03:08,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:08,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:08,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282755830] [2025-03-08 23:03:08,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282755830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:08,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:08,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:03:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514730133] [2025-03-08 23:03:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:08,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:03:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:08,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:03:08,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:03:08,852 INFO L87 Difference]: Start difference. First operand 172 states and 201 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:09,243 INFO L93 Difference]: Finished difference Result 241 states and 276 transitions. [2025-03-08 23:03:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 23:03:09,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 23:03:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:09,244 INFO L225 Difference]: With dead ends: 241 [2025-03-08 23:03:09,244 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 23:03:09,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-08 23:03:09,245 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 258 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:09,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 488 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:03:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 23:03:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 172. [2025-03-08 23:03:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.342281879194631) internal successors, (200), 171 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2025-03-08 23:03:09,249 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 27 [2025-03-08 23:03:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:09,250 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2025-03-08 23:03:09,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2025-03-08 23:03:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:03:09,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:09,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:09,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:03:09,251 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1509422121, now seen corresponding path program 1 times [2025-03-08 23:03:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971361814] [2025-03-08 23:03:09,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:09,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:03:09,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:03:09,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:09,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:09,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971361814] [2025-03-08 23:03:09,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971361814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:09,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:09,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687771375] [2025-03-08 23:03:09,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:09,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:03:09,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:09,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:03:09,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:09,343 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:09,451 INFO L93 Difference]: Finished difference Result 180 states and 209 transitions. [2025-03-08 23:03:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 23:03:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:09,452 INFO L225 Difference]: With dead ends: 180 [2025-03-08 23:03:09,452 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 23:03:09,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:09,453 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:09,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 290 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 23:03:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2025-03-08 23:03:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 149 states have (on average 1.3355704697986577) internal successors, (199), 170 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2025-03-08 23:03:09,457 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 28 [2025-03-08 23:03:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:09,457 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2025-03-08 23:03:09,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2025-03-08 23:03:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:03:09,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:09,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:09,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 23:03:09,458 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:09,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1509422122, now seen corresponding path program 1 times [2025-03-08 23:03:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:09,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700578324] [2025-03-08 23:03:09,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:09,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:03:09,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:03:09,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:09,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:09,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:09,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700578324] [2025-03-08 23:03:09,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700578324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:09,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:09,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:03:09,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671106546] [2025-03-08 23:03:09,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:09,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:03:09,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:09,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:03:09,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:09,590 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:09,690 INFO L93 Difference]: Finished difference Result 170 states and 198 transitions. [2025-03-08 23:03:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:09,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 23:03:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:09,691 INFO L225 Difference]: With dead ends: 170 [2025-03-08 23:03:09,691 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 23:03:09,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:09,693 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:09,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 23:03:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-08 23:03:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3288590604026846) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2025-03-08 23:03:09,697 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 28 [2025-03-08 23:03:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:09,697 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2025-03-08 23:03:09,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2025-03-08 23:03:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:03:09,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:09,697 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:09,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 23:03:09,698 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash -112098769, now seen corresponding path program 1 times [2025-03-08 23:03:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440031774] [2025-03-08 23:03:09,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:03:09,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:03:09,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:09,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:09,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440031774] [2025-03-08 23:03:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440031774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150497378] [2025-03-08 23:03:09,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:09,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:09,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:03:09,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 23:03:09,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:03:10,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:03:10,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:10,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:10,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 23:03:10,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:10,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:03:10,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:03:10,077 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-08 23:03:10,083 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-08 23:03:10,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:10,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 23:03:10,139 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-08 23:03:10,150 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-08 23:03:10,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 23:03:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:10,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:10,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 23:03:10,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-08 23:03:10,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 23:03:10,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:03:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150497378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:10,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 14 [2025-03-08 23:03:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678217331] [2025-03-08 23:03:10,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:10,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 23:03:10,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:10,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 23:03:10,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:03:10,715 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:11,144 INFO L93 Difference]: Finished difference Result 223 states and 256 transitions. [2025-03-08 23:03:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 23:03:11,144 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 23:03:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:11,145 INFO L225 Difference]: With dead ends: 223 [2025-03-08 23:03:11,145 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 23:03:11,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-03-08 23:03:11,146 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 377 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:11,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 485 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 23:03:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 185. [2025-03-08 23:03:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 184 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 215 transitions. [2025-03-08 23:03:11,151 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 215 transitions. Word has length 29 [2025-03-08 23:03:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:11,152 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 215 transitions. [2025-03-08 23:03:11,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 215 transitions. [2025-03-08 23:03:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:03:11,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:11,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:11,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 23:03:11,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 23:03:11,357 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:11,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash 819863081, now seen corresponding path program 1 times [2025-03-08 23:03:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:11,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132231631] [2025-03-08 23:03:11,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:11,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:03:11,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:03:11,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:11,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:11,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:11,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132231631] [2025-03-08 23:03:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132231631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:11,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087470257] [2025-03-08 23:03:11,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:11,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:11,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:11,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:03:11,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 23:03:11,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:03:11,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:03:11,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:11,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:11,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:03:11,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:03:11,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:03:11,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087470257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:11,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:03:11,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2025-03-08 23:03:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520260530] [2025-03-08 23:03:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:03:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:11,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:03:11,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:11,522 INFO L87 Difference]: Start difference. First operand 185 states and 215 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:11,602 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2025-03-08 23:03:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:11,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 23:03:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:11,603 INFO L225 Difference]: With dead ends: 203 [2025-03-08 23:03:11,603 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 23:03:11,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-08 23:03:11,603 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 123 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:11,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 150 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 23:03:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2025-03-08 23:03:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 184 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2025-03-08 23:03:11,608 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 30 [2025-03-08 23:03:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:11,609 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2025-03-08 23:03:11,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2025-03-08 23:03:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:03:11,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:11,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:11,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 23:03:11,810 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,SelfDestructingSolverStorable22 [2025-03-08 23:03:11,811 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:11,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 263016364, now seen corresponding path program 1 times [2025-03-08 23:03:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:11,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251321357] [2025-03-08 23:03:11,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:11,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:03:11,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:03:11,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:11,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:11,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-08 23:03:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251321357] [2025-03-08 23:03:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251321357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 23:03:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756550008] [2025-03-08 23:03:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:03:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:11,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:03:11,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:03:11,970 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:12,284 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2025-03-08 23:03:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 23:03:12,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 23:03:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:12,285 INFO L225 Difference]: With dead ends: 210 [2025-03-08 23:03:12,285 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 23:03:12,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-08 23:03:12,286 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 229 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:12,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 448 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 23:03:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 183. [2025-03-08 23:03:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 182 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2025-03-08 23:03:12,289 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 30 [2025-03-08 23:03:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:12,289 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2025-03-08 23:03:12,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2025-03-08 23:03:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 23:03:12,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:12,290 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] [2025-03-08 23:03:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 23:03:12,290 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash -823270130, now seen corresponding path program 1 times [2025-03-08 23:03:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31817128] [2025-03-08 23:03:12,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:12,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 23:03:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 23:03:12,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:12,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:12,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31817128] [2025-03-08 23:03:12,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31817128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:12,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:12,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:03:12,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145889813] [2025-03-08 23:03:12,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:12,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:03:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:12,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:03:12,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:03:12,407 INFO L87 Difference]: Start difference. First operand 183 states and 211 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:12,607 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2025-03-08 23:03:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:03:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-08 23:03:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:12,609 INFO L225 Difference]: With dead ends: 219 [2025-03-08 23:03:12,609 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 23:03:12,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:03:12,610 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 10 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:12,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 521 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 23:03:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 189. [2025-03-08 23:03:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.2976190476190477) internal successors, (218), 188 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2025-03-08 23:03:12,613 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 32 [2025-03-08 23:03:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:12,613 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2025-03-08 23:03:12,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2025-03-08 23:03:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 23:03:12,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:12,614 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-08 23:03:12,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 23:03:12,614 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:12,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1980200173, now seen corresponding path program 1 times [2025-03-08 23:03:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620211494] [2025-03-08 23:03:12,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 23:03:12,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 23:03:12,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:12,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:03:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620211494] [2025-03-08 23:03:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620211494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:03:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033588074] [2025-03-08 23:03:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:03:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:12,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:03:12,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:03:12,720 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:12,861 INFO L93 Difference]: Finished difference Result 225 states and 257 transitions. [2025-03-08 23:03:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:03:12,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-08 23:03:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:12,862 INFO L225 Difference]: With dead ends: 225 [2025-03-08 23:03:12,862 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 23:03:12,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:03:12,863 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:12,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 339 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 23:03:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2025-03-08 23:03:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 204 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2025-03-08 23:03:12,867 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 35 [2025-03-08 23:03:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:12,868 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2025-03-08 23:03:12,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2025-03-08 23:03:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 23:03:12,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:12,868 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-08 23:03:12,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 23:03:12,868 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:12,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1980200878, now seen corresponding path program 1 times [2025-03-08 23:03:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742453992] [2025-03-08 23:03:12,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:12,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 23:03:12,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 23:03:12,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:12,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:03:12,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742453992] [2025-03-08 23:03:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742453992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:12,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:12,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:03:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758746192] [2025-03-08 23:03:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:12,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:03:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:12,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:03:12,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:03:12,912 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:13,002 INFO L93 Difference]: Finished difference Result 221 states and 245 transitions. [2025-03-08 23:03:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:13,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-08 23:03:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:13,003 INFO L225 Difference]: With dead ends: 221 [2025-03-08 23:03:13,003 INFO L226 Difference]: Without dead ends: 221 [2025-03-08 23:03:13,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:13,004 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 118 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:13,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 137 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-08 23:03:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 207. [2025-03-08 23:03:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 186 states have (on average 1.2741935483870968) internal successors, (237), 206 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 237 transitions. [2025-03-08 23:03:13,007 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 237 transitions. Word has length 35 [2025-03-08 23:03:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:13,007 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 237 transitions. [2025-03-08 23:03:13,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 237 transitions. [2025-03-08 23:03:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 23:03:13,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:13,008 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-08 23:03:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 23:03:13,008 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1011075054, now seen corresponding path program 1 times [2025-03-08 23:03:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536589239] [2025-03-08 23:03:13,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:13,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 23:03:13,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 23:03:13,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:13,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:13,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:13,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536589239] [2025-03-08 23:03:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536589239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:13,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 23:03:13,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405948445] [2025-03-08 23:03:13,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:13,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 23:03:13,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:13,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 23:03:13,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:03:13,323 INFO L87 Difference]: Start difference. First operand 207 states and 237 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:13,843 INFO L93 Difference]: Finished difference Result 220 states and 249 transitions. [2025-03-08 23:03:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:03:13,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-08 23:03:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:13,845 INFO L225 Difference]: With dead ends: 220 [2025-03-08 23:03:13,845 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 23:03:13,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-08 23:03:13,845 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 235 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:13,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 639 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:03:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 23:03:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 204. [2025-03-08 23:03:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 203 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2025-03-08 23:03:13,848 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 35 [2025-03-08 23:03:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:13,849 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2025-03-08 23:03:13,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2025-03-08 23:03:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 23:03:13,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:13,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:13,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 23:03:13,849 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:13,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1256663201, now seen corresponding path program 1 times [2025-03-08 23:03:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763105631] [2025-03-08 23:03:13,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:13,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 23:03:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 23:03:13,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:13,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763105631] [2025-03-08 23:03:14,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763105631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308665343] [2025-03-08 23:03:14,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:14,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:03:14,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:03:14,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 23:03:14,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 23:03:14,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:14,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:14,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 23:03:14,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:14,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:03:14,136 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-08 23:03:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:14,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:14,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 23:03:14,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2025-03-08 23:03:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308665343] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:03:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 8] total 22 [2025-03-08 23:03:14,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434125636] [2025-03-08 23:03:14,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:14,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:03:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:14,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:03:14,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-03-08 23:03:14,570 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:14,808 INFO L93 Difference]: Finished difference Result 211 states and 239 transitions. [2025-03-08 23:03:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:03:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-08 23:03:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:14,809 INFO L225 Difference]: With dead ends: 211 [2025-03-08 23:03:14,809 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 23:03:14,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2025-03-08 23:03:14,809 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 193 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:14,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 412 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 23:03:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 202. [2025-03-08 23:03:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 181 states have (on average 1.2651933701657458) internal successors, (229), 201 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 229 transitions. [2025-03-08 23:03:14,812 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 229 transitions. Word has length 36 [2025-03-08 23:03:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:14,813 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 229 transitions. [2025-03-08 23:03:14,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 229 transitions. [2025-03-08 23:03:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 23:03:14,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:14,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:14,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 23:03:15,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 23:03:15,017 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:15,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash 788520085, now seen corresponding path program 1 times [2025-03-08 23:03:15,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:15,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955751637] [2025-03-08 23:03:15,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:15,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 23:03:15,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 23:03:15,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:15,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:03:15,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:15,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955751637] [2025-03-08 23:03:15,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955751637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:15,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675781444] [2025-03-08 23:03:15,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:15,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:15,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:15,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:03:15,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:03:15,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 23:03:15,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 23:03:15,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:15,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:15,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 23:03:15,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:15,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 23:03:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:03:15,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:03:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675781444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:15,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:15,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 23:03:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266620774] [2025-03-08 23:03:15,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:15,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:03:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:15,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:03:15,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:03:15,268 INFO L87 Difference]: Start difference. First operand 202 states and 229 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:15,445 INFO L93 Difference]: Finished difference Result 228 states and 256 transitions. [2025-03-08 23:03:15,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:03:15,445 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 23:03:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:15,446 INFO L225 Difference]: With dead ends: 228 [2025-03-08 23:03:15,446 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 23:03:15,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:03:15,446 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 47 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:15,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 314 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 23:03:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 206. [2025-03-08 23:03:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2594594594594595) internal successors, (233), 205 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 233 transitions. [2025-03-08 23:03:15,449 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 233 transitions. Word has length 38 [2025-03-08 23:03:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 233 transitions. [2025-03-08 23:03:15,450 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 233 transitions. [2025-03-08 23:03:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 23:03:15,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:15,450 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:15,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 23:03:15,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:15,651 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:15,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash 788520885, now seen corresponding path program 1 times [2025-03-08 23:03:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:15,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154528895] [2025-03-08 23:03:15,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:15,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 23:03:15,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 23:03:15,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:15,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154528895] [2025-03-08 23:03:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154528895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653428052] [2025-03-08 23:03:15,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:15,754 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:03:15,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 23:03:15,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 23:03:15,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 23:03:15,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:15,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:15,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 23:03:15,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:16,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:16,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:16,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2025-03-08 23:03:16,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:16,165 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 34 treesize of output 37 [2025-03-08 23:03:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653428052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:16,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:16,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2025-03-08 23:03:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386310626] [2025-03-08 23:03:16,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:16,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 23:03:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:16,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 23:03:16,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-08 23:03:16,375 INFO L87 Difference]: Start difference. First operand 206 states and 233 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:17,199 INFO L93 Difference]: Finished difference Result 270 states and 305 transitions. [2025-03-08 23:03:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 23:03:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 23:03:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:17,200 INFO L225 Difference]: With dead ends: 270 [2025-03-08 23:03:17,200 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 23:03:17,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2025-03-08 23:03:17,201 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 446 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 41 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:17,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 828 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 789 Invalid, 6 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 23:03:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 23:03:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 197. [2025-03-08 23:03:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 176 states have (on average 1.2954545454545454) internal successors, (228), 196 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2025-03-08 23:03:17,204 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 38 [2025-03-08 23:03:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:17,204 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2025-03-08 23:03:17,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2025-03-08 23:03:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 23:03:17,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:17,205 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:17,211 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-08 23:03:17,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:17,409 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:17,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash 281613688, now seen corresponding path program 1 times [2025-03-08 23:03:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403147753] [2025-03-08 23:03:17,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:17,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 23:03:17,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 23:03:17,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:17,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403147753] [2025-03-08 23:03:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403147753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754751025] [2025-03-08 23:03:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:17,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:17,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:17,817 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:03:17,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 23:03:17,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 23:03:17,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 23:03:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:17,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 23:03:17,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:17,922 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-08 23:03:17,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:03:17,963 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-08 23:03:18,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:03:18,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:03:18,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:03:18,053 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-08 23:03:18,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:03:18,152 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:03:18,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-03-08 23:03:18,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:03:18,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-08 23:03:18,225 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-08 23:03:18,243 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-08 23:03:18,251 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-08 23:03:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:18,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:18,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) is different from false [2025-03-08 23:03:18,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1195 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) 2))) is different from false [2025-03-08 23:03:18,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1192) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) is different from false [2025-03-08 23:03:18,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (not (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1192) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1191) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1195)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) 2))) is different from false [2025-03-08 23:03:18,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:18,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2025-03-08 23:03:18,459 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 73 treesize of output 65 [2025-03-08 23:03:18,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2025-03-08 23:03:18,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) (.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_1188 Int) (v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1188)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (or (forall ((v_ArrVal_1192 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_1188 Int) (v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1188)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1192) v_arrayElimCell_30 v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) (not .cse0)))) is different from false [2025-03-08 23:03:20,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-08 23:03:20,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:20,803 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:20,805 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-08 23:03:20,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 1 [2025-03-08 23:03:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754751025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:24,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 40 [2025-03-08 23:03:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869282578] [2025-03-08 23:03:24,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:24,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 23:03:24,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:24,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 23:03:24,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1056, Unknown=18, NotChecked=350, Total=1560 [2025-03-08 23:03:24,924 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 40 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:26,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))) (and (or (forall ((v_ArrVal_1192 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1192) v_arrayElimCell_30 v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (not (= .cse1 0))) (= (select .cse2 8) |c_ULTIMATE.start_main_~head~0#1.base|) (or (not (= .cse3 0)) (forall ((v_ArrVal_1192 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_1195 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1192) v_arrayElimCell_30 v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 2)))) (= .cse3 1) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|) 0)) (forall ((v_ArrVal_1188 Int) (v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1188)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) (forall ((v_ArrVal_1185 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_81|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| Int)) (or (forall ((v_ArrVal_1188 Int) (v_ArrVal_1195 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1185) |v_ULTIMATE.start_main_~x~0#1.offset_81| v_ArrVal_1188)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|) 0)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_12| |c_ULTIMATE.start_main_~head~0#1.base|))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select .cse2 .cse6) |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_81|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| Int)) (or (forall ((v_ArrVal_1188 Int) (v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse5 |v_ULTIMATE.start_main_~x~0#1.offset_81| v_ArrVal_1188)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|) 0)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_12| |c_ULTIMATE.start_main_~head~0#1.base|))))) (not (= 2 (select .cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (= .cse1 1) (not (= (select .cse5 .cse0) 2)) (= (select .cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (not (= (select (select (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int#1| .cse8 v_ArrVal_1192) (select (select (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_1191) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1195)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 2))))) is different from false [2025-03-08 23:03:31,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 23:03:35,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 23:03:36,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))) (and (or (not (= .cse0 0)) (forall ((v_ArrVal_1192 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_1195 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1192) v_arrayElimCell_30 v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 2)))) (= .cse0 1) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|) 0)) (forall ((v_ArrVal_1188 Int) (v_ArrVal_1195 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1188)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1195) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 12) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= 2 (select .cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select .cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (not (= (select (select (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int#1| .cse4 v_ArrVal_1192) (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1191) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1195)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 2))))) is different from false [2025-03-08 23:03:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:38,131 INFO L93 Difference]: Finished difference Result 738 states and 841 transitions. [2025-03-08 23:03:38,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-08 23:03:38,131 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 23:03:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:38,133 INFO L225 Difference]: With dead ends: 738 [2025-03-08 23:03:38,133 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 23:03:38,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2390 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1403, Invalid=7323, Unknown=44, NotChecked=1330, Total=10100 [2025-03-08 23:03:38,135 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1584 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 362 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 5509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 2926 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:38,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 2018 Invalid, 5509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2192 Invalid, 29 Unknown, 2926 Unchecked, 10.1s Time] [2025-03-08 23:03:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 23:03:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 256. [2025-03-08 23:03:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.2595744680851064) internal successors, (296), 255 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2025-03-08 23:03:38,143 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 38 [2025-03-08 23:03:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:38,143 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2025-03-08 23:03:38,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2025-03-08 23:03:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:03:38,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:38,144 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:38,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 23:03:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:38,345 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-03-08 23:03:38,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 862797644, now seen corresponding path program 1 times [2025-03-08 23:03:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76225713] [2025-03-08 23:03:38,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:38,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:03:38,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:03:38,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:38,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:39,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76225713] [2025-03-08 23:03:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76225713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115309728] [2025-03-08 23:03:39,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:39,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:39,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:03:39,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 23:03:39,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:03:39,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:03:39,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:39,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:39,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 23:03:39,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:39,189 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-08 23:03:39,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:03:39,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:03:39,358 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:03:39,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:03:39,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:03:39,417 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-08 23:03:39,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:03:39,436 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-08 23:03:39,565 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:03:39,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 43 [2025-03-08 23:03:39,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:03:39,874 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-08 23:03:39,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-08 23:03:39,911 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:39,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 23:03:40,021 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:40,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 23:03:40,041 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-08 23:03:40,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-08 23:03:40,096 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:03:40,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2025-03-08 23:03:40,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:03:40,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:03:40,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:40,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:03:40,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 23:03:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:40,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:40,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1326) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1327 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1327) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2025-03-08 23:03:40,752 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1319) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1320) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1327) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1320 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1320))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1326)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2025-03-08 23:03:40,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1319) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1320) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1327) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1320 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1320))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1326)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2025-03-08 23:03:44,519 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:44,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:44,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2025-03-08 23:03:44,529 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:44,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:44,532 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 128 treesize of output 88 [2025-03-08 23:03:44,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 23:03:44,539 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:44,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-08 23:03:44,550 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:44,553 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 23:03:44,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2025-03-08 23:03:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115309728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:44,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:44,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 38 [2025-03-08 23:03:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684247810] [2025-03-08 23:03:44,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:44,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 23:03:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:44,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 23:03:44,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=999, Unknown=35, NotChecked=204, Total=1406 [2025-03-08 23:03:44,604 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand has 38 states, 38 states have (on average 3.0) internal successors, (114), 38 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:03:48,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 23:03:52,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 23:03:56,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 23:04:00,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 23:04:05,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 23:04:13,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 23:04:17,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 23:04:21,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 23:04:25,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 23:04:31,353 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1327) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false