./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_13.c -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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:21:37,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:21:37,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:21:37,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:21:37,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:21:37,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:21:37,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:21:37,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:21:37,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:21:37,290 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:21:37,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:21:37,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:21:37,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:21:37,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:21:37,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:21:37,291 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:21:37,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:37,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:21:37,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:21:37,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:21:37,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:21:37,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:21:37,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:21:37,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:21:37,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:21:37,293 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2025-03-17 12:21:37,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:21:37,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:21:37,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:21:37,547 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:21:37,547 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:21:37,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2025-03-17 12:21:38,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8ea9ffc/03db4b911a9c4a8caeb8b987c685c659/FLAG21ecff57f [2025-03-17 12:21:38,957 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:21:38,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2025-03-17 12:21:38,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8ea9ffc/03db4b911a9c4a8caeb8b987c685c659/FLAG21ecff57f [2025-03-17 12:21:39,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8ea9ffc/03db4b911a9c4a8caeb8b987c685c659 [2025-03-17 12:21:39,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:21:39,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:21:39,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:39,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:21:39,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:21:39,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39, skipping insertion in model container [2025-03-17 12:21:39,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:21:39,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:39,396 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:21:39,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:39,432 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:21:39,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39 WrapperNode [2025-03-17 12:21:39,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:39,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:39,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:21:39,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:21:39,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,464 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 182 [2025-03-17 12:21:39,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:39,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:21:39,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:21:39,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:21:39,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 12:21:39,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:21:39,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:21:39,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:21:39,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:21:39,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (1/1) ... [2025-03-17 12:21:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:39,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:39,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:21:39,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:21:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:21:39,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:21:39,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:21:39,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:21:39,808 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-17 12:21:39,808 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:21:39,816 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:21:39,817 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:21:39,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:39 BoogieIcfgContainer [2025-03-17 12:21:39,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:21:39,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:21:39,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:21:39,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:21:39,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:21:39" (1/3) ... [2025-03-17 12:21:39,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd02908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:39, skipping insertion in model container [2025-03-17 12:21:39,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:39" (2/3) ... [2025-03-17 12:21:39,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd02908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:39, skipping insertion in model container [2025-03-17 12:21:39,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:39" (3/3) ... [2025-03-17 12:21:39,825 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2025-03-17 12:21:39,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:21:39,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_13.c that has 1 procedures, 50 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-17 12:21:39,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:21:39,880 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;@60ba174c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:21:39,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 12:21:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 49 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:21:39,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:39,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:21:39,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:39,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash 4982042, now seen corresponding path program 1 times [2025-03-17 12:21:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708767248] [2025-03-17 12:21:39,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:39,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:21:39,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:21:39,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:39,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:39,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708767248] [2025-03-17 12:21:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708767248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:39,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:39,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:21:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072820025] [2025-03-17 12:21:40,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:21:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:21:40,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:21:40,023 INFO L87 Difference]: Start difference. First operand has 50 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 49 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,031 INFO L93 Difference]: Finished difference Result 50 states and 88 transitions. [2025-03-17 12:21:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:21:40,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-17 12:21:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,037 INFO L225 Difference]: With dead ends: 50 [2025-03-17 12:21:40,038 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 12:21:40,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:21:40,040 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 12:21:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 12:21:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 86 transitions. [2025-03-17 12:21:40,061 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 86 transitions. Word has length 4 [2025-03-17 12:21:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,061 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 86 transitions. [2025-03-17 12:21:40,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 86 transitions. [2025-03-17 12:21:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:21:40,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:21:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:21:40,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash 154529018, now seen corresponding path program 1 times [2025-03-17 12:21:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410988497] [2025-03-17 12:21:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:21:40,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:21:40,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410988497] [2025-03-17 12:21:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410988497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:21:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78991669] [2025-03-17 12:21:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,120 INFO L87 Difference]: Start difference. First operand 48 states and 86 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,126 INFO L93 Difference]: Finished difference Result 47 states and 85 transitions. [2025-03-17 12:21:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 12:21:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,128 INFO L225 Difference]: With dead ends: 47 [2025-03-17 12:21:40,128 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 12:21:40,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,129 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 12:21:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 12:21:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 83 transitions. [2025-03-17 12:21:40,132 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 83 transitions. Word has length 5 [2025-03-17 12:21:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,132 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 83 transitions. [2025-03-17 12:21:40,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2025-03-17 12:21:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:21:40,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:21:40,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1725293686, now seen corresponding path program 1 times [2025-03-17 12:21:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948829480] [2025-03-17 12:21:40,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:21:40,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:21:40,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948829480] [2025-03-17 12:21:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948829480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52911317] [2025-03-17 12:21:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,196 INFO L87 Difference]: Start difference. First operand 45 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 12:21:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,217 INFO L93 Difference]: Finished difference Result 88 states and 162 transitions. [2025-03-17 12:21:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 12:21:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,218 INFO L225 Difference]: With dead ends: 88 [2025-03-17 12:21:40,219 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 12:21:40,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,219 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 12:21:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 59. [2025-03-17 12:21:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2025-03-17 12:21:40,226 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2025-03-17 12:21:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,226 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2025-03-17 12:21:40,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 12:21:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2025-03-17 12:21:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:21:40,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:21:40,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,227 INFO L85 PathProgramCache]: Analyzing trace with hash -371983989, now seen corresponding path program 1 times [2025-03-17 12:21:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925887631] [2025-03-17 12:21:40,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:21:40,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:21:40,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925887631] [2025-03-17 12:21:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925887631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070776081] [2025-03-17 12:21:40,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,299 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 12:21:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,324 INFO L93 Difference]: Finished difference Result 88 states and 160 transitions. [2025-03-17 12:21:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 12:21:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,327 INFO L225 Difference]: With dead ends: 88 [2025-03-17 12:21:40,327 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 12:21:40,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,328 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 12:21:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2025-03-17 12:21:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2025-03-17 12:21:40,337 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2025-03-17 12:21:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,337 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2025-03-17 12:21:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 12:21:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2025-03-17 12:21:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:21:40,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:21:40,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1943613520, now seen corresponding path program 1 times [2025-03-17 12:21:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354244986] [2025-03-17 12:21:40,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:21:40,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:21:40,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354244986] [2025-03-17 12:21:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354244986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571373897] [2025-03-17 12:21:40,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,397 INFO L87 Difference]: Start difference. First operand 85 states and 158 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,417 INFO L93 Difference]: Finished difference Result 91 states and 162 transitions. [2025-03-17 12:21:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 12:21:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,418 INFO L225 Difference]: With dead ends: 91 [2025-03-17 12:21:40,419 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 12:21:40,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,419 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 209 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 12:21:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2025-03-17 12:21:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 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-17 12:21:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2025-03-17 12:21:40,426 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2025-03-17 12:21:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,426 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2025-03-17 12:21:40,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2025-03-17 12:21:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:21:40,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:21:40,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1354281423, now seen corresponding path program 1 times [2025-03-17 12:21:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261243790] [2025-03-17 12:21:40,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:21:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:21:40,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261243790] [2025-03-17 12:21:40,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261243790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429985993] [2025-03-17 12:21:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,465 INFO L87 Difference]: Start difference. First operand 88 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,483 INFO L93 Difference]: Finished difference Result 168 states and 307 transitions. [2025-03-17 12:21:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 12:21:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,484 INFO L225 Difference]: With dead ends: 168 [2025-03-17 12:21:40,484 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 12:21:40,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,484 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 12:21:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 117. [2025-03-17 12:21:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2025-03-17 12:21:40,496 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2025-03-17 12:21:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,496 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2025-03-17 12:21:40,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2025-03-17 12:21:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:21:40,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:21:40,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1587376176, now seen corresponding path program 1 times [2025-03-17 12:21:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456404391] [2025-03-17 12:21:40,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:21:40,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:21:40,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456404391] [2025-03-17 12:21:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456404391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758513469] [2025-03-17 12:21:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,545 INFO L87 Difference]: Start difference. First operand 117 states and 213 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,564 INFO L93 Difference]: Finished difference Result 170 states and 305 transitions. [2025-03-17 12:21:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 12:21:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,565 INFO L225 Difference]: With dead ends: 170 [2025-03-17 12:21:40,565 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 12:21:40,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,566 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 12:21:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2025-03-17 12:21:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2025-03-17 12:21:40,577 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2025-03-17 12:21:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,577 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2025-03-17 12:21:40,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2025-03-17 12:21:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:40,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:21:40,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,579 INFO L85 PathProgramCache]: Analyzing trace with hash -966072380, now seen corresponding path program 1 times [2025-03-17 12:21:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277116467] [2025-03-17 12:21:40,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:40,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:40,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277116467] [2025-03-17 12:21:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277116467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423541468] [2025-03-17 12:21:40,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,603 INFO L87 Difference]: Start difference. First operand 167 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,620 INFO L93 Difference]: Finished difference Result 172 states and 305 transitions. [2025-03-17 12:21:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:21:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,621 INFO L225 Difference]: With dead ends: 172 [2025-03-17 12:21:40,621 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 12:21:40,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,622 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 65 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 205 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 12:21:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2025-03-17 12:21:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2025-03-17 12:21:40,627 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2025-03-17 12:21:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,628 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2025-03-17 12:21:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2025-03-17 12:21:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:40,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:21:40,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1963144733, now seen corresponding path program 1 times [2025-03-17 12:21:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168715053] [2025-03-17 12:21:40,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:40,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:40,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168715053] [2025-03-17 12:21:40,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168715053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037346674] [2025-03-17 12:21:40,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,663 INFO L87 Difference]: Start difference. First operand 169 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,677 INFO L93 Difference]: Finished difference Result 320 states and 577 transitions. [2025-03-17 12:21:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:21:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,679 INFO L225 Difference]: With dead ends: 320 [2025-03-17 12:21:40,679 INFO L226 Difference]: Without dead ends: 320 [2025-03-17 12:21:40,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,679 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 58 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-17 12:21:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 229. [2025-03-17 12:21:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.7850877192982457) internal successors, (407), 228 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 407 transitions. [2025-03-17 12:21:40,687 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 407 transitions. Word has length 22 [2025-03-17 12:21:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,688 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 407 transitions. [2025-03-17 12:21:40,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 407 transitions. [2025-03-17 12:21:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:40,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:21:40,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,689 INFO L85 PathProgramCache]: Analyzing trace with hash -609835036, now seen corresponding path program 1 times [2025-03-17 12:21:40,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231123716] [2025-03-17 12:21:40,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:40,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:40,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231123716] [2025-03-17 12:21:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231123716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928419310] [2025-03-17 12:21:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,710 INFO L87 Difference]: Start difference. First operand 229 states and 407 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,720 INFO L93 Difference]: Finished difference Result 328 states and 577 transitions. [2025-03-17 12:21:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:21:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,721 INFO L225 Difference]: With dead ends: 328 [2025-03-17 12:21:40,721 INFO L226 Difference]: Without dead ends: 328 [2025-03-17 12:21:40,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,722 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 62 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-17 12:21:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2025-03-17 12:21:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2025-03-17 12:21:40,728 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2025-03-17 12:21:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,729 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2025-03-17 12:21:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2025-03-17 12:21:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:21:40,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:21:40,730 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash -727074839, now seen corresponding path program 1 times [2025-03-17 12:21:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901678993] [2025-03-17 12:21:40,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:21:40,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:21:40,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901678993] [2025-03-17 12:21:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901678993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650941810] [2025-03-17 12:21:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,753 INFO L87 Difference]: Start difference. First operand 325 states and 575 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,767 INFO L93 Difference]: Finished difference Result 332 states and 577 transitions. [2025-03-17 12:21:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 12:21:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,768 INFO L225 Difference]: With dead ends: 332 [2025-03-17 12:21:40,768 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 12:21:40,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,769 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 12:21:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2025-03-17 12:21:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.7530487804878048) internal successors, (575), 328 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 575 transitions. [2025-03-17 12:21:40,777 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 575 transitions. Word has length 23 [2025-03-17 12:21:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,778 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 575 transitions. [2025-03-17 12:21:40,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 575 transitions. [2025-03-17 12:21:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:21:40,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:21:40,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1724147192, now seen corresponding path program 1 times [2025-03-17 12:21:40,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991424929] [2025-03-17 12:21:40,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:21:40,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:21:40,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991424929] [2025-03-17 12:21:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991424929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068833806] [2025-03-17 12:21:40,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,808 INFO L87 Difference]: Start difference. First operand 329 states and 575 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,821 INFO L93 Difference]: Finished difference Result 616 states and 1085 transitions. [2025-03-17 12:21:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 12:21:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,823 INFO L225 Difference]: With dead ends: 616 [2025-03-17 12:21:40,823 INFO L226 Difference]: Without dead ends: 616 [2025-03-17 12:21:40,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,824 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 55 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-17 12:21:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 453. [2025-03-17 12:21:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.7234513274336283) internal successors, (779), 452 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 779 transitions. [2025-03-17 12:21:40,832 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 779 transitions. Word has length 23 [2025-03-17 12:21:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,832 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 779 transitions. [2025-03-17 12:21:40,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 779 transitions. [2025-03-17 12:21:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:21:40,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:21:40,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash -370837495, now seen corresponding path program 1 times [2025-03-17 12:21:40,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636746568] [2025-03-17 12:21:40,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:21:40,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:21:40,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636746568] [2025-03-17 12:21:40,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636746568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848746356] [2025-03-17 12:21:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,853 INFO L87 Difference]: Start difference. First operand 453 states and 779 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,865 INFO L93 Difference]: Finished difference Result 640 states and 1093 transitions. [2025-03-17 12:21:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 12:21:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,868 INFO L225 Difference]: With dead ends: 640 [2025-03-17 12:21:40,868 INFO L226 Difference]: Without dead ends: 640 [2025-03-17 12:21:40,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,868 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 61 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-17 12:21:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 637. [2025-03-17 12:21:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 1.7154088050314464) internal successors, (1091), 636 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1091 transitions. [2025-03-17 12:21:40,878 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1091 transitions. Word has length 23 [2025-03-17 12:21:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,878 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 1091 transitions. [2025-03-17 12:21:40,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1091 transitions. [2025-03-17 12:21:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:21:40,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:21:40,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1908092387, now seen corresponding path program 1 times [2025-03-17 12:21:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329584060] [2025-03-17 12:21:40,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:21:40,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:21:40,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329584060] [2025-03-17 12:21:40,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329584060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23480874] [2025-03-17 12:21:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,899 INFO L87 Difference]: Start difference. First operand 637 states and 1091 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-17 12:21:40,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,909 INFO L93 Difference]: Finished difference Result 648 states and 1093 transitions. [2025-03-17 12:21:40,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,910 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-17 12:21:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,912 INFO L225 Difference]: With dead ends: 648 [2025-03-17 12:21:40,912 INFO L226 Difference]: Without dead ends: 648 [2025-03-17 12:21:40,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,913 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 63 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-17 12:21:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2025-03-17 12:21:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.6940993788819876) internal successors, (1091), 644 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1091 transitions. [2025-03-17 12:21:40,943 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1091 transitions. Word has length 24 [2025-03-17 12:21:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:40,943 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1091 transitions. [2025-03-17 12:21:40,943 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-17 12:21:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1091 transitions. [2025-03-17 12:21:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:21:40,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:40,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:40,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:21:40,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:40,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:40,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1389802556, now seen corresponding path program 1 times [2025-03-17 12:21:40,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:40,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579255191] [2025-03-17 12:21:40,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:40,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:21:40,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:21:40,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:40,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:40,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579255191] [2025-03-17 12:21:40,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579255191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:40,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:40,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:40,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618249618] [2025-03-17 12:21:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:40,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:40,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:40,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:40,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,968 INFO L87 Difference]: Start difference. First operand 645 states and 1091 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-17 12:21:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:40,980 INFO L93 Difference]: Finished difference Result 1192 states and 2037 transitions. [2025-03-17 12:21:40,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:40,980 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-17 12:21:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:40,985 INFO L225 Difference]: With dead ends: 1192 [2025-03-17 12:21:40,985 INFO L226 Difference]: Without dead ends: 1192 [2025-03-17 12:21:40,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:40,986 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 52 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:40,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-03-17 12:21:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 901. [2025-03-17 12:21:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.6566666666666667) internal successors, (1491), 900 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1491 transitions. [2025-03-17 12:21:41,001 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1491 transitions. Word has length 24 [2025-03-17 12:21:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,001 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1491 transitions. [2025-03-17 12:21:41,001 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-17 12:21:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1491 transitions. [2025-03-17 12:21:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:21:41,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:21:41,003 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1551855043, now seen corresponding path program 1 times [2025-03-17 12:21:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645347899] [2025-03-17 12:21:41,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:21:41,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:21:41,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645347899] [2025-03-17 12:21:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645347899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572742464] [2025-03-17 12:21:41,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,029 INFO L87 Difference]: Start difference. First operand 901 states and 1491 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-17 12:21:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,041 INFO L93 Difference]: Finished difference Result 1256 states and 2069 transitions. [2025-03-17 12:21:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,041 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-17 12:21:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,044 INFO L225 Difference]: With dead ends: 1256 [2025-03-17 12:21:41,044 INFO L226 Difference]: Without dead ends: 1256 [2025-03-17 12:21:41,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,045 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-03-17 12:21:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1253. [2025-03-17 12:21:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.650958466453674) internal successors, (2067), 1252 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2067 transitions. [2025-03-17 12:21:41,068 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2067 transitions. Word has length 24 [2025-03-17 12:21:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,068 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 2067 transitions. [2025-03-17 12:21:41,068 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-17 12:21:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2067 transitions. [2025-03-17 12:21:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:21:41,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:21:41,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 135062562, now seen corresponding path program 1 times [2025-03-17 12:21:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466950015] [2025-03-17 12:21:41,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:21:41,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:21:41,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466950015] [2025-03-17 12:21:41,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466950015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400566477] [2025-03-17 12:21:41,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,099 INFO L87 Difference]: Start difference. First operand 1253 states and 2067 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,114 INFO L93 Difference]: Finished difference Result 1272 states and 2069 transitions. [2025-03-17 12:21:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 12:21:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,117 INFO L225 Difference]: With dead ends: 1272 [2025-03-17 12:21:41,117 INFO L226 Difference]: Without dead ends: 1272 [2025-03-17 12:21:41,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,118 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 62 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2025-03-17 12:21:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1269. [2025-03-17 12:21:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.6301261829652998) internal successors, (2067), 1268 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2067 transitions. [2025-03-17 12:21:41,135 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2067 transitions. Word has length 25 [2025-03-17 12:21:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,135 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 2067 transitions. [2025-03-17 12:21:41,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2067 transitions. [2025-03-17 12:21:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:21:41,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:21:41,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,137 INFO L85 PathProgramCache]: Analyzing trace with hash -862009791, now seen corresponding path program 1 times [2025-03-17 12:21:41,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952652769] [2025-03-17 12:21:41,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:21:41,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:21:41,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952652769] [2025-03-17 12:21:41,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952652769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702341217] [2025-03-17 12:21:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,161 INFO L87 Difference]: Start difference. First operand 1269 states and 2067 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,176 INFO L93 Difference]: Finished difference Result 2312 states and 3813 transitions. [2025-03-17 12:21:41,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 12:21:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,182 INFO L225 Difference]: With dead ends: 2312 [2025-03-17 12:21:41,182 INFO L226 Difference]: Without dead ends: 2312 [2025-03-17 12:21:41,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,183 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 49 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2025-03-17 12:21:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1797. [2025-03-17 12:21:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 1.5874164810690423) internal successors, (2851), 1796 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2851 transitions. [2025-03-17 12:21:41,208 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2851 transitions. Word has length 25 [2025-03-17 12:21:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,208 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2851 transitions. [2025-03-17 12:21:41,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2851 transitions. [2025-03-17 12:21:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:21:41,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:21:41,210 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash 491299906, now seen corresponding path program 1 times [2025-03-17 12:21:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220321485] [2025-03-17 12:21:41,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:21:41,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:21:41,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220321485] [2025-03-17 12:21:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220321485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249969362] [2025-03-17 12:21:41,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,227 INFO L87 Difference]: Start difference. First operand 1797 states and 2851 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,244 INFO L93 Difference]: Finished difference Result 2472 states and 3909 transitions. [2025-03-17 12:21:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 12:21:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,250 INFO L225 Difference]: With dead ends: 2472 [2025-03-17 12:21:41,250 INFO L226 Difference]: Without dead ends: 2472 [2025-03-17 12:21:41,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,250 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2025-03-17 12:21:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2469. [2025-03-17 12:21:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.5830632090761751) internal successors, (3907), 2468 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3907 transitions. [2025-03-17 12:21:41,292 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3907 transitions. Word has length 25 [2025-03-17 12:21:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,293 INFO L471 AbstractCegarLoop]: Abstraction has 2469 states and 3907 transitions. [2025-03-17 12:21:41,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3907 transitions. [2025-03-17 12:21:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:21:41,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:21:41,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -951650186, now seen corresponding path program 1 times [2025-03-17 12:21:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-03-17 12:21:41,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:21:41,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:21:41,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-03-17 12:21:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141021097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49464005] [2025-03-17 12:21:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,311 INFO L87 Difference]: Start difference. First operand 2469 states and 3907 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,326 INFO L93 Difference]: Finished difference Result 2504 states and 3909 transitions. [2025-03-17 12:21:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,331 INFO L225 Difference]: With dead ends: 2504 [2025-03-17 12:21:41,331 INFO L226 Difference]: Without dead ends: 2504 [2025-03-17 12:21:41,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,332 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 189 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2025-03-17 12:21:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2501. [2025-03-17 12:21:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.5628) internal successors, (3907), 2500 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3907 transitions. [2025-03-17 12:21:41,363 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3907 transitions. Word has length 26 [2025-03-17 12:21:41,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,363 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3907 transitions. [2025-03-17 12:21:41,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3907 transitions. [2025-03-17 12:21:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:21:41,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 12:21:41,365 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1948722539, now seen corresponding path program 1 times [2025-03-17 12:21:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017962505] [2025-03-17 12:21:41,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:21:41,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:21:41,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017962505] [2025-03-17 12:21:41,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017962505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237270879] [2025-03-17 12:21:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,382 INFO L87 Difference]: Start difference. First operand 2501 states and 3907 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,404 INFO L93 Difference]: Finished difference Result 4872 states and 7429 transitions. [2025-03-17 12:21:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,416 INFO L225 Difference]: With dead ends: 4872 [2025-03-17 12:21:41,416 INFO L226 Difference]: Without dead ends: 4872 [2025-03-17 12:21:41,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,417 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2025-03-17 12:21:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4869. [2025-03-17 12:21:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.5256778964667215) internal successors, (7427), 4868 states have internal predecessors, (7427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7427 transitions. [2025-03-17 12:21:41,492 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7427 transitions. Word has length 26 [2025-03-17 12:21:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,492 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 7427 transitions. [2025-03-17 12:21:41,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7427 transitions. [2025-03-17 12:21:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:21:41,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:21:41,496 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 992935060, now seen corresponding path program 1 times [2025-03-17 12:21:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240483706] [2025-03-17 12:21:41,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:21:41,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:21:41,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240483706] [2025-03-17 12:21:41,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240483706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391878626] [2025-03-17 12:21:41,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,513 INFO L87 Difference]: Start difference. First operand 4869 states and 7427 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,537 INFO L93 Difference]: Finished difference Result 5768 states and 9029 transitions. [2025-03-17 12:21:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,550 INFO L225 Difference]: With dead ends: 5768 [2025-03-17 12:21:41,550 INFO L226 Difference]: Without dead ends: 5768 [2025-03-17 12:21:41,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,551 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2025-03-17 12:21:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 4869. [2025-03-17 12:21:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.51253081347576) internal successors, (7363), 4868 states have internal predecessors, (7363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7363 transitions. [2025-03-17 12:21:41,621 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7363 transitions. Word has length 26 [2025-03-17 12:21:41,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,621 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 7363 transitions. [2025-03-17 12:21:41,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-17 12:21:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7363 transitions. [2025-03-17 12:21:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:21:41,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 12:21:41,624 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -280013733, now seen corresponding path program 1 times [2025-03-17 12:21:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207686726] [2025-03-17 12:21:41,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:21:41,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:21:41,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207686726] [2025-03-17 12:21:41,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207686726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568349518] [2025-03-17 12:21:41,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,643 INFO L87 Difference]: Start difference. First operand 4869 states and 7363 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 12:21:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,700 INFO L93 Difference]: Finished difference Result 8648 states and 13253 transitions. [2025-03-17 12:21:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 12:21:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,712 INFO L225 Difference]: With dead ends: 8648 [2025-03-17 12:21:41,712 INFO L226 Difference]: Without dead ends: 8648 [2025-03-17 12:21:41,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,712 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8648 states. [2025-03-17 12:21:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8648 to 7109. [2025-03-17 12:21:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7109 states, 7108 states have (on average 1.4680641530669667) internal successors, (10435), 7108 states have internal predecessors, (10435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 10435 transitions. [2025-03-17 12:21:41,809 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 10435 transitions. Word has length 27 [2025-03-17 12:21:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:41,809 INFO L471 AbstractCegarLoop]: Abstraction has 7109 states and 10435 transitions. [2025-03-17 12:21:41,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 12:21:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 10435 transitions. [2025-03-17 12:21:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:21:41,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:41,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:41,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:21:41,815 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:41,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1073295964, now seen corresponding path program 1 times [2025-03-17 12:21:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:41,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356651590] [2025-03-17 12:21:41,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:41,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:21:41,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:21:41,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:41,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356651590] [2025-03-17 12:21:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356651590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:41,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295962738] [2025-03-17 12:21:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:41,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:41,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:41,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,839 INFO L87 Difference]: Start difference. First operand 7109 states and 10435 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 12:21:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:41,885 INFO L93 Difference]: Finished difference Result 9544 states and 13957 transitions. [2025-03-17 12:21:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 12:21:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:41,923 INFO L225 Difference]: With dead ends: 9544 [2025-03-17 12:21:41,923 INFO L226 Difference]: Without dead ends: 9544 [2025-03-17 12:21:41,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:41,924 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:41,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2025-03-17 12:21:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9541. [2025-03-17 12:21:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9541 states, 9540 states have (on average 1.4627882599580713) internal successors, (13955), 9540 states have internal predecessors, (13955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9541 states to 9541 states and 13955 transitions. [2025-03-17 12:21:42,086 INFO L78 Accepts]: Start accepts. Automaton has 9541 states and 13955 transitions. Word has length 27 [2025-03-17 12:21:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:42,086 INFO L471 AbstractCegarLoop]: Abstraction has 9541 states and 13955 transitions. [2025-03-17 12:21:42,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 12:21:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 9541 states and 13955 transitions. [2025-03-17 12:21:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:21:42,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:42,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:42,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 12:21:42,095 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:42,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -89655026, now seen corresponding path program 1 times [2025-03-17 12:21:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:42,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327019102] [2025-03-17 12:21:42,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:42,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:21:42,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:21:42,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:42,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327019102] [2025-03-17 12:21:42,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327019102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:42,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:42,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:42,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006745591] [2025-03-17 12:21:42,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:42,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:42,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:42,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:42,125 INFO L87 Difference]: Start difference. First operand 9541 states and 13955 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:42,170 INFO L93 Difference]: Finished difference Result 9736 states and 14085 transitions. [2025-03-17 12:21:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:42,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 12:21:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:42,183 INFO L225 Difference]: With dead ends: 9736 [2025-03-17 12:21:42,184 INFO L226 Difference]: Without dead ends: 9736 [2025-03-17 12:21:42,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:42,184 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:42,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9736 states. [2025-03-17 12:21:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9736 to 9733. [2025-03-17 12:21:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2025-03-17 12:21:42,331 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2025-03-17 12:21:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:42,331 INFO L471 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2025-03-17 12:21:42,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2025-03-17 12:21:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:21:42,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:42,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:42,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 12:21:42,338 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:42,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1086727379, now seen corresponding path program 1 times [2025-03-17 12:21:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955805619] [2025-03-17 12:21:42,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:42,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:21:42,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:21:42,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:42,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:42,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955805619] [2025-03-17 12:21:42,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955805619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:42,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:42,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:42,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677534024] [2025-03-17 12:21:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:42,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:42,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:42,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:42,355 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:42,399 INFO L93 Difference]: Finished difference Result 16904 states and 24709 transitions. [2025-03-17 12:21:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:42,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 12:21:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:42,425 INFO L225 Difference]: With dead ends: 16904 [2025-03-17 12:21:42,425 INFO L226 Difference]: Without dead ends: 16904 [2025-03-17 12:21:42,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:42,426 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 40 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:42,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16904 states. [2025-03-17 12:21:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16904 to 14341. [2025-03-17 12:21:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 20099 transitions. [2025-03-17 12:21:42,634 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 20099 transitions. Word has length 28 [2025-03-17 12:21:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:42,634 INFO L471 AbstractCegarLoop]: Abstraction has 14341 states and 20099 transitions. [2025-03-17 12:21:42,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 20099 transitions. [2025-03-17 12:21:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:21:42,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:42,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:42,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 12:21:42,646 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:42,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash 266582318, now seen corresponding path program 1 times [2025-03-17 12:21:42,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:42,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601712085] [2025-03-17 12:21:42,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:42,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:21:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:21:42,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:42,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:42,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:42,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601712085] [2025-03-17 12:21:42,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601712085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:42,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:42,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:42,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817797260] [2025-03-17 12:21:42,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:42,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:42,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:42,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:42,662 INFO L87 Difference]: Start difference. First operand 14341 states and 20099 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:42,697 INFO L93 Difference]: Finished difference Result 18952 states and 26373 transitions. [2025-03-17 12:21:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:42,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 12:21:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:42,724 INFO L225 Difference]: With dead ends: 18952 [2025-03-17 12:21:42,724 INFO L226 Difference]: Without dead ends: 18952 [2025-03-17 12:21:42,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:42,725 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:42,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18952 states. [2025-03-17 12:21:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18952 to 18949. [2025-03-17 12:21:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18949 states, 18948 states have (on average 1.3917563858982478) internal successors, (26371), 18948 states have internal predecessors, (26371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 26371 transitions. [2025-03-17 12:21:42,965 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 26371 transitions. Word has length 28 [2025-03-17 12:21:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:42,965 INFO L471 AbstractCegarLoop]: Abstraction has 18949 states and 26371 transitions. [2025-03-17 12:21:42,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 26371 transitions. [2025-03-17 12:21:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:21:42,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:42,977 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] [2025-03-17 12:21:42,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:21:42,978 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:42,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 672018997, now seen corresponding path program 1 times [2025-03-17 12:21:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629617344] [2025-03-17 12:21:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:42,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:21:42,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:21:42,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:42,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:42,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:42,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629617344] [2025-03-17 12:21:42,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629617344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:42,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:42,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99637780] [2025-03-17 12:21:42,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:42,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:42,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:42,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:42,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:42,998 INFO L87 Difference]: Start difference. First operand 18949 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:43,106 INFO L93 Difference]: Finished difference Result 19208 states and 26373 transitions. [2025-03-17 12:21:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 12:21:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:43,137 INFO L225 Difference]: With dead ends: 19208 [2025-03-17 12:21:43,138 INFO L226 Difference]: Without dead ends: 19208 [2025-03-17 12:21:43,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:43,138 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:43,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19208 states. [2025-03-17 12:21:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19208 to 19205. [2025-03-17 12:21:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 19204 states have (on average 1.3732034992709852) internal successors, (26371), 19204 states have internal predecessors, (26371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 26371 transitions. [2025-03-17 12:21:43,394 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 26371 transitions. Word has length 29 [2025-03-17 12:21:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:43,394 INFO L471 AbstractCegarLoop]: Abstraction has 19205 states and 26371 transitions. [2025-03-17 12:21:43,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 26371 transitions. [2025-03-17 12:21:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:21:43,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:43,409 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] [2025-03-17 12:21:43,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 12:21:43,409 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:43,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -325053356, now seen corresponding path program 1 times [2025-03-17 12:21:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607754417] [2025-03-17 12:21:43,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:43,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:21:43,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:21:43,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:43,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607754417] [2025-03-17 12:21:43,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607754417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:43,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:43,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80409277] [2025-03-17 12:21:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:43,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:43,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:43,434 INFO L87 Difference]: Start difference. First operand 19205 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:43,501 INFO L93 Difference]: Finished difference Result 32776 states and 45317 transitions. [2025-03-17 12:21:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:43,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 12:21:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:43,645 INFO L225 Difference]: With dead ends: 32776 [2025-03-17 12:21:43,645 INFO L226 Difference]: Without dead ends: 32776 [2025-03-17 12:21:43,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:43,646 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 37 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:43,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32776 states. [2025-03-17 12:21:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32776 to 28677. [2025-03-17 12:21:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28677 states, 28676 states have (on average 1.3302761891477193) internal successors, (38147), 28676 states have internal predecessors, (38147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 38147 transitions. [2025-03-17 12:21:43,965 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 38147 transitions. Word has length 29 [2025-03-17 12:21:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:43,965 INFO L471 AbstractCegarLoop]: Abstraction has 28677 states and 38147 transitions. [2025-03-17 12:21:43,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 38147 transitions. [2025-03-17 12:21:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:21:43,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:43,984 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] [2025-03-17 12:21:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 12:21:43,985 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1028256341, now seen corresponding path program 1 times [2025-03-17 12:21:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598036298] [2025-03-17 12:21:43,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:43,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:21:43,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:21:43,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:43,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:44,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598036298] [2025-03-17 12:21:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598036298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:44,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613764625] [2025-03-17 12:21:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:44,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:44,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:44,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:44,004 INFO L87 Difference]: Start difference. First operand 28677 states and 38147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:44,067 INFO L93 Difference]: Finished difference Result 37384 states and 49157 transitions. [2025-03-17 12:21:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:44,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 12:21:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:44,121 INFO L225 Difference]: With dead ends: 37384 [2025-03-17 12:21:44,121 INFO L226 Difference]: Without dead ends: 37384 [2025-03-17 12:21:44,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:44,122 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:44,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37384 states. [2025-03-17 12:21:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37384 to 37381. [2025-03-17 12:21:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37381 states, 37380 states have (on average 1.315008025682183) internal successors, (49155), 37380 states have internal predecessors, (49155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37381 states to 37381 states and 49155 transitions. [2025-03-17 12:21:44,643 INFO L78 Accepts]: Start accepts. Automaton has 37381 states and 49155 transitions. Word has length 29 [2025-03-17 12:21:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:44,644 INFO L471 AbstractCegarLoop]: Abstraction has 37381 states and 49155 transitions. [2025-03-17 12:21:44,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 37381 states and 49155 transitions. [2025-03-17 12:21:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:21:44,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:44,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:44,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 12:21:44,682 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:44,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1485896793, now seen corresponding path program 1 times [2025-03-17 12:21:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990605622] [2025-03-17 12:21:44,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:44,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:21:44,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:21:44,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:44,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:44,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990605622] [2025-03-17 12:21:44,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990605622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:44,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:44,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:44,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680971622] [2025-03-17 12:21:44,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:44,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:44,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:44,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:44,719 INFO L87 Difference]: Start difference. First operand 37381 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:44,850 INFO L93 Difference]: Finished difference Result 37896 states and 49157 transitions. [2025-03-17 12:21:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:21:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:44,910 INFO L225 Difference]: With dead ends: 37896 [2025-03-17 12:21:44,910 INFO L226 Difference]: Without dead ends: 37896 [2025-03-17 12:21:44,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:44,911 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:44,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37896 states. [2025-03-17 12:21:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37896 to 37893. [2025-03-17 12:21:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37893 states, 37892 states have (on average 1.2972395228544285) internal successors, (49155), 37892 states have internal predecessors, (49155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37893 states to 37893 states and 49155 transitions. [2025-03-17 12:21:45,390 INFO L78 Accepts]: Start accepts. Automaton has 37893 states and 49155 transitions. Word has length 30 [2025-03-17 12:21:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:45,390 INFO L471 AbstractCegarLoop]: Abstraction has 37893 states and 49155 transitions. [2025-03-17 12:21:45,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 37893 states and 49155 transitions. [2025-03-17 12:21:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:21:45,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:45,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:45,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 12:21:45,404 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:45,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1811998150, now seen corresponding path program 1 times [2025-03-17 12:21:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:45,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576321089] [2025-03-17 12:21:45,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:45,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:21:45,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:21:45,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:45,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:45,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:45,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576321089] [2025-03-17 12:21:45,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576321089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:45,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:45,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:45,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829528142] [2025-03-17 12:21:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:45,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:45,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:45,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:45,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:45,428 INFO L87 Difference]: Start difference. First operand 37893 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:45,520 INFO L93 Difference]: Finished difference Result 63496 states and 82437 transitions. [2025-03-17 12:21:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:21:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:45,590 INFO L225 Difference]: With dead ends: 63496 [2025-03-17 12:21:45,590 INFO L226 Difference]: Without dead ends: 63496 [2025-03-17 12:21:45,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:45,592 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:45,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63496 states. [2025-03-17 12:21:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63496 to 57349. [2025-03-17 12:21:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57349 states, 57348 states have (on average 1.2588930738648252) internal successors, (72195), 57348 states have internal predecessors, (72195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57349 states to 57349 states and 72195 transitions. [2025-03-17 12:21:46,227 INFO L78 Accepts]: Start accepts. Automaton has 57349 states and 72195 transitions. Word has length 30 [2025-03-17 12:21:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:46,227 INFO L471 AbstractCegarLoop]: Abstraction has 57349 states and 72195 transitions. [2025-03-17 12:21:46,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 57349 states and 72195 transitions. [2025-03-17 12:21:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:21:46,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:46,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:46,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 12:21:46,259 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:46,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1129659449, now seen corresponding path program 1 times [2025-03-17 12:21:46,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:46,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57721679] [2025-03-17 12:21:46,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:46,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:21:46,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:21:46,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:46,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57721679] [2025-03-17 12:21:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57721679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528993355] [2025-03-17 12:21:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:46,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:46,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:46,279 INFO L87 Difference]: Start difference. First operand 57349 states and 72195 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:46,585 INFO L93 Difference]: Finished difference Result 73736 states and 91141 transitions. [2025-03-17 12:21:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:21:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:46,689 INFO L225 Difference]: With dead ends: 73736 [2025-03-17 12:21:46,689 INFO L226 Difference]: Without dead ends: 73736 [2025-03-17 12:21:46,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:46,690 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:46,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73736 states. [2025-03-17 12:21:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73736 to 73733. [2025-03-17 12:21:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2360847393262084) internal successors, (91139), 73732 states have internal predecessors, (91139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 91139 transitions. [2025-03-17 12:21:47,802 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 91139 transitions. Word has length 30 [2025-03-17 12:21:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:47,802 INFO L471 AbstractCegarLoop]: Abstraction has 73733 states and 91139 transitions. [2025-03-17 12:21:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 91139 transitions. [2025-03-17 12:21:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:21:47,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:47,832 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] [2025-03-17 12:21:47,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 12:21:47,832 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:47,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash 338183726, now seen corresponding path program 1 times [2025-03-17 12:21:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:47,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-03-17 12:21:47,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:47,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:21:47,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:21:47,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:47,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:47,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-17 12:21:47,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:47,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-03-17 12:21:47,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678167550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:47,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180920378] [2025-03-17 12:21:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:47,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:47,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:47,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:47,851 INFO L87 Difference]: Start difference. First operand 73733 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:47,974 INFO L93 Difference]: Finished difference Result 74760 states and 91141 transitions. [2025-03-17 12:21:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-17 12:21:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:48,051 INFO L225 Difference]: With dead ends: 74760 [2025-03-17 12:21:48,051 INFO L226 Difference]: Without dead ends: 74760 [2025-03-17 12:21:48,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:48,052 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:48,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74760 states. [2025-03-17 12:21:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74760 to 74757. [2025-03-17 12:21:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74757 states, 74756 states have (on average 1.2191529776874097) internal successors, (91139), 74756 states have internal predecessors, (91139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74757 states to 74757 states and 91139 transitions. [2025-03-17 12:21:48,827 INFO L78 Accepts]: Start accepts. Automaton has 74757 states and 91139 transitions. Word has length 31 [2025-03-17 12:21:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:48,827 INFO L471 AbstractCegarLoop]: Abstraction has 74757 states and 91139 transitions. [2025-03-17 12:21:48,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 74757 states and 91139 transitions. [2025-03-17 12:21:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:21:48,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:48,857 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] [2025-03-17 12:21:48,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 12:21:48,857 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:48,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash -658888627, now seen corresponding path program 1 times [2025-03-17 12:21:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:48,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235400272] [2025-03-17 12:21:48,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:48,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:21:48,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:21:48,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:48,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:48,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235400272] [2025-03-17 12:21:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235400272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931381080] [2025-03-17 12:21:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:48,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:48,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:48,874 INFO L87 Difference]: Start difference. First operand 74757 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:49,253 INFO L93 Difference]: Finished difference Result 122888 states and 148485 transitions. [2025-03-17 12:21:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-17 12:21:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:49,370 INFO L225 Difference]: With dead ends: 122888 [2025-03-17 12:21:49,370 INFO L226 Difference]: Without dead ends: 122888 [2025-03-17 12:21:49,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:49,374 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:49,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:21:49,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122888 states. [2025-03-17 12:21:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122888 to 114693. [2025-03-17 12:21:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114693 states, 114692 states have (on average 1.1874847417431034) internal successors, (136195), 114692 states have internal predecessors, (136195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114693 states to 114693 states and 136195 transitions. [2025-03-17 12:21:50,599 INFO L78 Accepts]: Start accepts. Automaton has 114693 states and 136195 transitions. Word has length 31 [2025-03-17 12:21:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:50,600 INFO L471 AbstractCegarLoop]: Abstraction has 114693 states and 136195 transitions. [2025-03-17 12:21:50,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 114693 states and 136195 transitions. [2025-03-17 12:21:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:21:50,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:50,688 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] [2025-03-17 12:21:50,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 12:21:50,688 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:50,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash 694421070, now seen corresponding path program 1 times [2025-03-17 12:21:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:50,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629081601] [2025-03-17 12:21:50,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:50,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:21:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:21:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629081601] [2025-03-17 12:21:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629081601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820915570] [2025-03-17 12:21:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:50,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:50,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:50,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:50,917 INFO L87 Difference]: Start difference. First operand 114693 states and 136195 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,186 INFO L93 Difference]: Finished difference Result 145416 states and 167941 transitions. [2025-03-17 12:21:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-17 12:21:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,316 INFO L225 Difference]: With dead ends: 145416 [2025-03-17 12:21:51,316 INFO L226 Difference]: Without dead ends: 145416 [2025-03-17 12:21:51,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,316 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:51,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145416 states. [2025-03-17 12:21:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145416 to 145413. [2025-03-17 12:21:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145413 states, 145412 states have (on average 1.1549184386433031) internal successors, (167939), 145412 states have internal predecessors, (167939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145413 states to 145413 states and 167939 transitions. [2025-03-17 12:21:53,025 INFO L78 Accepts]: Start accepts. Automaton has 145413 states and 167939 transitions. Word has length 31 [2025-03-17 12:21:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:53,025 INFO L471 AbstractCegarLoop]: Abstraction has 145413 states and 167939 transitions. [2025-03-17 12:21:53,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 145413 states and 167939 transitions. [2025-03-17 12:21:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:21:53,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:53,083 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-17 12:21:53,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 12:21:53,083 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:53,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1050098240, now seen corresponding path program 1 times [2025-03-17 12:21:53,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:53,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551563904] [2025-03-17 12:21:53,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:53,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:53,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:21:53,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:21:53,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:53,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:53,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:53,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551563904] [2025-03-17 12:21:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551563904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:53,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240864650] [2025-03-17 12:21:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:53,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:53,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:53,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:53,099 INFO L87 Difference]: Start difference. First operand 145413 states and 167939 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:53,567 INFO L93 Difference]: Finished difference Result 147464 states and 167941 transitions. [2025-03-17 12:21:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:53,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:53,705 INFO L225 Difference]: With dead ends: 147464 [2025-03-17 12:21:53,705 INFO L226 Difference]: Without dead ends: 147464 [2025-03-17 12:21:53,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:53,706 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:53,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147464 states. [2025-03-17 12:21:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147464 to 147461. [2025-03-17 12:21:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147461 states, 147460 states have (on average 1.1388783398887834) internal successors, (167939), 147460 states have internal predecessors, (167939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147461 states to 147461 states and 167939 transitions. [2025-03-17 12:21:55,302 INFO L78 Accepts]: Start accepts. Automaton has 147461 states and 167939 transitions. Word has length 32 [2025-03-17 12:21:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:55,302 INFO L471 AbstractCegarLoop]: Abstraction has 147461 states and 167939 transitions. [2025-03-17 12:21:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 147461 states and 167939 transitions. [2025-03-17 12:21:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:21:55,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:55,681 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-17 12:21:55,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 12:21:55,681 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:55,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash 53025887, now seen corresponding path program 1 times [2025-03-17 12:21:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432369253] [2025-03-17 12:21:55,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:55,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:21:55,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:21:55,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:55,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:55,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:55,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432369253] [2025-03-17 12:21:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432369253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:55,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:55,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100622721] [2025-03-17 12:21:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:55,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:55,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:55,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:55,707 INFO L87 Difference]: Start difference. First operand 147461 states and 167939 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,108 INFO L93 Difference]: Finished difference Result 237573 states and 264195 transitions. [2025-03-17 12:21:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,399 INFO L225 Difference]: With dead ends: 237573 [2025-03-17 12:21:56,399 INFO L226 Difference]: Without dead ends: 237573 [2025-03-17 12:21:56,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,400 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:56,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237573 states. [2025-03-17 12:21:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237573 to 229381. [2025-03-17 12:21:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229381 states, 229380 states have (on average 1.1160650449036533) internal successors, (256003), 229380 states have internal predecessors, (256003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229381 states to 229381 states and 256003 transitions. [2025-03-17 12:21:59,281 INFO L78 Accepts]: Start accepts. Automaton has 229381 states and 256003 transitions. Word has length 32 [2025-03-17 12:21:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:59,281 INFO L471 AbstractCegarLoop]: Abstraction has 229381 states and 256003 transitions. [2025-03-17 12:21:59,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 229381 states and 256003 transitions. [2025-03-17 12:21:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:21:59,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:59,412 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-17 12:21:59,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 12:21:59,413 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:59,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1406335584, now seen corresponding path program 1 times [2025-03-17 12:21:59,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:59,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-03-17 12:21:59,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:59,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:59,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:21:59,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:21:59,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:59,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:59,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:59,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-03-17 12:21:59,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648740649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:59,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:59,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:59,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824674077] [2025-03-17 12:21:59,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:59,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:59,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:59,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:59,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:59,431 INFO L87 Difference]: Start difference. First operand 229381 states and 256003 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:59,964 INFO L93 Difference]: Finished difference Result 286722 states and 307201 transitions. [2025-03-17 12:21:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:59,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:59,965 INFO L225 Difference]: With dead ends: 286722 [2025-03-17 12:21:59,965 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 12:21:59,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:59,965 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:59,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 12:21:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 12:21:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 12:21:59,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2025-03-17 12:21:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:59,966 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 12:21:59,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-17 12:21:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 12:21:59,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 12:21:59,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-17 12:21:59,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-17 12:21:59,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 12:21:59,972 INFO L422 BasicCegarLoop]: Path program 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, 1] [2025-03-17 12:21:59,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 12:21:59,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:21:59 BoogieIcfgContainer [2025-03-17 12:21:59,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 12:21:59,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 12:21:59,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 12:21:59,981 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 12:21:59,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:39" (3/4) ... [2025-03-17 12:21:59,984 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 12:21:59,993 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 12:21:59,993 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 12:21:59,993 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 12:21:59,993 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 12:22:00,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 12:22:00,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 12:22:00,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 12:22:00,059 INFO L158 Benchmark]: Toolchain (without parser) took 20801.33ms. Allocated memory was 167.8MB in the beginning and 11.5GB in the end (delta: 11.3GB). Free memory was 122.3MB in the beginning and 8.8GB in the end (delta: -8.6GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-03-17 12:22:00,059 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:22:00,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.10ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 110.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:22:00,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.02ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 108.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:22:00,060 INFO L158 Benchmark]: Boogie Preprocessor took 33.56ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:22:00,060 INFO L158 Benchmark]: IcfgBuilder took 317.28ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 90.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:22:00,060 INFO L158 Benchmark]: TraceAbstraction took 20161.06ms. Allocated memory was 167.8MB in the beginning and 11.5GB in the end (delta: 11.3GB). Free memory was 89.7MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-03-17 12:22:00,060 INFO L158 Benchmark]: Witness Printer took 75.51ms. Allocated memory is still 11.5GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:22:00,060 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.10ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 110.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.02ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 108.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.56ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.28ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 90.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20161.06ms. Allocated memory was 167.8MB in the beginning and 11.5GB in the end (delta: 11.3GB). Free memory was 89.7MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 75.51ms. Allocated memory is still 11.5GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 90 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.9s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2096 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2096 mSDsluCounter, 6711 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2633 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 4078 mSDtfsCounter, 197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229381occurred in iteration=38, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 32843 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 976 NumberOfCodeBlocks, 976 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 937 ConstructedInterpolants, 0 QuantifiedInterpolants, 2076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 12:22:00,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE