./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_13.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:44:14,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:44:14,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:44:14,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:44:14,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:44:14,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:44:14,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:44:14,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:44:14,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:44:14,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:44:14,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:44:14,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:44:14,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:44:14,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:44:14,978 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:44:14,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:44:14,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:44:14,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:44:14,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:44:14,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:44:14,978 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:44:14,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:44:14,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:44:14,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:44:14,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:44:14,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:44:14,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:44:14,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:44:14,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:44:14,980 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2025-02-06 10:44:15,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:44:15,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:44:15,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:44:15,190 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:44:15,190 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:44:15,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2025-02-06 10:44:16,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a06b6547/b07fe3609a264424827a30625fafe912/FLAGfd496834a [2025-02-06 10:44:16,607 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:44:16,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2025-02-06 10:44:16,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a06b6547/b07fe3609a264424827a30625fafe912/FLAGfd496834a [2025-02-06 10:44:16,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a06b6547/b07fe3609a264424827a30625fafe912 [2025-02-06 10:44:16,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:44:16,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:44:16,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:44:16,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:44:16,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:44:16,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:44:16" (1/1) ... [2025-02-06 10:44:16,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bc32e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:16, skipping insertion in model container [2025-02-06 10:44:16,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:44:16" (1/1) ... [2025-02-06 10:44:16,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:44:17,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:44:17,081 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:44:17,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:44:17,104 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:44:17,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17 WrapperNode [2025-02-06 10:44:17,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:44:17,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:44:17,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:44:17,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:44:17,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,126 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 182 [2025-02-06 10:44:17,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:44:17,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:44:17,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:44:17,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:44:17,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,140 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-02-06 10:44:17,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:44:17,149 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:44:17,149 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:44:17,149 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:44:17,150 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (1/1) ... [2025-02-06 10:44:17,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:44:17,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:44:17,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:44:17,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:44:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:44:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:44:17,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:44:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:44:17,231 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:44:17,232 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:44:17,407 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-06 10:44:17,408 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:44:17,413 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:44:17,413 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:44:17,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:17 BoogieIcfgContainer [2025-02-06 10:44:17,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:44:17,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:44:17,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:44:17,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:44:17,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:44:16" (1/3) ... [2025-02-06 10:44:17,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f9278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:44:17, skipping insertion in model container [2025-02-06 10:44:17,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:17" (2/3) ... [2025-02-06 10:44:17,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f9278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:44:17, skipping insertion in model container [2025-02-06 10:44:17,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:17" (3/3) ... [2025-02-06 10:44:17,420 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2025-02-06 10:44:17,433 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:44:17,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_13.c that has 1 procedures, 52 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-06 10:44:17,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:44:17,470 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;@1617c21f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:44:17,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 10:44:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 51 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:44:17,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:17,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:44:17,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 156470269, now seen corresponding path program 1 times [2025-02-06 10:44:17,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071754777] [2025-02-06 10:44:17,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:17,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:44:17,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:44:17,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:17,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:17,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071754777] [2025-02-06 10:44:17,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071754777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:17,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:17,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:44:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222921667] [2025-02-06 10:44:17,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:17,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:44:17,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:17,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:44:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:44:17,613 INFO L87 Difference]: Start difference. First operand has 52 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 51 states have internal predecessors, (92), 0 states have call successors, (0), 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.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-02-06 10:44:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:17,623 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2025-02-06 10:44:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:44:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 10:44:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:17,629 INFO L225 Difference]: With dead ends: 51 [2025-02-06 10:44:17,629 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:44:17,630 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-02-06 10:44:17,632 INFO L435 NwaCegarLoop]: 89 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, 89 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-02-06 10:44:17,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:44:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 10:44:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.851063829787234) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 87 transitions. [2025-02-06 10:44:17,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 87 transitions. Word has length 5 [2025-02-06 10:44:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:17,655 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 87 transitions. [2025-02-06 10:44:17,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 87 transitions. [2025-02-06 10:44:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:44:17,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:17,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:44:17,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:44:17,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:17,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 555696790, now seen corresponding path program 1 times [2025-02-06 10:44:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006288231] [2025-02-06 10:44:17,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:17,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:17,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:44:17,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:44:17,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:17,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:17,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:17,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006288231] [2025-02-06 10:44:17,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006288231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:17,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:17,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:44:17,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363548887] [2025-02-06 10:44:17,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:17,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:17,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:17,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:17,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:17,701 INFO L87 Difference]: Start difference. First operand 49 states and 87 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:17,707 INFO L93 Difference]: Finished difference Result 48 states and 86 transitions. [2025-02-06 10:44:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:17,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:44:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:17,708 INFO L225 Difference]: With dead ends: 48 [2025-02-06 10:44:17,708 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 10:44:17,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:17,709 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:17,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 10:44:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 10:44:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 84 transitions. [2025-02-06 10:44:17,712 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 84 transitions. Word has length 6 [2025-02-06 10:44:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:17,713 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 84 transitions. [2025-02-06 10:44:17,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2025-02-06 10:44:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:44:17,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:17,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:17,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:44:17,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:17,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1337472851, now seen corresponding path program 1 times [2025-02-06 10:44:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:17,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271220639] [2025-02-06 10:44:17,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:17,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:44:17,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:44:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271220639] [2025-02-06 10:44:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271220639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:17,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188271250] [2025-02-06 10:44:17,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:17,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:17,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:17,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:17,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:17,815 INFO L87 Difference]: Start difference. First operand 46 states and 84 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:17,833 INFO L93 Difference]: Finished difference Result 89 states and 163 transitions. [2025-02-06 10:44:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:44:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:17,834 INFO L225 Difference]: With dead ends: 89 [2025-02-06 10:44:17,834 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 10:44:17,835 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-02-06 10:44:17,835 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 166 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-02-06 10:44:17,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 10:44:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2025-02-06 10:44:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 111 transitions. [2025-02-06 10:44:17,840 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 111 transitions. Word has length 21 [2025-02-06 10:44:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:17,840 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 111 transitions. [2025-02-06 10:44:17,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 111 transitions. [2025-02-06 10:44:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:44:17,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:17,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:17,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:44:17,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:17,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:17,842 INFO L85 PathProgramCache]: Analyzing trace with hash 15836846, now seen corresponding path program 1 times [2025-02-06 10:44:17,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:17,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006865329] [2025-02-06 10:44:17,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:17,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:44:17,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:44:17,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:17,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:17,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:17,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006865329] [2025-02-06 10:44:17,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006865329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:17,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:17,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094955637] [2025-02-06 10:44:17,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:17,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:17,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:17,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:17,885 INFO L87 Difference]: Start difference. First operand 60 states and 111 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:17,905 INFO L93 Difference]: Finished difference Result 89 states and 161 transitions. [2025-02-06 10:44:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:17,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:44:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:17,906 INFO L225 Difference]: With dead ends: 89 [2025-02-06 10:44:17,906 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 10:44:17,906 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-02-06 10:44:17,907 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:17,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 10:44:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2025-02-06 10:44:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 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-02-06 10:44:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 159 transitions. [2025-02-06 10:44:17,917 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 159 transitions. Word has length 21 [2025-02-06 10:44:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:17,917 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 159 transitions. [2025-02-06 10:44:17,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 159 transitions. [2025-02-06 10:44:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:44:17,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:17,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:17,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:44:17,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:17,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:17,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1488897774, now seen corresponding path program 1 times [2025-02-06 10:44:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483447472] [2025-02-06 10:44:17,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:17,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:44:17,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:44:17,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:17,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483447472] [2025-02-06 10:44:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483447472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067013229] [2025-02-06 10:44:17,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:17,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:17,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:17,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:17,994 INFO L87 Difference]: Start difference. First operand 86 states and 159 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,011 INFO L93 Difference]: Finished difference Result 92 states and 163 transitions. [2025-02-06 10:44:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 10:44:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,012 INFO L225 Difference]: With dead ends: 92 [2025-02-06 10:44:18,012 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 10:44:18,012 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-02-06 10:44:18,013 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 66 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 211 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-02-06 10:44:18,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 10:44:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2025-02-06 10:44:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 161 transitions. [2025-02-06 10:44:18,019 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 161 transitions. Word has length 22 [2025-02-06 10:44:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,019 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 161 transitions. [2025-02-06 10:44:18,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 161 transitions. [2025-02-06 10:44:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:44:18,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:44:18,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash 491825421, now seen corresponding path program 1 times [2025-02-06 10:44:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800983646] [2025-02-06 10:44:18,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:44:18,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:44:18,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800983646] [2025-02-06 10:44:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800983646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816196028] [2025-02-06 10:44:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,049 INFO L87 Difference]: Start difference. First operand 89 states and 161 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,060 INFO L93 Difference]: Finished difference Result 169 states and 308 transitions. [2025-02-06 10:44:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 10:44:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,061 INFO L225 Difference]: With dead ends: 169 [2025-02-06 10:44:18,061 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 10:44:18,061 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-02-06 10:44:18,062 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 10:44:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 118. [2025-02-06 10:44:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.829059829059829) internal successors, (214), 117 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 214 transitions. [2025-02-06 10:44:18,068 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 214 transitions. Word has length 22 [2025-02-06 10:44:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,068 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 214 transitions. [2025-02-06 10:44:18,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 214 transitions. [2025-02-06 10:44:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:44:18,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:44:18,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1845135118, now seen corresponding path program 1 times [2025-02-06 10:44:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366031651] [2025-02-06 10:44:18,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:44:18,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:44:18,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366031651] [2025-02-06 10:44:18,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366031651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765649632] [2025-02-06 10:44:18,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,109 INFO L87 Difference]: Start difference. First operand 118 states and 214 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,129 INFO L93 Difference]: Finished difference Result 171 states and 306 transitions. [2025-02-06 10:44:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 10:44:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,131 INFO L225 Difference]: With dead ends: 171 [2025-02-06 10:44:18,131 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 10:44:18,131 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-02-06 10:44:18,131 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 10:44:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2025-02-06 10:44:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 304 transitions. [2025-02-06 10:44:18,144 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 304 transitions. Word has length 22 [2025-02-06 10:44:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,144 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 304 transitions. [2025-02-06 10:44:18,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 304 transitions. [2025-02-06 10:44:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:44:18,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:44:18,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1932404665, now seen corresponding path program 1 times [2025-02-06 10:44:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993189722] [2025-02-06 10:44:18,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:44:18,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:44:18,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993189722] [2025-02-06 10:44:18,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993189722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437301212] [2025-02-06 10:44:18,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,181 INFO L87 Difference]: Start difference. First operand 168 states and 304 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,192 INFO L93 Difference]: Finished difference Result 173 states and 306 transitions. [2025-02-06 10:44:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:44:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,193 INFO L225 Difference]: With dead ends: 173 [2025-02-06 10:44:18,193 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 10:44:18,194 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-02-06 10:44:18,194 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 207 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-02-06 10:44:18,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 10:44:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2025-02-06 10:44:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.7988165680473374) internal successors, (304), 169 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 304 transitions. [2025-02-06 10:44:18,203 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 304 transitions. Word has length 23 [2025-02-06 10:44:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,203 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 304 transitions. [2025-02-06 10:44:18,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 304 transitions. [2025-02-06 10:44:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:44:18,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:44:18,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1365490278, now seen corresponding path program 1 times [2025-02-06 10:44:18,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325956343] [2025-02-06 10:44:18,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:44:18,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:44:18,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325956343] [2025-02-06 10:44:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325956343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379297039] [2025-02-06 10:44:18,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,226 INFO L87 Difference]: Start difference. First operand 170 states and 304 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,235 INFO L93 Difference]: Finished difference Result 321 states and 578 transitions. [2025-02-06 10:44:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:44:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,236 INFO L225 Difference]: With dead ends: 321 [2025-02-06 10:44:18,236 INFO L226 Difference]: Without dead ends: 321 [2025-02-06 10:44:18,236 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-02-06 10:44:18,237 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 58 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-06 10:44:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 230. [2025-02-06 10:44:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.7816593886462881) internal successors, (408), 229 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 408 transitions. [2025-02-06 10:44:18,243 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 408 transitions. Word has length 23 [2025-02-06 10:44:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,243 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 408 transitions. [2025-02-06 10:44:18,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 408 transitions. [2025-02-06 10:44:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:44:18,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:44:18,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1576167321, now seen corresponding path program 1 times [2025-02-06 10:44:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293138202] [2025-02-06 10:44:18,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:44:18,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:44:18,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293138202] [2025-02-06 10:44:18,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293138202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632549452] [2025-02-06 10:44:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,276 INFO L87 Difference]: Start difference. First operand 230 states and 408 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,285 INFO L93 Difference]: Finished difference Result 329 states and 578 transitions. [2025-02-06 10:44:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:44:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,286 INFO L225 Difference]: With dead ends: 329 [2025-02-06 10:44:18,286 INFO L226 Difference]: Without dead ends: 329 [2025-02-06 10:44:18,287 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-02-06 10:44:18,287 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-06 10:44:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2025-02-06 10:44:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.7723076923076924) internal successors, (576), 325 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 576 transitions. [2025-02-06 10:44:18,294 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 576 transitions. Word has length 23 [2025-02-06 10:44:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,294 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 576 transitions. [2025-02-06 10:44:18,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 576 transitions. [2025-02-06 10:44:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:44:18,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:44:18,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash -618604601, now seen corresponding path program 1 times [2025-02-06 10:44:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943715419] [2025-02-06 10:44:18,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:44:18,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:44:18,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943715419] [2025-02-06 10:44:18,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943715419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572247771] [2025-02-06 10:44:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,315 INFO L87 Difference]: Start difference. First operand 326 states and 576 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,324 INFO L93 Difference]: Finished difference Result 333 states and 578 transitions. [2025-02-06 10:44:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:44:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,325 INFO L225 Difference]: With dead ends: 333 [2025-02-06 10:44:18,325 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 10:44:18,326 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-02-06 10:44:18,326 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 203 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-02-06 10:44:18,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 10:44:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2025-02-06 10:44:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 1.750759878419453) internal successors, (576), 329 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 576 transitions. [2025-02-06 10:44:18,335 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 576 transitions. Word has length 24 [2025-02-06 10:44:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,335 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 576 transitions. [2025-02-06 10:44:18,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 576 transitions. [2025-02-06 10:44:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:44:18,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:44:18,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1615676954, now seen corresponding path program 1 times [2025-02-06 10:44:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672690715] [2025-02-06 10:44:18,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:44:18,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:44:18,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672690715] [2025-02-06 10:44:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672690715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680765517] [2025-02-06 10:44:18,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,368 INFO L87 Difference]: Start difference. First operand 330 states and 576 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,378 INFO L93 Difference]: Finished difference Result 617 states and 1086 transitions. [2025-02-06 10:44:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:44:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,380 INFO L225 Difference]: With dead ends: 617 [2025-02-06 10:44:18,380 INFO L226 Difference]: Without dead ends: 617 [2025-02-06 10:44:18,380 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-02-06 10:44:18,381 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 55 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-02-06 10:44:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 454. [2025-02-06 10:44:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.7218543046357615) internal successors, (780), 453 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 780 transitions. [2025-02-06 10:44:18,403 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 780 transitions. Word has length 24 [2025-02-06 10:44:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,404 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 780 transitions. [2025-02-06 10:44:18,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 780 transitions. [2025-02-06 10:44:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:44:18,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:44:18,405 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash -262367257, now seen corresponding path program 1 times [2025-02-06 10:44:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022664195] [2025-02-06 10:44:18,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:44:18,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:44:18,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022664195] [2025-02-06 10:44:18,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022664195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483683165] [2025-02-06 10:44:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,433 INFO L87 Difference]: Start difference. First operand 454 states and 780 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,443 INFO L93 Difference]: Finished difference Result 641 states and 1094 transitions. [2025-02-06 10:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:44:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,445 INFO L225 Difference]: With dead ends: 641 [2025-02-06 10:44:18,446 INFO L226 Difference]: Without dead ends: 641 [2025-02-06 10:44:18,446 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-02-06 10:44:18,447 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-02-06 10:44:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 638. [2025-02-06 10:44:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 1.7142857142857142) internal successors, (1092), 637 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1092 transitions. [2025-02-06 10:44:18,456 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1092 transitions. Word has length 24 [2025-02-06 10:44:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,456 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 1092 transitions. [2025-02-06 10:44:18,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1092 transitions. [2025-02-06 10:44:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:44:18,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:44:18,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1454484992, now seen corresponding path program 1 times [2025-02-06 10:44:18,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278215038] [2025-02-06 10:44:18,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:44:18,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:44:18,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278215038] [2025-02-06 10:44:18,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278215038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505079885] [2025-02-06 10:44:18,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,476 INFO L87 Difference]: Start difference. First operand 638 states and 1092 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,488 INFO L93 Difference]: Finished difference Result 649 states and 1094 transitions. [2025-02-06 10:44:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 10:44:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,490 INFO L225 Difference]: With dead ends: 649 [2025-02-06 10:44:18,490 INFO L226 Difference]: Without dead ends: 649 [2025-02-06 10:44:18,491 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-02-06 10:44:18,491 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 199 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-02-06 10:44:18,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-06 10:44:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2025-02-06 10:44:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.6930232558139535) internal successors, (1092), 645 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1092 transitions. [2025-02-06 10:44:18,504 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1092 transitions. Word has length 25 [2025-02-06 10:44:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,505 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 1092 transitions. [2025-02-06 10:44:18,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1092 transitions. [2025-02-06 10:44:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:44:18,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:44:18,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash 457412639, now seen corresponding path program 1 times [2025-02-06 10:44:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443769751] [2025-02-06 10:44:18,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:44:18,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:44:18,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443769751] [2025-02-06 10:44:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443769751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340748915] [2025-02-06 10:44:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,536 INFO L87 Difference]: Start difference. First operand 646 states and 1092 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,547 INFO L93 Difference]: Finished difference Result 1193 states and 2038 transitions. [2025-02-06 10:44:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 10:44:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,550 INFO L225 Difference]: With dead ends: 1193 [2025-02-06 10:44:18,551 INFO L226 Difference]: Without dead ends: 1193 [2025-02-06 10:44:18,552 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-02-06 10:44:18,552 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 52 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-02-06 10:44:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 902. [2025-02-06 10:44:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.655937846836848) internal successors, (1492), 901 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1492 transitions. [2025-02-06 10:44:18,566 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1492 transitions. Word has length 25 [2025-02-06 10:44:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,566 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1492 transitions. [2025-02-06 10:44:18,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1492 transitions. [2025-02-06 10:44:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:44:18,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:44:18,568 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1810722336, now seen corresponding path program 1 times [2025-02-06 10:44:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491069199] [2025-02-06 10:44:18,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:44:18,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:44:18,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491069199] [2025-02-06 10:44:18,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491069199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402176349] [2025-02-06 10:44:18,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,591 INFO L87 Difference]: Start difference. First operand 902 states and 1492 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,609 INFO L93 Difference]: Finished difference Result 1257 states and 2070 transitions. [2025-02-06 10:44:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 10:44:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,612 INFO L225 Difference]: With dead ends: 1257 [2025-02-06 10:44:18,613 INFO L226 Difference]: Without dead ends: 1257 [2025-02-06 10:44:18,613 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-02-06 10:44:18,614 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 191 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-02-06 10:44:18,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-02-06 10:44:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1254. [2025-02-06 10:44:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.650438946528332) internal successors, (2068), 1253 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 2068 transitions. [2025-02-06 10:44:18,633 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 2068 transitions. Word has length 25 [2025-02-06 10:44:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,633 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 2068 transitions. [2025-02-06 10:44:18,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 2068 transitions. [2025-02-06 10:44:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:44:18,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:44:18,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1295746208, now seen corresponding path program 1 times [2025-02-06 10:44:18,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996337424] [2025-02-06 10:44:18,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:44:18,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:44:18,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996337424] [2025-02-06 10:44:18,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996337424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996340165] [2025-02-06 10:44:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,658 INFO L87 Difference]: Start difference. First operand 1254 states and 2068 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,680 INFO L93 Difference]: Finished difference Result 1273 states and 2070 transitions. [2025-02-06 10:44:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:44:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,683 INFO L225 Difference]: With dead ends: 1273 [2025-02-06 10:44:18,683 INFO L226 Difference]: Without dead ends: 1273 [2025-02-06 10:44:18,683 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-02-06 10:44:18,684 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 195 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-02-06 10:44:18,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-02-06 10:44:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1270. [2025-02-06 10:44:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 1.6296296296296295) internal successors, (2068), 1269 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2068 transitions. [2025-02-06 10:44:18,701 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2068 transitions. Word has length 26 [2025-02-06 10:44:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,701 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 2068 transitions. [2025-02-06 10:44:18,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2068 transitions. [2025-02-06 10:44:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:44:18,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:44:18,704 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash 298673855, now seen corresponding path program 1 times [2025-02-06 10:44:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427855262] [2025-02-06 10:44:18,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:44:18,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:44:18,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427855262] [2025-02-06 10:44:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427855262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454518929] [2025-02-06 10:44:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,737 INFO L87 Difference]: Start difference. First operand 1270 states and 2068 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,753 INFO L93 Difference]: Finished difference Result 2313 states and 3814 transitions. [2025-02-06 10:44:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:44:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,759 INFO L225 Difference]: With dead ends: 2313 [2025-02-06 10:44:18,759 INFO L226 Difference]: Without dead ends: 2313 [2025-02-06 10:44:18,759 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-02-06 10:44:18,760 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 49 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2025-02-06 10:44:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1798. [2025-02-06 10:44:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1797 states have (on average 1.5870895937673901) internal successors, (2852), 1797 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2852 transitions. [2025-02-06 10:44:18,784 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2852 transitions. Word has length 26 [2025-02-06 10:44:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,784 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2852 transitions. [2025-02-06 10:44:18,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2852 transitions. [2025-02-06 10:44:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:44:18,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:44:18,786 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1651983552, now seen corresponding path program 1 times [2025-02-06 10:44:18,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9511341] [2025-02-06 10:44:18,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:44:18,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:44:18,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9511341] [2025-02-06 10:44:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9511341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419117623] [2025-02-06 10:44:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,811 INFO L87 Difference]: Start difference. First operand 1798 states and 2852 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,828 INFO L93 Difference]: Finished difference Result 2473 states and 3910 transitions. [2025-02-06 10:44:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:44:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,834 INFO L225 Difference]: With dead ends: 2473 [2025-02-06 10:44:18,834 INFO L226 Difference]: Without dead ends: 2473 [2025-02-06 10:44:18,834 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-02-06 10:44:18,834 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:18,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2025-02-06 10:44:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2470. [2025-02-06 10:44:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 1.582827055488052) internal successors, (3908), 2469 states have internal predecessors, (3908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3908 transitions. [2025-02-06 10:44:18,864 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3908 transitions. Word has length 26 [2025-02-06 10:44:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,864 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3908 transitions. [2025-02-06 10:44:18,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3908 transitions. [2025-02-06 10:44:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:44:18,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:44:18,867 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash 669804473, now seen corresponding path program 1 times [2025-02-06 10:44:18,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776376091] [2025-02-06 10:44:18,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:44:18,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:44:18,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776376091] [2025-02-06 10:44:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776376091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859904991] [2025-02-06 10:44:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,884 INFO L87 Difference]: Start difference. First operand 2470 states and 3908 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,899 INFO L93 Difference]: Finished difference Result 2505 states and 3910 transitions. [2025-02-06 10:44:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:44:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:18,905 INFO L225 Difference]: With dead ends: 2505 [2025-02-06 10:44:18,905 INFO L226 Difference]: Without dead ends: 2505 [2025-02-06 10:44:18,905 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-02-06 10:44:18,905 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 191 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-02-06 10:44:18,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-02-06 10:44:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2502. [2025-02-06 10:44:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2501 states have (on average 1.5625749700119953) internal successors, (3908), 2501 states have internal predecessors, (3908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 3908 transitions. [2025-02-06 10:44:18,950 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 3908 transitions. Word has length 27 [2025-02-06 10:44:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:18,950 INFO L471 AbstractCegarLoop]: Abstraction has 2502 states and 3908 transitions. [2025-02-06 10:44:18,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3908 transitions. [2025-02-06 10:44:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:44:18,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:18,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:18,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:44:18,953 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash -327267880, now seen corresponding path program 1 times [2025-02-06 10:44:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:18,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35540906] [2025-02-06 10:44:18,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:18,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:18,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:44:18,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:44:18,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:18,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:18,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:18,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35540906] [2025-02-06 10:44:18,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35540906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:18,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:18,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:18,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540867474] [2025-02-06 10:44:18,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:18,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:18,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:18,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:18,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:18,972 INFO L87 Difference]: Start difference. First operand 2502 states and 3908 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:18,994 INFO L93 Difference]: Finished difference Result 4489 states and 7110 transitions. [2025-02-06 10:44:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:44:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:19,005 INFO L225 Difference]: With dead ends: 4489 [2025-02-06 10:44:19,005 INFO L226 Difference]: Without dead ends: 4489 [2025-02-06 10:44:19,005 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-02-06 10:44:19,006 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 46 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:19,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2025-02-06 10:44:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 3590. [2025-02-06 10:44:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 3589 states have (on average 1.5168570632488159) internal successors, (5444), 3589 states have internal predecessors, (5444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5444 transitions. [2025-02-06 10:44:19,064 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5444 transitions. Word has length 27 [2025-02-06 10:44:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:19,064 INFO L471 AbstractCegarLoop]: Abstraction has 3590 states and 5444 transitions. [2025-02-06 10:44:19,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5444 transitions. [2025-02-06 10:44:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:44:19,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:19,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:19,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:44:19,068 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:19,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1026041817, now seen corresponding path program 1 times [2025-02-06 10:44:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:19,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155665059] [2025-02-06 10:44:19,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:19,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:19,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:44:19,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:44:19,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:19,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:19,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:19,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155665059] [2025-02-06 10:44:19,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155665059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:19,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:19,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:19,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197734290] [2025-02-06 10:44:19,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:19,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:19,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:19,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:19,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:19,088 INFO L87 Difference]: Start difference. First operand 3590 states and 5444 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:19,114 INFO L93 Difference]: Finished difference Result 4873 states and 7366 transitions. [2025-02-06 10:44:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:19,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:44:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:19,125 INFO L225 Difference]: With dead ends: 4873 [2025-02-06 10:44:19,125 INFO L226 Difference]: Without dead ends: 4873 [2025-02-06 10:44:19,125 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-02-06 10:44:19,126 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:19,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2025-02-06 10:44:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4870. [2025-02-06 10:44:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4870 states, 4869 states have (on average 1.512425549394126) internal successors, (7364), 4869 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 7364 transitions. [2025-02-06 10:44:19,213 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 7364 transitions. Word has length 27 [2025-02-06 10:44:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:19,213 INFO L471 AbstractCegarLoop]: Abstraction has 4870 states and 7364 transitions. [2025-02-06 10:44:19,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 7364 transitions. [2025-02-06 10:44:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:44:19,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:19,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:19,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:44:19,218 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:19,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1554526855, now seen corresponding path program 1 times [2025-02-06 10:44:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990195124] [2025-02-06 10:44:19,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:19,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:44:19,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:44:19,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:19,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990195124] [2025-02-06 10:44:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990195124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394307522] [2025-02-06 10:44:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:19,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:19,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:19,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:19,239 INFO L87 Difference]: Start difference. First operand 4870 states and 7364 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:19,266 INFO L93 Difference]: Finished difference Result 4937 states and 7366 transitions. [2025-02-06 10:44:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:19,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 10:44:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:19,274 INFO L225 Difference]: With dead ends: 4937 [2025-02-06 10:44:19,274 INFO L226 Difference]: Without dead ends: 4937 [2025-02-06 10:44:19,275 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-02-06 10:44:19,275 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 187 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-02-06 10:44:19,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2025-02-06 10:44:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 4934. [2025-02-06 10:44:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4934 states, 4933 states have (on average 1.4928035678086358) internal successors, (7364), 4933 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 7364 transitions. [2025-02-06 10:44:19,357 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 7364 transitions. Word has length 28 [2025-02-06 10:44:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:19,357 INFO L471 AbstractCegarLoop]: Abstraction has 4934 states and 7364 transitions. [2025-02-06 10:44:19,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 7364 transitions. [2025-02-06 10:44:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:44:19,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:19,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:19,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:44:19,362 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:19,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1743368088, now seen corresponding path program 1 times [2025-02-06 10:44:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719319934] [2025-02-06 10:44:19,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:19,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:44:19,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:44:19,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:19,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:19,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:19,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719319934] [2025-02-06 10:44:19,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719319934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:19,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:19,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:19,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421961733] [2025-02-06 10:44:19,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:19,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:19,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:19,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:19,395 INFO L87 Difference]: Start difference. First operand 4934 states and 7364 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:19,442 INFO L93 Difference]: Finished difference Result 8713 states and 13190 transitions. [2025-02-06 10:44:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 10:44:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:19,457 INFO L225 Difference]: With dead ends: 8713 [2025-02-06 10:44:19,457 INFO L226 Difference]: Without dead ends: 8713 [2025-02-06 10:44:19,457 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-02-06 10:44:19,458 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 152 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-02-06 10:44:19,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8713 states. [2025-02-06 10:44:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8713 to 7174. [2025-02-06 10:44:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7174 states, 7173 states have (on average 1.4459779729541336) internal successors, (10372), 7173 states have internal predecessors, (10372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7174 states to 7174 states and 10372 transitions. [2025-02-06 10:44:19,578 INFO L78 Accepts]: Start accepts. Automaton has 7174 states and 10372 transitions. Word has length 28 [2025-02-06 10:44:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:19,578 INFO L471 AbstractCegarLoop]: Abstraction has 7174 states and 10372 transitions. [2025-02-06 10:44:19,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7174 states and 10372 transitions. [2025-02-06 10:44:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:44:19,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:19,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:19,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:44:19,584 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:19,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1198289511, now seen corresponding path program 1 times [2025-02-06 10:44:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:19,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928806820] [2025-02-06 10:44:19,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:19,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:44:19,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:44:19,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:19,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928806820] [2025-02-06 10:44:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928806820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:19,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:19,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271796284] [2025-02-06 10:44:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:19,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:19,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:19,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:19,600 INFO L87 Difference]: Start difference. First operand 7174 states and 10372 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:19,638 INFO L93 Difference]: Finished difference Result 9609 states and 13830 transitions. [2025-02-06 10:44:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 10:44:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:19,650 INFO L225 Difference]: With dead ends: 9609 [2025-02-06 10:44:19,650 INFO L226 Difference]: Without dead ends: 9609 [2025-02-06 10:44:19,650 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-02-06 10:44:19,650 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:19,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9609 states. [2025-02-06 10:44:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9609 to 9606. [2025-02-06 10:44:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9606 states, 9605 states have (on average 1.4396668401874024) internal successors, (13828), 9605 states have internal predecessors, (13828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9606 states to 9606 states and 13828 transitions. [2025-02-06 10:44:19,765 INFO L78 Accepts]: Start accepts. Automaton has 9606 states and 13828 transitions. Word has length 28 [2025-02-06 10:44:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:19,765 INFO L471 AbstractCegarLoop]: Abstraction has 9606 states and 13828 transitions. [2025-02-06 10:44:19,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9606 states and 13828 transitions. [2025-02-06 10:44:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:44:19,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:19,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 10:44:19,772 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:19,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1789328014, now seen corresponding path program 1 times [2025-02-06 10:44:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464133510] [2025-02-06 10:44:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:19,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:44:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:44:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:19,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464133510] [2025-02-06 10:44:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464133510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:19,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:19,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615275343] [2025-02-06 10:44:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:19,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:19,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:19,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:19,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:19,787 INFO L87 Difference]: Start difference. First operand 9606 states and 13828 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:19,826 INFO L93 Difference]: Finished difference Result 9737 states and 13830 transitions. [2025-02-06 10:44:19,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:19,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:44:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:19,838 INFO L225 Difference]: With dead ends: 9737 [2025-02-06 10:44:19,838 INFO L226 Difference]: Without dead ends: 9737 [2025-02-06 10:44:19,838 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-02-06 10:44:19,839 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 183 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-02-06 10:44:19,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9737 states. [2025-02-06 10:44:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9737 to 9734. [2025-02-06 10:44:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9734 states, 9733 states have (on average 1.4207335867666702) internal successors, (13828), 9733 states have internal predecessors, (13828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9734 states to 9734 states and 13828 transitions. [2025-02-06 10:44:19,984 INFO L78 Accepts]: Start accepts. Automaton has 9734 states and 13828 transitions. Word has length 29 [2025-02-06 10:44:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:19,984 INFO L471 AbstractCegarLoop]: Abstraction has 9734 states and 13828 transitions. [2025-02-06 10:44:19,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9734 states and 13828 transitions. [2025-02-06 10:44:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:44:19,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:19,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:19,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:44:19,990 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:19,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:19,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1508566929, now seen corresponding path program 1 times [2025-02-06 10:44:19,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:19,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581648736] [2025-02-06 10:44:19,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:19,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:19,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:44:19,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:44:19,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:19,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581648736] [2025-02-06 10:44:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581648736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340628401] [2025-02-06 10:44:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:20,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:20,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:20,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:20,006 INFO L87 Difference]: Start difference. First operand 9734 states and 13828 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:20,065 INFO L93 Difference]: Finished difference Result 16905 states and 24326 transitions. [2025-02-06 10:44:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:44:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:20,088 INFO L225 Difference]: With dead ends: 16905 [2025-02-06 10:44:20,089 INFO L226 Difference]: Without dead ends: 16905 [2025-02-06 10:44:20,089 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-02-06 10:44:20,089 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:20,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16905 states. [2025-02-06 10:44:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16905 to 14342. [2025-02-06 10:44:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14342 states, 14341 states have (on average 1.3747995258350185) internal successors, (19716), 14341 states have internal predecessors, (19716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14342 states to 14342 states and 19716 transitions. [2025-02-06 10:44:20,310 INFO L78 Accepts]: Start accepts. Automaton has 14342 states and 19716 transitions. Word has length 29 [2025-02-06 10:44:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:20,310 INFO L471 AbstractCegarLoop]: Abstraction has 14342 states and 19716 transitions. [2025-02-06 10:44:20,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 14342 states and 19716 transitions. [2025-02-06 10:44:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:44:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:20,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:20,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 10:44:20,322 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1433090670, now seen corresponding path program 1 times [2025-02-06 10:44:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:20,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559099192] [2025-02-06 10:44:20,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:20,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:20,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:44:20,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:44:20,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:20,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:20,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:20,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559099192] [2025-02-06 10:44:20,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559099192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:20,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:20,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308238853] [2025-02-06 10:44:20,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:20,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:20,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:20,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:20,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:20,337 INFO L87 Difference]: Start difference. First operand 14342 states and 19716 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:20,367 INFO L93 Difference]: Finished difference Result 18953 states and 25862 transitions. [2025-02-06 10:44:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:44:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:20,391 INFO L225 Difference]: With dead ends: 18953 [2025-02-06 10:44:20,392 INFO L226 Difference]: Without dead ends: 18953 [2025-02-06 10:44:20,392 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-02-06 10:44:20,392 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:20,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18953 states. [2025-02-06 10:44:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18953 to 18950. [2025-02-06 10:44:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18950 states, 18949 states have (on average 1.3647158161380548) internal successors, (25860), 18949 states have internal predecessors, (25860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18950 states to 18950 states and 25860 transitions. [2025-02-06 10:44:20,677 INFO L78 Accepts]: Start accepts. Automaton has 18950 states and 25860 transitions. Word has length 29 [2025-02-06 10:44:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:20,678 INFO L471 AbstractCegarLoop]: Abstraction has 18950 states and 25860 transitions. [2025-02-06 10:44:20,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 18950 states and 25860 transitions. [2025-02-06 10:44:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:44:20,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:20,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:20,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 10:44:20,691 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:20,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash -478236078, now seen corresponding path program 1 times [2025-02-06 10:44:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:20,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677419311] [2025-02-06 10:44:20,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:20,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:44:20,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:44:20,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:20,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:20,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:20,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677419311] [2025-02-06 10:44:20,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677419311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:20,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:20,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766751272] [2025-02-06 10:44:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:20,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:20,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:20,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:20,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:20,713 INFO L87 Difference]: Start difference. First operand 18950 states and 25860 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:20,751 INFO L93 Difference]: Finished difference Result 19209 states and 25862 transitions. [2025-02-06 10:44:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:44:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:20,778 INFO L225 Difference]: With dead ends: 19209 [2025-02-06 10:44:20,779 INFO L226 Difference]: Without dead ends: 19209 [2025-02-06 10:44:20,779 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-02-06 10:44:20,779 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 179 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-02-06 10:44:20,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19209 states. [2025-02-06 10:44:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19209 to 19206. [2025-02-06 10:44:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19206 states, 19205 states have (on average 1.3465243426191096) internal successors, (25860), 19205 states have internal predecessors, (25860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19206 states to 19206 states and 25860 transitions. [2025-02-06 10:44:21,001 INFO L78 Accepts]: Start accepts. Automaton has 19206 states and 25860 transitions. Word has length 30 [2025-02-06 10:44:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:21,001 INFO L471 AbstractCegarLoop]: Abstraction has 19206 states and 25860 transitions. [2025-02-06 10:44:21,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 19206 states and 25860 transitions. [2025-02-06 10:44:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:44:21,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:21,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:21,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 10:44:21,018 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:21,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1475308431, now seen corresponding path program 1 times [2025-02-06 10:44:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:21,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924281966] [2025-02-06 10:44:21,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:21,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:44:21,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:44:21,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:21,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:21,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924281966] [2025-02-06 10:44:21,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924281966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:21,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:21,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627543610] [2025-02-06 10:44:21,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:21,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:21,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:21,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:21,036 INFO L87 Difference]: Start difference. First operand 19206 states and 25860 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:21,095 INFO L93 Difference]: Finished difference Result 32777 states and 44550 transitions. [2025-02-06 10:44:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:44:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:21,149 INFO L225 Difference]: With dead ends: 32777 [2025-02-06 10:44:21,150 INFO L226 Difference]: Without dead ends: 32777 [2025-02-06 10:44:21,150 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-02-06 10:44:21,150 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 37 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:21,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32777 states. [2025-02-06 10:44:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32777 to 28678. [2025-02-06 10:44:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28678 states, 28677 states have (on average 1.30348362799456) internal successors, (37380), 28677 states have internal predecessors, (37380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28678 states to 28678 states and 37380 transitions. [2025-02-06 10:44:21,488 INFO L78 Accepts]: Start accepts. Automaton has 28678 states and 37380 transitions. Word has length 30 [2025-02-06 10:44:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:21,488 INFO L471 AbstractCegarLoop]: Abstraction has 28678 states and 37380 transitions. [2025-02-06 10:44:21,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 28678 states and 37380 transitions. [2025-02-06 10:44:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:44:21,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:21,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:21,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 10:44:21,504 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:21,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash -121998734, now seen corresponding path program 1 times [2025-02-06 10:44:21,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:21,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640601586] [2025-02-06 10:44:21,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:21,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:21,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:44:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:44:21,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:21,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640601586] [2025-02-06 10:44:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640601586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879760385] [2025-02-06 10:44:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:21,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:21,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:21,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:21,528 INFO L87 Difference]: Start difference. First operand 28678 states and 37380 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:21,581 INFO L93 Difference]: Finished difference Result 37385 states and 48134 transitions. [2025-02-06 10:44:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:44:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:21,630 INFO L225 Difference]: With dead ends: 37385 [2025-02-06 10:44:21,630 INFO L226 Difference]: Without dead ends: 37385 [2025-02-06 10:44:21,630 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-02-06 10:44:21,630 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:21,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37385 states. [2025-02-06 10:44:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37385 to 37382. [2025-02-06 10:44:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37382 states, 37381 states have (on average 1.2876060030496776) internal successors, (48132), 37381 states have internal predecessors, (48132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37382 states to 37382 states and 48132 transitions. [2025-02-06 10:44:22,075 INFO L78 Accepts]: Start accepts. Automaton has 37382 states and 48132 transitions. Word has length 30 [2025-02-06 10:44:22,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:22,076 INFO L471 AbstractCegarLoop]: Abstraction has 37382 states and 48132 transitions. [2025-02-06 10:44:22,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 37382 states and 48132 transitions. [2025-02-06 10:44:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:44:22,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:22,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:22,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 10:44:22,094 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:22,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1510901547, now seen corresponding path program 1 times [2025-02-06 10:44:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948268148] [2025-02-06 10:44:22,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:22,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:44:22,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:44:22,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:22,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:22,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948268148] [2025-02-06 10:44:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948268148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274233990] [2025-02-06 10:44:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:22,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:22,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:22,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:22,118 INFO L87 Difference]: Start difference. First operand 37382 states and 48132 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:22,350 INFO L93 Difference]: Finished difference Result 37897 states and 48134 transitions. [2025-02-06 10:44:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 10:44:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:22,421 INFO L225 Difference]: With dead ends: 37897 [2025-02-06 10:44:22,424 INFO L226 Difference]: Without dead ends: 37897 [2025-02-06 10:44:22,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-02-06 10:44:22,425 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 175 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-02-06 10:44:22,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37897 states. [2025-02-06 10:44:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37897 to 37894. [2025-02-06 10:44:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37894 states, 37893 states have (on average 1.2702082178766527) internal successors, (48132), 37893 states have internal predecessors, (48132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37894 states to 37894 states and 48132 transitions. [2025-02-06 10:44:22,749 INFO L78 Accepts]: Start accepts. Automaton has 37894 states and 48132 transitions. Word has length 31 [2025-02-06 10:44:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:22,750 INFO L471 AbstractCegarLoop]: Abstraction has 37894 states and 48132 transitions. [2025-02-06 10:44:22,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 37894 states and 48132 transitions. [2025-02-06 10:44:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:44:22,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:22,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:22,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 10:44:22,765 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:22,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:22,765 INFO L85 PathProgramCache]: Analyzing trace with hash 513829194, now seen corresponding path program 1 times [2025-02-06 10:44:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:22,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641785922] [2025-02-06 10:44:22,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:44:22,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:44:22,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:22,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641785922] [2025-02-06 10:44:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641785922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842916216] [2025-02-06 10:44:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:22,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:22,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:22,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:22,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:22,784 INFO L87 Difference]: Start difference. First operand 37894 states and 48132 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:22,869 INFO L93 Difference]: Finished difference Result 63497 states and 80902 transitions. [2025-02-06 10:44:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 10:44:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:22,937 INFO L225 Difference]: With dead ends: 63497 [2025-02-06 10:44:22,938 INFO L226 Difference]: Without dead ends: 63497 [2025-02-06 10:44:22,938 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-02-06 10:44:22,939 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 34 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:22,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63497 states. [2025-02-06 10:44:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63497 to 57350. [2025-02-06 10:44:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57350 states, 57349 states have (on average 1.2321051805611258) internal successors, (70660), 57349 states have internal predecessors, (70660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57350 states to 57350 states and 70660 transitions. [2025-02-06 10:44:23,682 INFO L78 Accepts]: Start accepts. Automaton has 57350 states and 70660 transitions. Word has length 31 [2025-02-06 10:44:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:23,682 INFO L471 AbstractCegarLoop]: Abstraction has 57350 states and 70660 transitions. [2025-02-06 10:44:23,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 57350 states and 70660 transitions. [2025-02-06 10:44:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:44:23,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:23,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:23,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 10:44:23,716 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:23,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1867138891, now seen corresponding path program 1 times [2025-02-06 10:44:23,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:23,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63937250] [2025-02-06 10:44:23,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:23,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:44:23,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:44:23,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:23,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63937250] [2025-02-06 10:44:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63937250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:23,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:23,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:23,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130521810] [2025-02-06 10:44:23,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:23,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:23,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:23,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:23,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:23,736 INFO L87 Difference]: Start difference. First operand 57350 states and 70660 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:23,863 INFO L93 Difference]: Finished difference Result 73737 states and 89094 transitions. [2025-02-06 10:44:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 10:44:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:23,931 INFO L225 Difference]: With dead ends: 73737 [2025-02-06 10:44:23,931 INFO L226 Difference]: Without dead ends: 73737 [2025-02-06 10:44:23,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-02-06 10:44:23,931 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 197 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-02-06 10:44:23,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73737 states. [2025-02-06 10:44:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73737 to 73734. [2025-02-06 10:44:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73734 states, 73733 states have (on average 1.2083056433347348) internal successors, (89092), 73733 states have internal predecessors, (89092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73734 states to 73734 states and 89092 transitions. [2025-02-06 10:44:24,896 INFO L78 Accepts]: Start accepts. Automaton has 73734 states and 89092 transitions. Word has length 31 [2025-02-06 10:44:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:24,896 INFO L471 AbstractCegarLoop]: Abstraction has 73734 states and 89092 transitions. [2025-02-06 10:44:24,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 73734 states and 89092 transitions. [2025-02-06 10:44:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:44:24,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:24,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:24,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 10:44:24,921 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1250348245, now seen corresponding path program 1 times [2025-02-06 10:44:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628154493] [2025-02-06 10:44:24,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:24,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:44:24,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:44:24,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:24,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628154493] [2025-02-06 10:44:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628154493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:24,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:24,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:24,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55506327] [2025-02-06 10:44:24,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:24,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:24,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:24,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:24,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:24,938 INFO L87 Difference]: Start difference. First operand 73734 states and 89092 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:25,427 INFO L93 Difference]: Finished difference Result 74761 states and 89094 transitions. [2025-02-06 10:44:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:25,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:44:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:25,606 INFO L225 Difference]: With dead ends: 74761 [2025-02-06 10:44:25,610 INFO L226 Difference]: Without dead ends: 74761 [2025-02-06 10:44:25,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:25,611 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 171 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-02-06 10:44:25,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74761 states. [2025-02-06 10:44:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74761 to 74758. [2025-02-06 10:44:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74758 states, 74757 states have (on average 1.1917546182966143) internal successors, (89092), 74757 states have internal predecessors, (89092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74758 states to 74758 states and 89092 transitions. [2025-02-06 10:44:26,521 INFO L78 Accepts]: Start accepts. Automaton has 74758 states and 89092 transitions. Word has length 32 [2025-02-06 10:44:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:26,521 INFO L471 AbstractCegarLoop]: Abstraction has 74758 states and 89092 transitions. [2025-02-06 10:44:26,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 74758 states and 89092 transitions. [2025-02-06 10:44:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:44:26,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:26,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:26,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 10:44:26,559 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:26,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2047546698, now seen corresponding path program 1 times [2025-02-06 10:44:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142553604] [2025-02-06 10:44:26,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:26,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:44:26,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:44:26,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:26,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142553604] [2025-02-06 10:44:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142553604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574369205] [2025-02-06 10:44:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:26,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:26,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:26,580 INFO L87 Difference]: Start difference. First operand 74758 states and 89092 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:26,803 INFO L93 Difference]: Finished difference Result 122889 states and 145414 transitions. [2025-02-06 10:44:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:26,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:44:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:27,188 INFO L225 Difference]: With dead ends: 122889 [2025-02-06 10:44:27,189 INFO L226 Difference]: Without dead ends: 122889 [2025-02-06 10:44:27,189 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-02-06 10:44:27,190 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:27,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122889 states. [2025-02-06 10:44:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122889 to 114694. [2025-02-06 10:44:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114694 states, 114693 states have (on average 1.1606985605050002) internal successors, (133124), 114693 states have internal predecessors, (133124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114694 states to 114694 states and 133124 transitions. [2025-02-06 10:44:28,117 INFO L78 Accepts]: Start accepts. Automaton has 114694 states and 133124 transitions. Word has length 32 [2025-02-06 10:44:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:28,117 INFO L471 AbstractCegarLoop]: Abstraction has 114694 states and 133124 transitions. [2025-02-06 10:44:28,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 114694 states and 133124 transitions. [2025-02-06 10:44:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:44:28,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:28,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:28,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 10:44:28,398 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:28,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash -894110901, now seen corresponding path program 1 times [2025-02-06 10:44:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984856313] [2025-02-06 10:44:28,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:28,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:44:28,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:44:28,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:28,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:28,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:28,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984856313] [2025-02-06 10:44:28,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984856313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:28,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:28,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:28,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722650799] [2025-02-06 10:44:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:28,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:28,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:28,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:28,421 INFO L87 Difference]: Start difference. First operand 114694 states and 133124 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:28,635 INFO L93 Difference]: Finished difference Result 145417 states and 163846 transitions. [2025-02-06 10:44:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:44:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:28,772 INFO L225 Difference]: With dead ends: 145417 [2025-02-06 10:44:28,772 INFO L226 Difference]: Without dead ends: 145417 [2025-02-06 10:44:28,773 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-02-06 10:44:28,773 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 53 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 198 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-02-06 10:44:28,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 198 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145417 states. [2025-02-06 10:44:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145417 to 145414. [2025-02-06 10:44:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145414 states, 145413 states have (on average 1.1267493277767462) internal successors, (163844), 145413 states have internal predecessors, (163844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145414 states to 145414 states and 163844 transitions. [2025-02-06 10:44:30,554 INFO L78 Accepts]: Start accepts. Automaton has 145414 states and 163844 transitions. Word has length 32 [2025-02-06 10:44:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:30,554 INFO L471 AbstractCegarLoop]: Abstraction has 145414 states and 163844 transitions. [2025-02-06 10:44:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 145414 states and 163844 transitions. [2025-02-06 10:44:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:44:30,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:30,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 10:44:30,609 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:30,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash -949752604, now seen corresponding path program 1 times [2025-02-06 10:44:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:30,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072953389] [2025-02-06 10:44:30,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:30,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:44:30,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:44:30,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:30,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:30,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:30,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072953389] [2025-02-06 10:44:30,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072953389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:30,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:30,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:30,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541827223] [2025-02-06 10:44:30,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:30,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:30,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:30,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:30,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:30,648 INFO L87 Difference]: Start difference. First operand 145414 states and 163844 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:30,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:30,913 INFO L93 Difference]: Finished difference Result 147465 states and 163846 transitions. [2025-02-06 10:44:30,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:30,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-02-06 10:44:30,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:31,069 INFO L225 Difference]: With dead ends: 147465 [2025-02-06 10:44:31,070 INFO L226 Difference]: Without dead ends: 147465 [2025-02-06 10:44:31,070 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-02-06 10:44:31,070 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 55 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 167 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-02-06 10:44:31,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147465 states. [2025-02-06 10:44:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147465 to 147462. [2025-02-06 10:44:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147462 states, 147461 states have (on average 1.1111005621825432) internal successors, (163844), 147461 states have internal predecessors, (163844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147462 states to 147462 states and 163844 transitions. [2025-02-06 10:44:32,728 INFO L78 Accepts]: Start accepts. Automaton has 147462 states and 163844 transitions. Word has length 33 [2025-02-06 10:44:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:32,728 INFO L471 AbstractCegarLoop]: Abstraction has 147462 states and 163844 transitions. [2025-02-06 10:44:32,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 147462 states and 163844 transitions. [2025-02-06 10:44:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:44:32,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:32,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:32,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 10:44:32,804 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1946824957, now seen corresponding path program 1 times [2025-02-06 10:44:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:32,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095444501] [2025-02-06 10:44:32,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:32,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:32,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:44:32,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:44:32,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:32,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:32,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095444501] [2025-02-06 10:44:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095444501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902024429] [2025-02-06 10:44:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:32,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:32,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:32,820 INFO L87 Difference]: Start difference. First operand 147462 states and 163844 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:33,548 INFO L93 Difference]: Finished difference Result 237574 states and 258052 transitions. [2025-02-06 10:44:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:33,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-02-06 10:44:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:33,808 INFO L225 Difference]: With dead ends: 237574 [2025-02-06 10:44:33,808 INFO L226 Difference]: Without dead ends: 237574 [2025-02-06 10:44:33,808 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-02-06 10:44:33,809 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 140 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-02-06 10:44:33,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237574 states. [2025-02-06 10:44:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237574 to 229382. [2025-02-06 10:44:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229382 states, 229381 states have (on average 1.0892794084950366) internal successors, (249860), 229381 states have internal predecessors, (249860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229382 states to 229382 states and 249860 transitions. [2025-02-06 10:44:36,215 INFO L78 Accepts]: Start accepts. Automaton has 229382 states and 249860 transitions. Word has length 33 [2025-02-06 10:44:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:36,215 INFO L471 AbstractCegarLoop]: Abstraction has 229382 states and 249860 transitions. [2025-02-06 10:44:36,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 229382 states and 249860 transitions. [2025-02-06 10:44:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:44:36,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:36,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:36,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 10:44:36,795 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:36,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash -593515260, now seen corresponding path program 1 times [2025-02-06 10:44:36,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:36,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636072056] [2025-02-06 10:44:36,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:36,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:36,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:44:36,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:44:36,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:36,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636072056] [2025-02-06 10:44:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636072056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:36,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333009652] [2025-02-06 10:44:36,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:36,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:36,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:36,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:36,811 INFO L87 Difference]: Start difference. First operand 229382 states and 249860 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:37,290 INFO L93 Difference]: Finished difference Result 286723 states and 299010 transitions. [2025-02-06 10:44:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:37,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-02-06 10:44:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:37,291 INFO L225 Difference]: With dead ends: 286723 [2025-02-06 10:44:37,291 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:44:37,292 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-02-06 10:44:37,294 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:37,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:44:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:44:37,294 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-02-06 10:44:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:44:37,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2025-02-06 10:44:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:37,295 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:44:37,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:44:37,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:44:37,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-06 10:44:37,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-06 10:44:37,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 10:44:37,303 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:37,310 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:44:37,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:44:37 BoogieIcfgContainer [2025-02-06 10:44:37,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:44:37,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:44:37,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:44:37,315 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:44:37,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:17" (3/4) ... [2025-02-06 10:44:37,317 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:44:37,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 10:44:37,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 10:44:37,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 10:44:37,332 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 10:44:37,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:44:37,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:44:37,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:44:37,389 INFO L158 Benchmark]: Toolchain (without parser) took 20437.83ms. Allocated memory was 142.6MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 106.2MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-02-06 10:44:37,389 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:44:37,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.95ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 94.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:44:37,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.75ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:44:37,389 INFO L158 Benchmark]: Boogie Preprocessor took 21.51ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 92.0MB in the end (delta: 985.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:44:37,389 INFO L158 Benchmark]: IcfgBuilder took 264.80ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 74.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:44:37,389 INFO L158 Benchmark]: TraceAbstraction took 19896.83ms. Allocated memory was 142.6MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 73.3MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-02-06 10:44:37,390 INFO L158 Benchmark]: Witness Printer took 75.83ms. Allocated memory is still 12.9GB. Free memory was 10.1GB in the beginning and 10.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:44:37,390 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.95ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 94.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.75ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.51ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 92.0MB in the end (delta: 985.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.80ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 74.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19896.83ms. Allocated memory was 142.6MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 73.3MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 75.83ms. Allocated memory is still 12.9GB. Free memory was 10.1GB in the beginning and 10.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.2s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2155 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2155 mSDsluCounter, 6948 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2741 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 4207 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229382occurred in iteration=39, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 32846 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1043 NumberOfCodeBlocks, 1043 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1003 ConstructedInterpolants, 0 QuantifiedInterpolants, 2181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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-02-06 10:44:37,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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