./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_7.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_7.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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:21:53,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:21:53,958 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:53,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:21:53,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:21:53,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:21:53,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:21:53,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:21:53,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:21:53,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:21:53,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:21:53,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:21:53,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:21:53,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:21:53,982 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:21:53,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:21:53,982 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:21:53,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:21:53,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:21:53,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:21:53,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:21:53,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:21:53,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:21:53,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:21:53,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:21:53,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:53,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:21:53,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:21:53,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:21:53,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:21:53,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:21:53,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:21:53,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:21:53,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:21:53,986 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2025-03-17 12:21:54,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:21:54,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:21:54,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:21:54,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:21:54,227 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:21:54,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2025-03-17 12:21:55,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272ad4d59/08c457c1ed2241a2bac273d09ecd048b/FLAG3dde8256b [2025-03-17 12:21:55,617 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:21:55,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2025-03-17 12:21:55,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272ad4d59/08c457c1ed2241a2bac273d09ecd048b/FLAG3dde8256b [2025-03-17 12:21:55,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272ad4d59/08c457c1ed2241a2bac273d09ecd048b [2025-03-17 12:21:55,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:21:55,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:21:55,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:55,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:21:55,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:21:55,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dfd783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55, skipping insertion in model container [2025-03-17 12:21:55,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:21:55,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:55,796 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:21:55,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:55,828 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:21:55,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55 WrapperNode [2025-03-17 12:21:55,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:55,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:55,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:21:55,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:21:55,835 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:55" (1/1) ... [2025-03-17 12:21:55,838 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:55" (1/1) ... [2025-03-17 12:21:55,850 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2025-03-17 12:21:55,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:55,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:21:55,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:21:55,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:21:55,858 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:55" (1/1) ... [2025-03-17 12:21:55,860 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:55" (1/1) ... [2025-03-17 12:21:55,861 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:55" (1/1) ... [2025-03-17 12:21:55,872 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:55,874 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:55" (1/1) ... [2025-03-17 12:21:55,875 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:55" (1/1) ... [2025-03-17 12:21:55,877 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:55" (1/1) ... [2025-03-17 12:21:55,878 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:55" (1/1) ... [2025-03-17 12:21:55,878 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:55" (1/1) ... [2025-03-17 12:21:55,881 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:55" (1/1) ... [2025-03-17 12:21:55,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:21:55,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:21:55,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:21:55,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:21:55,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:55,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:55,914 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:55,916 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:55,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:21:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:21:55,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:21:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:21:55,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:21:55,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:21:56,156 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 12:21:56,156 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:21:56,164 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:21:56,164 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:21:56,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:56 BoogieIcfgContainer [2025-03-17 12:21:56,165 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:21:56,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:21:56,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:21:56,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:21:56,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:21:55" (1/3) ... [2025-03-17 12:21:56,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783d41a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:56, skipping insertion in model container [2025-03-17 12:21:56,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (2/3) ... [2025-03-17 12:21:56,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783d41a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:56, skipping insertion in model container [2025-03-17 12:21:56,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:56" (3/3) ... [2025-03-17 12:21:56,172 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2025-03-17 12:21:56,183 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:21:56,184 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_7.c that has 1 procedures, 32 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-17 12:21:56,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:21:56,221 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;@18eaaec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:21:56,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 12:21:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:21:56,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:21:56,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash 3321434, now seen corresponding path program 1 times [2025-03-17 12:21:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779367905] [2025-03-17 12:21:56,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:21:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:21:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,340 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:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779367905] [2025-03-17 12:21:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779367905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:21:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870479070] [2025-03-17 12:21:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:21:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:21:56,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:21:56,363 INFO L87 Difference]: Start difference. First operand has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 0 states have call successors, (0), 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:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,370 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2025-03-17 12:21:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:21:56,371 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:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,375 INFO L225 Difference]: With dead ends: 32 [2025-03-17 12:21:56,375 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 12:21:56,376 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:56,378 INFO L435 NwaCegarLoop]: 52 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, 52 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:56,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 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:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 12:21:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 12:21:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 50 transitions. [2025-03-17 12:21:56,402 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 50 transitions. Word has length 4 [2025-03-17 12:21:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,402 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 50 transitions. [2025-03-17 12:21:56,402 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:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 50 transitions. [2025-03-17 12:21:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:21:56,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:21:56,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:21:56,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash 102998276, now seen corresponding path program 1 times [2025-03-17 12:21:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655593808] [2025-03-17 12:21:56,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:21:56,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:21:56,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,451 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:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655593808] [2025-03-17 12:21:56,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655593808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:21:56,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674403547] [2025-03-17 12:21:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,453 INFO L87 Difference]: Start difference. First operand 30 states and 50 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:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,456 INFO L93 Difference]: Finished difference Result 29 states and 49 transitions. [2025-03-17 12:21:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,456 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:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,456 INFO L225 Difference]: With dead ends: 29 [2025-03-17 12:21:56,457 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 12:21:56,457 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:56,457 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 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:56,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 49 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:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 12:21:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 12:21:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2025-03-17 12:21:56,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 5 [2025-03-17 12:21:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2025-03-17 12:21:56,460 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:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2025-03-17 12:21:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:21:56,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:21:56,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,462 INFO L85 PathProgramCache]: Analyzing trace with hash -324045554, now seen corresponding path program 1 times [2025-03-17 12:21:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131104164] [2025-03-17 12:21:56,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:21:56,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:21:56,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,511 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:56,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131104164] [2025-03-17 12:21:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131104164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977699083] [2025-03-17 12:21:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,513 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,530 INFO L93 Difference]: Finished difference Result 52 states and 90 transitions. [2025-03-17 12:21:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-17 12:21:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,531 INFO L225 Difference]: With dead ends: 52 [2025-03-17 12:21:56,531 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 12:21:56,531 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,532 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 92 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,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 92 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,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 12:21:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2025-03-17 12:21:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2025-03-17 12:21:56,537 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 14 [2025-03-17 12:21:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,538 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2025-03-17 12:21:56,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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,538 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2025-03-17 12:21:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:21:56,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:21:56,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2120996913, now seen corresponding path program 1 times [2025-03-17 12:21:56,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903356359] [2025-03-17 12:21:56,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:21:56,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:21:56,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,591 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:56,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903356359] [2025-03-17 12:21:56,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903356359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473840376] [2025-03-17 12:21:56,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,594 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,616 INFO L93 Difference]: Finished difference Result 52 states and 88 transitions. [2025-03-17 12:21:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-17 12:21:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,617 INFO L225 Difference]: With dead ends: 52 [2025-03-17 12:21:56,617 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 12:21:56,617 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,618 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 34 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 101 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:56,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 101 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:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 12:21:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2025-03-17 12:21:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 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:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2025-03-17 12:21:56,624 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 86 transitions. Word has length 14 [2025-03-17 12:21:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,624 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 86 transitions. [2025-03-17 12:21:56,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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,624 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 86 transitions. [2025-03-17 12:21:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:21:56,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:21:56,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1454634750, now seen corresponding path program 1 times [2025-03-17 12:21:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616625584] [2025-03-17 12:21:56,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:21:56,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:21:56,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,672 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:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616625584] [2025-03-17 12:21:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616625584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510429692] [2025-03-17 12:21:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,673 INFO L87 Difference]: Start difference. First operand 49 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,688 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2025-03-17 12:21:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-17 12:21:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,689 INFO L225 Difference]: With dead ends: 55 [2025-03-17 12:21:56,689 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 12:21:56,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:56,690 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 36 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 113 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:56,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 113 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:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 12:21:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2025-03-17 12:21:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 88 transitions. [2025-03-17 12:21:56,697 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 88 transitions. Word has length 15 [2025-03-17 12:21:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,697 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 88 transitions. [2025-03-17 12:21:56,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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,698 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2025-03-17 12:21:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:21:56,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:21:56,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1325552031, now seen corresponding path program 1 times [2025-03-17 12:21:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723168280] [2025-03-17 12:21:56,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:21:56,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:21:56,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,738 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:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723168280] [2025-03-17 12:21:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723168280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587791455] [2025-03-17 12:21:56,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,741 INFO L87 Difference]: Start difference. First operand 52 states and 88 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,759 INFO L93 Difference]: Finished difference Result 96 states and 163 transitions. [2025-03-17 12:21:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-17 12:21:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,760 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:21:56,760 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:21:56,760 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,761 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 90 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,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 90 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,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:21:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2025-03-17 12:21:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 117 transitions. [2025-03-17 12:21:56,768 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 117 transitions. Word has length 15 [2025-03-17 12:21:56,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,768 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 117 transitions. [2025-03-17 12:21:56,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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,768 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 117 transitions. [2025-03-17 12:21:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:21:56,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:21:56,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1172463906, now seen corresponding path program 1 times [2025-03-17 12:21:56,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436290477] [2025-03-17 12:21:56,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:21:56,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:21:56,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,797 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:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436290477] [2025-03-17 12:21:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436290477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148443235] [2025-03-17 12:21:56,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,798 INFO L87 Difference]: Start difference. First operand 69 states and 117 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,812 INFO L93 Difference]: Finished difference Result 98 states and 161 transitions. [2025-03-17 12:21:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-17 12:21:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,813 INFO L225 Difference]: With dead ends: 98 [2025-03-17 12:21:56,813 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 12:21:56,814 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,814 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 102 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:56,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 102 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:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 12:21:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-03-17 12:21:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 159 transitions. [2025-03-17 12:21:56,826 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 159 transitions. Word has length 15 [2025-03-17 12:21:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,827 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 159 transitions. [2025-03-17 12:21:56,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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,827 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 159 transitions. [2025-03-17 12:21:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:21:56,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:21:56,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1858396104, now seen corresponding path program 1 times [2025-03-17 12:21:56,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411713772] [2025-03-17 12:21:56,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:21:56,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:21:56,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,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:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411713772] [2025-03-17 12:21:56,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411713772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043148962] [2025-03-17 12:21:56,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,852 INFO L87 Difference]: Start difference. First operand 95 states and 159 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,863 INFO L93 Difference]: Finished difference Result 100 states and 161 transitions. [2025-03-17 12:21:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 12:21:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,865 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:21:56,865 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:21:56,865 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,866 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 109 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:56,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 109 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:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:21:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2025-03-17 12:21:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2025-03-17 12:21:56,872 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 16 [2025-03-17 12:21:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,872 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2025-03-17 12:21:56,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2025-03-17 12:21:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:21:56,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:21:56,873 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1987478823, now seen corresponding path program 1 times [2025-03-17 12:21:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404070524] [2025-03-17 12:21:56,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:21:56,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:21:56,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,904 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:56,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404070524] [2025-03-17 12:21:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404070524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82945407] [2025-03-17 12:21:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,906 INFO L87 Difference]: Start difference. First operand 97 states and 159 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,929 INFO L93 Difference]: Finished difference Result 176 states and 289 transitions. [2025-03-17 12:21:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 12:21:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,931 INFO L225 Difference]: With dead ends: 176 [2025-03-17 12:21:56,931 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 12:21:56,931 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,932 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 88 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,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 88 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 12:21:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 133. [2025-03-17 12:21:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.628787878787879) internal successors, (215), 132 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 215 transitions. [2025-03-17 12:21:56,942 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 215 transitions. Word has length 16 [2025-03-17 12:21:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 215 transitions. [2025-03-17 12:21:56,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 215 transitions. [2025-03-17 12:21:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:21:56,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:21:56,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 190527464, now seen corresponding path program 1 times [2025-03-17 12:21:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878924025] [2025-03-17 12:21:56,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:21:56,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:21:56,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,964 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:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878924025] [2025-03-17 12:21:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878924025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507016529] [2025-03-17 12:21:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,966 INFO L87 Difference]: Start difference. First operand 133 states and 215 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,993 INFO L93 Difference]: Finished difference Result 184 states and 289 transitions. [2025-03-17 12:21:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 12:21:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,994 INFO L225 Difference]: With dead ends: 184 [2025-03-17 12:21:56,994 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 12:21:56,994 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,995 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 103 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:56,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 103 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:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 12:21:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2025-03-17 12:21:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 287 transitions. [2025-03-17 12:21:57,006 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 287 transitions. Word has length 16 [2025-03-17 12:21:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,006 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 287 transitions. [2025-03-17 12:21:57,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 287 transitions. [2025-03-17 12:21:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:21:57,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:57,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:21:57,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1483130747, now seen corresponding path program 1 times [2025-03-17 12:21:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853262720] [2025-03-17 12:21:57,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:21:57,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:21:57,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,028 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:57,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853262720] [2025-03-17 12:21:57,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853262720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652636684] [2025-03-17 12:21:57,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,030 INFO L87 Difference]: Start difference. First operand 181 states and 287 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,041 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2025-03-17 12:21:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-17 12:21:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,043 INFO L225 Difference]: With dead ends: 188 [2025-03-17 12:21:57,043 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 12:21:57,043 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:57,043 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 105 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:57,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 105 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:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 12:21:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2025-03-17 12:21:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.559782608695652) internal successors, (287), 184 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2025-03-17 12:21:57,050 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 17 [2025-03-17 12:21:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,051 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2025-03-17 12:21:57,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2025-03-17 12:21:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:21:57,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:57,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:21:57,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1612213466, now seen corresponding path program 1 times [2025-03-17 12:21:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114919225] [2025-03-17 12:21:57,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:21:57,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:21:57,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,084 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:57,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114919225] [2025-03-17 12:21:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114919225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817861721] [2025-03-17 12:21:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,087 INFO L87 Difference]: Start difference. First operand 185 states and 287 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,098 INFO L93 Difference]: Finished difference Result 352 states and 525 transitions. [2025-03-17 12:21:57,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-17 12:21:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,100 INFO L225 Difference]: With dead ends: 352 [2025-03-17 12:21:57,100 INFO L226 Difference]: Without dead ends: 352 [2025-03-17 12:21:57,100 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:57,101 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 92 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:57,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 92 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:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-17 12:21:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 349. [2025-03-17 12:21:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.5028735632183907) internal successors, (523), 348 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 523 transitions. [2025-03-17 12:21:57,108 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 523 transitions. Word has length 17 [2025-03-17 12:21:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,109 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 523 transitions. [2025-03-17 12:21:57,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 523 transitions. [2025-03-17 12:21:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:21:57,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:57,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:21:57,110 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash -885802471, now seen corresponding path program 1 times [2025-03-17 12:21:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478084440] [2025-03-17 12:21:57,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:21:57,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:21:57,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,127 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:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478084440] [2025-03-17 12:21:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478084440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294475650] [2025-03-17 12:21:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,129 INFO L87 Difference]: Start difference. First operand 349 states and 523 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,137 INFO L93 Difference]: Finished difference Result 416 states and 629 transitions. [2025-03-17 12:21:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-17 12:21:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,139 INFO L225 Difference]: With dead ends: 416 [2025-03-17 12:21:57,139 INFO L226 Difference]: Without dead ends: 416 [2025-03-17 12:21:57,139 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:57,140 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 25 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 112 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:57,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 112 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:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-17 12:21:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 349. [2025-03-17 12:21:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4798850574712643) internal successors, (515), 348 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 515 transitions. [2025-03-17 12:21:57,147 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 515 transitions. Word has length 17 [2025-03-17 12:21:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,148 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 515 transitions. [2025-03-17 12:21:57,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 515 transitions. [2025-03-17 12:21:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:21:57,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:57,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:21:57,149 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1560167455, now seen corresponding path program 1 times [2025-03-17 12:21:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223806017] [2025-03-17 12:21:57,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:21:57,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:21:57,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,171 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:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223806017] [2025-03-17 12:21:57,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223806017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120996968] [2025-03-17 12:21:57,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,173 INFO L87 Difference]: Start difference. First operand 349 states and 515 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,183 INFO L93 Difference]: Finished difference Result 608 states and 893 transitions. [2025-03-17 12:21:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-17 12:21:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,185 INFO L225 Difference]: With dead ends: 608 [2025-03-17 12:21:57,185 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 12:21:57,185 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:57,186 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 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:57,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 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:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 12:21:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 509. [2025-03-17 12:21:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.438976377952756) internal successors, (731), 508 states have internal predecessors, (731), 0 states have call successors, (0), 0 states 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:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 731 transitions. [2025-03-17 12:21:57,201 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 731 transitions. Word has length 18 [2025-03-17 12:21:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,201 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 731 transitions. [2025-03-17 12:21:57,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 731 transitions. [2025-03-17 12:21:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:21:57,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:57,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:21:57,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash 937848482, now seen corresponding path program 1 times [2025-03-17 12:21:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402085485] [2025-03-17 12:21:57,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:21:57,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:21:57,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,227 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:57,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402085485] [2025-03-17 12:21:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402085485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671846032] [2025-03-17 12:21:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,230 INFO L87 Difference]: Start difference. First operand 509 states and 731 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,242 INFO L93 Difference]: Finished difference Result 672 states and 933 transitions. [2025-03-17 12:21:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-17 12:21:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,244 INFO L225 Difference]: With dead ends: 672 [2025-03-17 12:21:57,244 INFO L226 Difference]: Without dead ends: 672 [2025-03-17 12:21:57,244 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:57,245 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 105 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:57,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 105 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:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-17 12:21:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 669. [2025-03-17 12:21:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.3937125748502994) internal successors, (931), 668 states have internal predecessors, (931), 0 states have call successors, (0), 0 states 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:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 931 transitions. [2025-03-17 12:21:57,262 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 931 transitions. Word has length 18 [2025-03-17 12:21:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,262 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 931 transitions. [2025-03-17 12:21:57,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 931 transitions. [2025-03-17 12:21:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:21:57,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:57,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:21:57,265 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1119734925, now seen corresponding path program 1 times [2025-03-17 12:21:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682484216] [2025-03-17 12:21:57,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:21:57,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:21:57,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,288 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:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682484216] [2025-03-17 12:21:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682484216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133889243] [2025-03-17 12:21:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,290 INFO L87 Difference]: Start difference. First operand 669 states and 931 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,302 INFO L93 Difference]: Finished difference Result 696 states and 949 transitions. [2025-03-17 12:21:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-17 12:21:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,305 INFO L225 Difference]: With dead ends: 696 [2025-03-17 12:21:57,305 INFO L226 Difference]: Without dead ends: 696 [2025-03-17 12:21:57,305 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:57,306 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 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:57,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 97 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:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-17 12:21:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 693. [2025-03-17 12:21:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 947 transitions. [2025-03-17 12:21:57,318 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 947 transitions. Word has length 19 [2025-03-17 12:21:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,318 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 947 transitions. [2025-03-17 12:21:57,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 947 transitions. [2025-03-17 12:21:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:21:57,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:57,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:21:57,322 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -990652206, now seen corresponding path program 1 times [2025-03-17 12:21:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378085631] [2025-03-17 12:21:57,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:21:57,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:21:57,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:57,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378085631] [2025-03-17 12:21:57,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378085631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971498442] [2025-03-17 12:21:57,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,343 INFO L87 Difference]: Start difference. First operand 693 states and 947 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,353 INFO L93 Difference]: Finished difference Result 1160 states and 1557 transitions. [2025-03-17 12:21:57,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-17 12:21:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,356 INFO L225 Difference]: With dead ends: 1160 [2025-03-17 12:21:57,356 INFO L226 Difference]: Without dead ends: 1160 [2025-03-17 12:21:57,357 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:57,357 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 82 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:57,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 82 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:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-03-17 12:21:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1029. [2025-03-17 12:21:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states 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:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1363 transitions. [2025-03-17 12:21:57,375 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1363 transitions. Word has length 19 [2025-03-17 12:21:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,375 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1363 transitions. [2025-03-17 12:21:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1363 transitions. [2025-03-17 12:21:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:21:57,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:57,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:21:57,377 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1507363731, now seen corresponding path program 1 times [2025-03-17 12:21:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862399043] [2025-03-17 12:21:57,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:21:57,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:21:57,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,391 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:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862399043] [2025-03-17 12:21:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862399043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776723966] [2025-03-17 12:21:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,393 INFO L87 Difference]: Start difference. First operand 1029 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,420 INFO L93 Difference]: Finished difference Result 1320 states and 1669 transitions. [2025-03-17 12:21:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-17 12:21:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,424 INFO L225 Difference]: With dead ends: 1320 [2025-03-17 12:21:57,424 INFO L226 Difference]: Without dead ends: 1320 [2025-03-17 12:21:57,425 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:57,425 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 106 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:57,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 106 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:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-17 12:21:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1317. [2025-03-17 12:21:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states 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:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1667 transitions. [2025-03-17 12:21:57,447 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1667 transitions. Word has length 19 [2025-03-17 12:21:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,447 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1667 transitions. [2025-03-17 12:21:57,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1667 transitions. [2025-03-17 12:21:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:21:57,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,449 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:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:21:57,449 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -644638117, now seen corresponding path program 1 times [2025-03-17 12:21:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532072530] [2025-03-17 12:21:57,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:21:57,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:21:57,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,470 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:57,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532072530] [2025-03-17 12:21:57,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532072530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628162893] [2025-03-17 12:21:57,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,471 INFO L87 Difference]: Start difference. First operand 1317 states and 1667 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:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,488 INFO L93 Difference]: Finished difference Result 1352 states and 1669 transitions. [2025-03-17 12:21:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,488 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:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,492 INFO L225 Difference]: With dead ends: 1352 [2025-03-17 12:21:57,492 INFO L226 Difference]: Without dead ends: 1352 [2025-03-17 12:21:57,492 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:57,493 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 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:57,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 93 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:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-17 12:21:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1349. [2025-03-17 12:21:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states 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:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1667 transitions. [2025-03-17 12:21:57,512 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1667 transitions. Word has length 20 [2025-03-17 12:21:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,512 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1667 transitions. [2025-03-17 12:21:57,512 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:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1667 transitions. [2025-03-17 12:21:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:21:57,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,514 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:57,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:21:57,514 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -515555398, now seen corresponding path program 1 times [2025-03-17 12:21:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624494126] [2025-03-17 12:21:57,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:21:57,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:21:57,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,537 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:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624494126] [2025-03-17 12:21:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624494126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845942939] [2025-03-17 12:21:57,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,538 INFO L87 Difference]: Start difference. First operand 1349 states and 1667 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:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,553 INFO L93 Difference]: Finished difference Result 2181 states and 2595 transitions. [2025-03-17 12:21:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,553 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:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,558 INFO L225 Difference]: With dead ends: 2181 [2025-03-17 12:21:57,559 INFO L226 Difference]: Without dead ends: 2181 [2025-03-17 12:21:57,559 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:57,560 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 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:57,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 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:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-03-17 12:21:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2053. [2025-03-17 12:21:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states 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:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2467 transitions. [2025-03-17 12:21:57,594 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2467 transitions. Word has length 20 [2025-03-17 12:21:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,594 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2467 transitions. [2025-03-17 12:21:57,594 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:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2467 transitions. [2025-03-17 12:21:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:21:57,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:57,598 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:57,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 12:21:57,599 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1982460539, now seen corresponding path program 1 times [2025-03-17 12:21:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925909769] [2025-03-17 12:21:57,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:57,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:57,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:21:57,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:21:57,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:57,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:57,614 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:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925909769] [2025-03-17 12:21:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925909769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:57,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:57,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110179484] [2025-03-17 12:21:57,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:57,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:57,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:57,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:57,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:57,615 INFO L87 Difference]: Start difference. First operand 2053 states and 2467 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:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,632 INFO L93 Difference]: Finished difference Result 2562 states and 2881 transitions. [2025-03-17 12:21:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,633 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:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,633 INFO L225 Difference]: With dead ends: 2562 [2025-03-17 12:21:57,633 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 12:21:57,633 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:57,634 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 103 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:57,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 103 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:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 12:21:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 12:21:57,635 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:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 12:21:57,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2025-03-17 12:21:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:57,635 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 12:21:57,636 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:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 12:21:57,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 12:21:57,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-17 12:21:57,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-17 12:21:57,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:21:57,641 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] [2025-03-17 12:21:57,642 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 12:21:57,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:21:57 BoogieIcfgContainer [2025-03-17 12:21:57,646 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 12:21:57,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 12:21:57,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 12:21:57,646 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 12:21:57,647 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:56" (3/4) ... [2025-03-17 12:21:57,649 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 12:21:57,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 12:21:57,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 12:21:57,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 12:21:57,657 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 12:21:57,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 12:21:57,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 12:21:57,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 12:21:57,717 INFO L158 Benchmark]: Toolchain (without parser) took 2060.51ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 66.1MB in the end (delta: 58.4MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,717 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:57,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.19ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 113.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.44ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 112.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:57,718 INFO L158 Benchmark]: Boogie Preprocessor took 31.27ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:57,720 INFO L158 Benchmark]: IcfgBuilder took 280.29ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 96.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,721 INFO L158 Benchmark]: TraceAbstraction took 1478.72ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 72.5MB in the end (delta: 24.3MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,721 INFO L158 Benchmark]: Witness Printer took 69.99ms. Allocated memory is still 167.8MB. Free memory was 72.5MB in the beginning and 66.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,722 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.17ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.19ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 113.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.44ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 112.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.27ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 280.29ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 96.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1478.72ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 72.5MB in the end (delta: 24.3MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Witness Printer took 69.99ms. Allocated memory is still 167.8MB. Free memory was 72.5MB in the beginning and 66.1MB in the end (delta: 6.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, 32 locations, 54 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 602 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 602 mSDsluCounter, 1956 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 725 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1231 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2053occurred in iteration=20, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 545 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:21:57,737 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