./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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_14-1.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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:46:56,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:46:56,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:46:56,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:46:56,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:46:56,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:46:56,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:46:56,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:46:56,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:46:56,122 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:46:56,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:46:56,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:46:56,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:46:56,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:46:56,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:46:56,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:56,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:56,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:46:56,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:46:56,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:46:56,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:46:56,125 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2025-01-09 22:46:56,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:46:56,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:46:56,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:46:56,342 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:46:56,342 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:46:56,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2025-01-09 22:46:57,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6d2b1102/50d6cd98d6284ee7b40ceb0b1899f380/FLAG4f7b96e67 [2025-01-09 22:46:57,766 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:46:57,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2025-01-09 22:46:57,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6d2b1102/50d6cd98d6284ee7b40ceb0b1899f380/FLAG4f7b96e67 [2025-01-09 22:46:58,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6d2b1102/50d6cd98d6284ee7b40ceb0b1899f380 [2025-01-09 22:46:58,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:46:58,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:46:58,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:46:58,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:46:58,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:46:58,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610fdb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58, skipping insertion in model container [2025-01-09 22:46:58,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:46:58,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:46:58,196 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:46:58,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:46:58,221 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:46:58,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58 WrapperNode [2025-01-09 22:46:58,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:46:58,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:46:58,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:46:58,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:46:58,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,243 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-01-09 22:46:58,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:46:58,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:46:58,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:46:58,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:46:58,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,258 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-01-09 22:46:58,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:46:58,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:46:58,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:46:58,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:46:58,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (1/1) ... [2025-01-09 22:46:58,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:58,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:46:58,292 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-01-09 22:46:58,297 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-01-09 22:46:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:46:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:46:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:46:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:46:58,351 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:46:58,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:46:58,597 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-09 22:46:58,597 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:46:58,607 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:46:58,607 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:46:58,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:58 BoogieIcfgContainer [2025-01-09 22:46:58,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:46:58,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:46:58,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:46:58,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:46:58,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:46:58" (1/3) ... [2025-01-09 22:46:58,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6816a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:46:58, skipping insertion in model container [2025-01-09 22:46:58,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:58" (2/3) ... [2025-01-09 22:46:58,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6816a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:46:58, skipping insertion in model container [2025-01-09 22:46:58,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:58" (3/3) ... [2025-01-09 22:46:58,614 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2025-01-09 22:46:58,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:46:58,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_14-1.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-09 22:46:58,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:46:58,657 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;@775e557e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:46:58,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 22:46:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:46:58,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:58,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:46:58,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:58,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:58,667 INFO L85 PathProgramCache]: Analyzing trace with hash 28938048, now seen corresponding path program 1 times [2025-01-09 22:46:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196019067] [2025-01-09 22:46:58,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:46:58,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:46:58,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:58,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196019067] [2025-01-09 22:46:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196019067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:46:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804166046] [2025-01-09 22:46:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:58,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:46:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:58,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:46:58,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:46:58,802 INFO L87 Difference]: Start difference. First operand has 55 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 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-01-09 22:46:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:58,810 INFO L93 Difference]: Finished difference Result 54 states and 95 transitions. [2025-01-09 22:46:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:46:58,811 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-01-09 22:46:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:58,816 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:46:58,816 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 22:46:58,817 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-01-09 22:46:58,818 INFO L435 NwaCegarLoop]: 95 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, 95 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-01-09 22:46:58,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 22:46:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 22:46:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.86) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 93 transitions. [2025-01-09 22:46:58,840 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 93 transitions. Word has length 5 [2025-01-09 22:46:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:58,840 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 93 transitions. [2025-01-09 22:46:58,840 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-01-09 22:46:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 93 transitions. [2025-01-09 22:46:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:46:58,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:58,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:46:58,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:46:58,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:58,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash 889546222, now seen corresponding path program 1 times [2025-01-09 22:46:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081438024] [2025-01-09 22:46:58,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:58,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:58,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:46:58,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:46:58,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:58,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081438024] [2025-01-09 22:46:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081438024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:58,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:58,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:46:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958728034] [2025-01-09 22:46:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:58,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:58,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:58,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:58,892 INFO L87 Difference]: Start difference. First operand 52 states and 93 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-01-09 22:46:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:58,899 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2025-01-09 22:46:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:58,900 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-01-09 22:46:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:58,901 INFO L225 Difference]: With dead ends: 51 [2025-01-09 22:46:58,901 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:46:58,901 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-01-09 22:46:58,901 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 92 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-01-09 22:46:58,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:46:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:46:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. [2025-01-09 22:46:58,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 90 transitions. Word has length 6 [2025-01-09 22:46:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:58,905 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 90 transitions. [2025-01-09 22:46:58,905 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-01-09 22:46:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 90 transitions. [2025-01-09 22:46:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:46:58,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:58,906 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-01-09 22:46:58,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:46:58,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:58,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1780540654, now seen corresponding path program 1 times [2025-01-09 22:46:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:58,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67050386] [2025-01-09 22:46:58,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:58,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:46:58,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:46:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:58,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:58,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67050386] [2025-01-09 22:46:58,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67050386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:58,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:58,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:58,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414554500] [2025-01-09 22:46:58,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:58,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:58,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:58,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:58,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:58,973 INFO L87 Difference]: Start difference. First operand 49 states and 90 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-01-09 22:46:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,002 INFO L93 Difference]: Finished difference Result 95 states and 174 transitions. [2025-01-09 22:46:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,002 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-01-09 22:46:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,003 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:46:59,003 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:46:59,004 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-01-09 22:46:59,004 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 178 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-01-09 22:46:59,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:46:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-01-09 22:46:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2025-01-09 22:46:59,012 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 22 [2025-01-09 22:46:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,012 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2025-01-09 22:46:59,012 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-01-09 22:46:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2025-01-09 22:46:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:46:59,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,013 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-01-09 22:46:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:46:59,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash 213604052, now seen corresponding path program 1 times [2025-01-09 22:46:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552849557] [2025-01-09 22:46:59,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:46:59,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:46:59,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552849557] [2025-01-09 22:46:59,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552849557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243327758] [2025-01-09 22:46:59,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,081 INFO L87 Difference]: Start difference. First operand 92 states and 172 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-01-09 22:46:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,106 INFO L93 Difference]: Finished difference Result 123 states and 227 transitions. [2025-01-09 22:46:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,106 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-01-09 22:46:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,107 INFO L225 Difference]: With dead ends: 123 [2025-01-09 22:46:59,107 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 22:46:59,107 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-01-09 22:46:59,108 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 69 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:59,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 255 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 22:46:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 92. [2025-01-09 22:46:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 171 transitions. [2025-01-09 22:46:59,113 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 171 transitions. Word has length 22 [2025-01-09 22:46:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,113 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 171 transitions. [2025-01-09 22:46:59,113 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-01-09 22:46:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2025-01-09 22:46:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:46:59,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,114 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-01-09 22:46:59,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:46:59,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash 644380351, now seen corresponding path program 1 times [2025-01-09 22:46:59,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202420245] [2025-01-09 22:46:59,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:46:59,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:46:59,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202420245] [2025-01-09 22:46:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202420245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542460489] [2025-01-09 22:46:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,178 INFO L87 Difference]: Start difference. First operand 92 states and 171 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-01-09 22:46:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,192 INFO L93 Difference]: Finished difference Result 178 states and 331 transitions. [2025-01-09 22:46:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,193 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-01-09 22:46:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,194 INFO L225 Difference]: With dead ends: 178 [2025-01-09 22:46:59,194 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 22:46:59,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-01-09 22:46:59,194 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 66 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 176 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-01-09 22:46:59,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 22:46:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 123. [2025-01-09 22:46:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.8770491803278688) internal successors, (229), 122 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 229 transitions. [2025-01-09 22:46:59,203 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 229 transitions. Word has length 23 [2025-01-09 22:46:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 229 transitions. [2025-01-09 22:46:59,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-01-09 22:46:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 229 transitions. [2025-01-09 22:46:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:46:59,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,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-01-09 22:46:59,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:46:59,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1349764355, now seen corresponding path program 1 times [2025-01-09 22:46:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621025342] [2025-01-09 22:46:59,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:46:59,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:46:59,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621025342] [2025-01-09 22:46:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621025342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589349515] [2025-01-09 22:46:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,236 INFO L87 Difference]: Start difference. First operand 123 states and 229 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-01-09 22:46:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,263 INFO L93 Difference]: Finished difference Result 180 states and 330 transitions. [2025-01-09 22:46:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,263 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-01-09 22:46:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,264 INFO L225 Difference]: With dead ends: 180 [2025-01-09 22:46:59,264 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 22:46:59,264 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-01-09 22:46:59,265 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 202 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-01-09 22:46:59,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 22:46:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2025-01-09 22:46:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.8636363636363635) internal successors, (328), 176 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 328 transitions. [2025-01-09 22:46:59,275 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 328 transitions. Word has length 23 [2025-01-09 22:46:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,275 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 328 transitions. [2025-01-09 22:46:59,275 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-01-09 22:46:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 328 transitions. [2025-01-09 22:46:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:46:59,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,279 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-01-09 22:46:59,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:46:59,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1492469251, now seen corresponding path program 1 times [2025-01-09 22:46:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706616830] [2025-01-09 22:46:59,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:46:59,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:46:59,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706616830] [2025-01-09 22:46:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706616830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720184730] [2025-01-09 22:46:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,336 INFO L87 Difference]: Start difference. First operand 177 states and 328 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-01-09 22:46:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,349 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2025-01-09 22:46:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,349 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-01-09 22:46:59,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,350 INFO L225 Difference]: With dead ends: 185 [2025-01-09 22:46:59,350 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 22:46:59,351 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-01-09 22:46:59,352 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 223 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-01-09 22:46:59,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 22:46:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2025-01-09 22:46:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.8342541436464088) internal successors, (332), 181 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 332 transitions. [2025-01-09 22:46:59,364 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 332 transitions. Word has length 24 [2025-01-09 22:46:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,365 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 332 transitions. [2025-01-09 22:46:59,365 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-01-09 22:46:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 332 transitions. [2025-01-09 22:46:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:46:59,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,366 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-01-09 22:46:59,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:46:59,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1113554303, now seen corresponding path program 1 times [2025-01-09 22:46:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759486138] [2025-01-09 22:46:59,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:46:59,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:46:59,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759486138] [2025-01-09 22:46:59,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759486138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139068331] [2025-01-09 22:46:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,409 INFO L87 Difference]: Start difference. First operand 182 states and 332 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-01-09 22:46:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,424 INFO L93 Difference]: Finished difference Result 345 states and 632 transitions. [2025-01-09 22:46:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,425 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-01-09 22:46:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,426 INFO L225 Difference]: With dead ends: 345 [2025-01-09 22:46:59,426 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 22:46:59,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,426 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 174 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-01-09 22:46:59,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 22:46:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 246. [2025-01-09 22:46:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.8204081632653062) internal successors, (446), 245 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 446 transitions. [2025-01-09 22:46:59,445 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 446 transitions. Word has length 24 [2025-01-09 22:46:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,445 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 446 transitions. [2025-01-09 22:46:59,445 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-01-09 22:46:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 446 transitions. [2025-01-09 22:46:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:46:59,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,446 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-01-09 22:46:59,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:46:59,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash -880590403, now seen corresponding path program 1 times [2025-01-09 22:46:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116068681] [2025-01-09 22:46:59,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:46:59,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:46:59,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116068681] [2025-01-09 22:46:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116068681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478910756] [2025-01-09 22:46:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,491 INFO L87 Difference]: Start difference. First operand 246 states and 446 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-01-09 22:46:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,501 INFO L93 Difference]: Finished difference Result 353 states and 634 transitions. [2025-01-09 22:46:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,502 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-01-09 22:46:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,503 INFO L225 Difference]: With dead ends: 353 [2025-01-09 22:46:59,503 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 22:46:59,503 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-01-09 22:46:59,504 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 203 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-01-09 22:46:59,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 22:46:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2025-01-09 22:46:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.810888252148997) internal successors, (632), 349 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 632 transitions. [2025-01-09 22:46:59,510 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 632 transitions. Word has length 24 [2025-01-09 22:46:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,510 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 632 transitions. [2025-01-09 22:46:59,510 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-01-09 22:46:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2025-01-09 22:46:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:46:59,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,511 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-01-09 22:46:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:46:59,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash 167031944, now seen corresponding path program 1 times [2025-01-09 22:46:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028450026] [2025-01-09 22:46:59,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:46:59,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:46:59,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028450026] [2025-01-09 22:46:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028450026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61453431] [2025-01-09 22:46:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,532 INFO L87 Difference]: Start difference. First operand 350 states and 632 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-01-09 22:46:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,541 INFO L93 Difference]: Finished difference Result 357 states and 634 transitions. [2025-01-09 22:46:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,542 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-01-09 22:46:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,543 INFO L225 Difference]: With dead ends: 357 [2025-01-09 22:46:59,543 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 22:46:59,543 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-01-09 22:46:59,543 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 219 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-01-09 22:46:59,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 219 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 22:46:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 354. [2025-01-09 22:46:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 632 transitions. [2025-01-09 22:46:59,551 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 632 transitions. Word has length 25 [2025-01-09 22:46:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 632 transitions. [2025-01-09 22:46:59,553 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-01-09 22:46:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 632 transitions. [2025-01-09 22:46:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:46:59,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,555 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-01-09 22:46:59,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:46:59,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1521911798, now seen corresponding path program 1 times [2025-01-09 22:46:59,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244836208] [2025-01-09 22:46:59,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:46:59,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:46:59,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244836208] [2025-01-09 22:46:59,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244836208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974379099] [2025-01-09 22:46:59,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,597 INFO L87 Difference]: Start difference. First operand 354 states and 632 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-01-09 22:46:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,609 INFO L93 Difference]: Finished difference Result 665 states and 1194 transitions. [2025-01-09 22:46:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,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-01-09 22:46:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,614 INFO L225 Difference]: With dead ends: 665 [2025-01-09 22:46:59,614 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 22:46:59,615 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-01-09 22:46:59,615 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 60 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 172 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-01-09 22:46:59,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 22:46:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 486. [2025-01-09 22:46:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 856 transitions. [2025-01-09 22:46:59,630 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 856 transitions. Word has length 25 [2025-01-09 22:46:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,630 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 856 transitions. [2025-01-09 22:46:59,630 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-01-09 22:46:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 856 transitions. [2025-01-09 22:46:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:46:59,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,631 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-01-09 22:46:59,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:46:59,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 778910792, now seen corresponding path program 1 times [2025-01-09 22:46:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74658178] [2025-01-09 22:46:59,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:46:59,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:46:59,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74658178] [2025-01-09 22:46:59,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74658178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670286746] [2025-01-09 22:46:59,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,674 INFO L87 Difference]: Start difference. First operand 486 states and 856 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-01-09 22:46:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,685 INFO L93 Difference]: Finished difference Result 689 states and 1206 transitions. [2025-01-09 22:46:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,687 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-01-09 22:46:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,689 INFO L225 Difference]: With dead ends: 689 [2025-01-09 22:46:59,689 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 22:46:59,690 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-01-09 22:46:59,690 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 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-01-09 22:46:59,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 22:46:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 686. [2025-01-09 22:46:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1204 transitions. [2025-01-09 22:46:59,709 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1204 transitions. Word has length 25 [2025-01-09 22:46:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,710 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1204 transitions. [2025-01-09 22:46:59,710 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-01-09 22:46:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1204 transitions. [2025-01-09 22:46:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:46:59,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,711 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-01-09 22:46:59,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:46:59,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,712 INFO L85 PathProgramCache]: Analyzing trace with hash 71972008, now seen corresponding path program 1 times [2025-01-09 22:46:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134693740] [2025-01-09 22:46:59,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:46:59,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:46:59,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134693740] [2025-01-09 22:46:59,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134693740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001321975] [2025-01-09 22:46:59,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,747 INFO L87 Difference]: Start difference. First operand 686 states and 1204 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-01-09 22:46:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,761 INFO L93 Difference]: Finished difference Result 697 states and 1206 transitions. [2025-01-09 22:46:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,762 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-01-09 22:46:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,764 INFO L225 Difference]: With dead ends: 697 [2025-01-09 22:46:59,764 INFO L226 Difference]: Without dead ends: 697 [2025-01-09 22:46:59,764 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-01-09 22:46:59,764 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 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-01-09 22:46:59,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-01-09 22:46:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2025-01-09 22:46:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1204 transitions. [2025-01-09 22:46:59,780 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1204 transitions. Word has length 26 [2025-01-09 22:46:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,780 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1204 transitions. [2025-01-09 22:46:59,781 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-01-09 22:46:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1204 transitions. [2025-01-09 22:46:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:46:59,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,781 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-01-09 22:46:59,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:46:59,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1616971734, now seen corresponding path program 1 times [2025-01-09 22:46:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030484167] [2025-01-09 22:46:59,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:46:59,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:46:59,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030484167] [2025-01-09 22:46:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030484167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928148248] [2025-01-09 22:46:59,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,813 INFO L87 Difference]: Start difference. First operand 694 states and 1204 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-01-09 22:46:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,830 INFO L93 Difference]: Finished difference Result 1289 states and 2254 transitions. [2025-01-09 22:46:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,831 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-01-09 22:46:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,835 INFO L225 Difference]: With dead ends: 1289 [2025-01-09 22:46:59,836 INFO L226 Difference]: Without dead ends: 1289 [2025-01-09 22:46:59,836 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-01-09 22:46:59,836 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 57 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 170 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-01-09 22:46:59,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-01-09 22:46:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 966. [2025-01-09 22:46:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1644 transitions. [2025-01-09 22:46:59,855 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1644 transitions. Word has length 26 [2025-01-09 22:46:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,855 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1644 transitions. [2025-01-09 22:46:59,855 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-01-09 22:46:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1644 transitions. [2025-01-09 22:46:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:46:59,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,860 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-01-09 22:46:59,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:46:59,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash 683850856, now seen corresponding path program 1 times [2025-01-09 22:46:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619956538] [2025-01-09 22:46:59,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:46:59,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:46:59,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619956538] [2025-01-09 22:46:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619956538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837443532] [2025-01-09 22:46:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,890 INFO L87 Difference]: Start difference. First operand 966 states and 1644 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-01-09 22:46:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,908 INFO L93 Difference]: Finished difference Result 1353 states and 2294 transitions. [2025-01-09 22:46:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,908 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-01-09 22:46:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,912 INFO L225 Difference]: With dead ends: 1353 [2025-01-09 22:46:59,912 INFO L226 Difference]: Without dead ends: 1353 [2025-01-09 22:46:59,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,913 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 205 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-01-09 22:46:59,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-01-09 22:46:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1350. [2025-01-09 22:46:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2292 transitions. [2025-01-09 22:46:59,937 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2292 transitions. Word has length 26 [2025-01-09 22:46:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,937 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2292 transitions. [2025-01-09 22:46:59,937 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-01-09 22:46:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2292 transitions. [2025-01-09 22:46:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:46:59,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,939 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-01-09 22:46:59,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:46:59,939 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1420091859, now seen corresponding path program 1 times [2025-01-09 22:46:59,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716126648] [2025-01-09 22:46:59,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:46:59,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:46:59,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716126648] [2025-01-09 22:46:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716126648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138074664] [2025-01-09 22:46:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,985 INFO L87 Difference]: Start difference. First operand 1350 states and 2292 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-01-09 22:47:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,002 INFO L93 Difference]: Finished difference Result 1369 states and 2294 transitions. [2025-01-09 22:47:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:00,002 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-01-09 22:47:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,008 INFO L225 Difference]: With dead ends: 1369 [2025-01-09 22:47:00,008 INFO L226 Difference]: Without dead ends: 1369 [2025-01-09 22:47:00,008 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-01-09 22:47:00,010 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 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-01-09 22:47:00,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-01-09 22:47:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1366. [2025-01-09 22:47:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2292 transitions. [2025-01-09 22:47:00,033 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2292 transitions. Word has length 27 [2025-01-09 22:47:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,033 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2292 transitions. [2025-01-09 22:47:00,033 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-01-09 22:47:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2292 transitions. [2025-01-09 22:47:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:47:00,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,034 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-01-09 22:47:00,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:47:00,034 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:00,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -268851883, now seen corresponding path program 1 times [2025-01-09 22:47:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119098089] [2025-01-09 22:47:00,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:00,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:47:00,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:47:00,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:00,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119098089] [2025-01-09 22:47:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119098089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008752126] [2025-01-09 22:47:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:00,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:00,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:00,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:00,067 INFO L87 Difference]: Start difference. First operand 1366 states and 2292 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-01-09 22:47:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,085 INFO L93 Difference]: Finished difference Result 2505 states and 4246 transitions. [2025-01-09 22:47:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:00,086 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-01-09 22:47:00,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,092 INFO L225 Difference]: With dead ends: 2505 [2025-01-09 22:47:00,093 INFO L226 Difference]: Without dead ends: 2505 [2025-01-09 22:47:00,093 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-01-09 22:47:00,094 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 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-01-09 22:47:00,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-01-09 22:47:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1926. [2025-01-09 22:47:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 3156 transitions. [2025-01-09 22:47:00,123 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 3156 transitions. Word has length 27 [2025-01-09 22:47:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,123 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 3156 transitions. [2025-01-09 22:47:00,123 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-01-09 22:47:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 3156 transitions. [2025-01-09 22:47:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:47:00,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,125 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-01-09 22:47:00,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:47:00,126 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2031970707, now seen corresponding path program 1 times [2025-01-09 22:47:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680288979] [2025-01-09 22:47:00,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:00,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:47:00,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:47:00,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:00,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:00,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:00,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680288979] [2025-01-09 22:47:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680288979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:00,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:00,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597606742] [2025-01-09 22:47:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:00,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:00,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:00,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:00,157 INFO L87 Difference]: Start difference. First operand 1926 states and 3156 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-01-09 22:47:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,175 INFO L93 Difference]: Finished difference Result 2665 states and 4358 transitions. [2025-01-09 22:47:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:00,175 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-01-09 22:47:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,182 INFO L225 Difference]: With dead ends: 2665 [2025-01-09 22:47:00,183 INFO L226 Difference]: Without dead ends: 2665 [2025-01-09 22:47:00,183 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-01-09 22:47:00,184 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 206 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-01-09 22:47:00,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2025-01-09 22:47:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2662. [2025-01-09 22:47:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 4356 transitions. [2025-01-09 22:47:00,221 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 4356 transitions. Word has length 27 [2025-01-09 22:47:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,221 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 4356 transitions. [2025-01-09 22:47:00,221 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-01-09 22:47:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 4356 transitions. [2025-01-09 22:47:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:47:00,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,223 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-01-09 22:47:00,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:47:00,223 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:00,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash 262144851, now seen corresponding path program 1 times [2025-01-09 22:47:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766940230] [2025-01-09 22:47:00,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:00,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:47:00,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:47:00,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:00,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:00,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:00,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766940230] [2025-01-09 22:47:00,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766940230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:00,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:00,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:00,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266374222] [2025-01-09 22:47:00,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:00,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:00,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:00,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:00,260 INFO L87 Difference]: Start difference. First operand 2662 states and 4356 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-01-09 22:47:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,276 INFO L93 Difference]: Finished difference Result 2697 states and 4358 transitions. [2025-01-09 22:47:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:00,277 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-01-09 22:47:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,284 INFO L225 Difference]: With dead ends: 2697 [2025-01-09 22:47:00,284 INFO L226 Difference]: Without dead ends: 2697 [2025-01-09 22:47:00,284 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-01-09 22:47:00,285 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 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-01-09 22:47:00,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-01-09 22:47:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2694. [2025-01-09 22:47:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 4356 transitions. [2025-01-09 22:47:00,323 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 4356 transitions. Word has length 28 [2025-01-09 22:47:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,324 INFO L471 AbstractCegarLoop]: Abstraction has 2694 states and 4356 transitions. [2025-01-09 22:47:00,324 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-01-09 22:47:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 4356 transitions. [2025-01-09 22:47:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:47:00,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,326 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-01-09 22:47:00,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:47:00,326 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:00,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1426798891, now seen corresponding path program 1 times [2025-01-09 22:47:00,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612282284] [2025-01-09 22:47:00,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:00,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:47:00,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:47:00,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:00,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612282284] [2025-01-09 22:47:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612282284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323167405] [2025-01-09 22:47:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:00,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:00,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:00,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:00,345 INFO L87 Difference]: Start difference. First operand 2694 states and 4356 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-01-09 22:47:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,364 INFO L93 Difference]: Finished difference Result 4873 states and 7974 transitions. [2025-01-09 22:47:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:00,365 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-01-09 22:47:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,378 INFO L225 Difference]: With dead ends: 4873 [2025-01-09 22:47:00,378 INFO L226 Difference]: Without dead ends: 4873 [2025-01-09 22:47:00,378 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-01-09 22:47:00,379 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 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-01-09 22:47:00,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2025-01-09 22:47:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 3846. [2025-01-09 22:47:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 6052 transitions. [2025-01-09 22:47:00,465 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 6052 transitions. Word has length 28 [2025-01-09 22:47:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,465 INFO L471 AbstractCegarLoop]: Abstraction has 3846 states and 6052 transitions. [2025-01-09 22:47:00,465 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-01-09 22:47:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 6052 transitions. [2025-01-09 22:47:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:47:00,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,468 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-01-09 22:47:00,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:47:00,468 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:00,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash 874023699, now seen corresponding path program 1 times [2025-01-09 22:47:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075723899] [2025-01-09 22:47:00,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:00,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:47:00,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:47:00,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:00,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075723899] [2025-01-09 22:47:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075723899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724965465] [2025-01-09 22:47:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:00,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:00,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:00,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:00,487 INFO L87 Difference]: Start difference. First operand 3846 states and 6052 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-01-09 22:47:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,504 INFO L93 Difference]: Finished difference Result 5257 states and 8262 transitions. [2025-01-09 22:47:00,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:00,505 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-01-09 22:47:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,517 INFO L225 Difference]: With dead ends: 5257 [2025-01-09 22:47:00,518 INFO L226 Difference]: Without dead ends: 5257 [2025-01-09 22:47:00,518 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-01-09 22:47:00,518 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 207 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-01-09 22:47:00,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 207 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2025-01-09 22:47:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5254. [2025-01-09 22:47:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 8260 transitions. [2025-01-09 22:47:00,611 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 8260 transitions. Word has length 28 [2025-01-09 22:47:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,611 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 8260 transitions. [2025-01-09 22:47:00,611 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-01-09 22:47:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 8260 transitions. [2025-01-09 22:47:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:47:00,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,615 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-01-09 22:47:00,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:47:00,615 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:00,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1274463458, now seen corresponding path program 1 times [2025-01-09 22:47:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992675410] [2025-01-09 22:47:00,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:00,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:47:00,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:47:00,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:00,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992675410] [2025-01-09 22:47:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992675410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127763404] [2025-01-09 22:47:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:00,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:00,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:00,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:00,637 INFO L87 Difference]: Start difference. First operand 5254 states and 8260 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-01-09 22:47:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,655 INFO L93 Difference]: Finished difference Result 5321 states and 8262 transitions. [2025-01-09 22:47:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:00,656 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-01-09 22:47:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,668 INFO L225 Difference]: With dead ends: 5321 [2025-01-09 22:47:00,669 INFO L226 Difference]: Without dead ends: 5321 [2025-01-09 22:47:00,669 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-01-09 22:47:00,670 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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-01-09 22:47:00,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2025-01-09 22:47:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 5318. [2025-01-09 22:47:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 8260 transitions. [2025-01-09 22:47:00,763 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 8260 transitions. Word has length 29 [2025-01-09 22:47:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,764 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 8260 transitions. [2025-01-09 22:47:00,764 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-01-09 22:47:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 8260 transitions. [2025-01-09 22:47:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:47:00,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,768 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-01-09 22:47:00,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:47:00,768 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:00,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1331560096, now seen corresponding path program 1 times [2025-01-09 22:47:00,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515888595] [2025-01-09 22:47:00,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:00,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:47:00,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:47:00,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:00,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:00,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:00,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515888595] [2025-01-09 22:47:00,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515888595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:00,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:00,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445404928] [2025-01-09 22:47:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:00,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:00,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:00,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:00,802 INFO L87 Difference]: Start difference. First operand 5318 states and 8260 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-01-09 22:47:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,832 INFO L93 Difference]: Finished difference Result 9481 states and 14918 transitions. [2025-01-09 22:47:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:00,832 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-01-09 22:47:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,848 INFO L225 Difference]: With dead ends: 9481 [2025-01-09 22:47:00,848 INFO L226 Difference]: Without dead ends: 9481 [2025-01-09 22:47:00,848 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-01-09 22:47:00,849 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 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-01-09 22:47:00,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9481 states. [2025-01-09 22:47:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9481 to 7686. [2025-01-09 22:47:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7686 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 11588 transitions. [2025-01-09 22:47:00,988 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 11588 transitions. Word has length 29 [2025-01-09 22:47:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,988 INFO L471 AbstractCegarLoop]: Abstraction has 7686 states and 11588 transitions. [2025-01-09 22:47:00,988 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-01-09 22:47:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 11588 transitions. [2025-01-09 22:47:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:47:00,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,994 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-01-09 22:47:00,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:47:00,995 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:00,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,995 INFO L85 PathProgramCache]: Analyzing trace with hash -662584610, now seen corresponding path program 1 times [2025-01-09 22:47:00,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514682339] [2025-01-09 22:47:00,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:01,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:47:01,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:47:01,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:01,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:01,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:01,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514682339] [2025-01-09 22:47:01,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514682339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:01,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:01,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238552379] [2025-01-09 22:47:01,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:01,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:01,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:01,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:01,019 INFO L87 Difference]: Start difference. First operand 7686 states and 11588 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-01-09 22:47:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:01,047 INFO L93 Difference]: Finished difference Result 10377 states and 15622 transitions. [2025-01-09 22:47:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:01,047 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-01-09 22:47:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:01,063 INFO L225 Difference]: With dead ends: 10377 [2025-01-09 22:47:01,063 INFO L226 Difference]: Without dead ends: 10377 [2025-01-09 22:47:01,063 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-01-09 22:47:01,063 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 208 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-01-09 22:47:01,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2025-01-09 22:47:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 10374. [2025-01-09 22:47:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10374 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10374 states to 10374 states and 15620 transitions. [2025-01-09 22:47:01,242 INFO L78 Accepts]: Start accepts. Automaton has 10374 states and 15620 transitions. Word has length 29 [2025-01-09 22:47:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:01,242 INFO L471 AbstractCegarLoop]: Abstraction has 10374 states and 15620 transitions. [2025-01-09 22:47:01,242 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-01-09 22:47:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 10374 states and 15620 transitions. [2025-01-09 22:47:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:47:01,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:01,249 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-01-09 22:47:01,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:47:01,249 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:01,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1664670210, now seen corresponding path program 1 times [2025-01-09 22:47:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584264003] [2025-01-09 22:47:01,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:01,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:47:01,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:47:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:01,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:01,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:01,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584264003] [2025-01-09 22:47:01,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584264003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:01,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:01,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543326944] [2025-01-09 22:47:01,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:01,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:01,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:01,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:01,279 INFO L87 Difference]: Start difference. First operand 10374 states and 15620 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-01-09 22:47:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:01,302 INFO L93 Difference]: Finished difference Result 10505 states and 15622 transitions. [2025-01-09 22:47:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:01,303 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-01-09 22:47:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:01,318 INFO L225 Difference]: With dead ends: 10505 [2025-01-09 22:47:01,318 INFO L226 Difference]: Without dead ends: 10505 [2025-01-09 22:47:01,318 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-01-09 22:47:01,319 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 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-01-09 22:47:01,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10505 states. [2025-01-09 22:47:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10505 to 10502. [2025-01-09 22:47:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10502 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10502 states to 10502 states and 15620 transitions. [2025-01-09 22:47:01,460 INFO L78 Accepts]: Start accepts. Automaton has 10502 states and 15620 transitions. Word has length 30 [2025-01-09 22:47:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:01,460 INFO L471 AbstractCegarLoop]: Abstraction has 10502 states and 15620 transitions. [2025-01-09 22:47:01,460 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-01-09 22:47:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 10502 states and 15620 transitions. [2025-01-09 22:47:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:47:01,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:01,466 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-01-09 22:47:01,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:47:01,466 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:01,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:01,466 INFO L85 PathProgramCache]: Analyzing trace with hash 941353344, now seen corresponding path program 1 times [2025-01-09 22:47:01,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:01,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327778507] [2025-01-09 22:47:01,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:01,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:47:01,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:47:01,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:01,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327778507] [2025-01-09 22:47:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327778507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:01,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:01,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036815764] [2025-01-09 22:47:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:01,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:01,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:01,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:01,489 INFO L87 Difference]: Start difference. First operand 10502 states and 15620 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-01-09 22:47:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:01,522 INFO L93 Difference]: Finished difference Result 20489 states and 29702 transitions. [2025-01-09 22:47:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:01,523 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-01-09 22:47:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:01,553 INFO L225 Difference]: With dead ends: 20489 [2025-01-09 22:47:01,553 INFO L226 Difference]: Without dead ends: 20489 [2025-01-09 22:47:01,553 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-01-09 22:47:01,553 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 178 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-01-09 22:47:01,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20489 states. [2025-01-09 22:47:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20489 to 20486. [2025-01-09 22:47:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20486 states, 20485 states have (on average 1.4498413473273126) internal successors, (29700), 20485 states have internal predecessors, (29700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20486 states to 20486 states and 29700 transitions. [2025-01-09 22:47:01,838 INFO L78 Accepts]: Start accepts. Automaton has 20486 states and 29700 transitions. Word has length 30 [2025-01-09 22:47:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:01,838 INFO L471 AbstractCegarLoop]: Abstraction has 20486 states and 29700 transitions. [2025-01-09 22:47:01,838 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-01-09 22:47:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20486 states and 29700 transitions. [2025-01-09 22:47:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:47:01,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:01,852 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-01-09 22:47:01,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:47:01,853 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1359469246, now seen corresponding path program 1 times [2025-01-09 22:47:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:01,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182846854] [2025-01-09 22:47:01,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:01,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:47:01,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:47:01,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:01,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:01,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182846854] [2025-01-09 22:47:01,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182846854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:01,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:01,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82393247] [2025-01-09 22:47:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:01,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:01,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:01,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:01,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:01,873 INFO L87 Difference]: Start difference. First operand 20486 states and 29700 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-01-09 22:47:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:01,973 INFO L93 Difference]: Finished difference Result 23561 states and 35078 transitions. [2025-01-09 22:47:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:01,974 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-01-09 22:47:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:02,006 INFO L225 Difference]: With dead ends: 23561 [2025-01-09 22:47:02,006 INFO L226 Difference]: Without dead ends: 23561 [2025-01-09 22:47:02,006 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-01-09 22:47:02,006 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 45 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:02,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 215 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23561 states. [2025-01-09 22:47:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23561 to 20486. [2025-01-09 22:47:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20486 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20486 states to 20486 states and 29444 transitions. [2025-01-09 22:47:02,184 INFO L78 Accepts]: Start accepts. Automaton has 20486 states and 29444 transitions. Word has length 30 [2025-01-09 22:47:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:02,184 INFO L471 AbstractCegarLoop]: Abstraction has 20486 states and 29444 transitions. [2025-01-09 22:47:02,184 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-01-09 22:47:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 20486 states and 29444 transitions. [2025-01-09 22:47:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:47:02,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:02,195 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-01-09 22:47:02,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:47:02,195 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash -876167063, now seen corresponding path program 1 times [2025-01-09 22:47:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842931045] [2025-01-09 22:47:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:02,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:47:02,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:47:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842931045] [2025-01-09 22:47:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842931045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416539574] [2025-01-09 22:47:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:02,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:02,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:02,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:02,217 INFO L87 Difference]: Start difference. First operand 20486 states and 29444 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-01-09 22:47:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:02,360 INFO L93 Difference]: Finished difference Result 35593 states and 51718 transitions. [2025-01-09 22:47:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:02,361 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-01-09 22:47:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:02,412 INFO L225 Difference]: With dead ends: 35593 [2025-01-09 22:47:02,413 INFO L226 Difference]: Without dead ends: 35593 [2025-01-09 22:47:02,413 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-01-09 22:47:02,414 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 42 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 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-01-09 22:47:02,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35593 states. [2025-01-09 22:47:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35593 to 30470. [2025-01-09 22:47:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30470 states, 30469 states have (on average 1.394860349863796) internal successors, (42500), 30469 states have internal predecessors, (42500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30470 states to 30470 states and 42500 transitions. [2025-01-09 22:47:02,719 INFO L78 Accepts]: Start accepts. Automaton has 30470 states and 42500 transitions. Word has length 31 [2025-01-09 22:47:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:02,719 INFO L471 AbstractCegarLoop]: Abstraction has 30470 states and 42500 transitions. [2025-01-09 22:47:02,719 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-01-09 22:47:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 30470 states and 42500 transitions. [2025-01-09 22:47:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:47:02,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:02,736 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-01-09 22:47:02,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:47:02,736 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:02,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:02,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1424655527, now seen corresponding path program 1 times [2025-01-09 22:47:02,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:02,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725675101] [2025-01-09 22:47:02,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:02,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:02,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:47:02,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:47:02,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:02,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:02,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:02,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725675101] [2025-01-09 22:47:02,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725675101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:02,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:02,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945274706] [2025-01-09 22:47:02,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:02,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:02,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:02,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:02,765 INFO L87 Difference]: Start difference. First operand 30470 states and 42500 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-01-09 22:47:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:02,917 INFO L93 Difference]: Finished difference Result 40201 states and 55814 transitions. [2025-01-09 22:47:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:02,917 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-01-09 22:47:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:02,957 INFO L225 Difference]: With dead ends: 40201 [2025-01-09 22:47:02,957 INFO L226 Difference]: Without dead ends: 40201 [2025-01-09 22:47:02,957 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-01-09 22:47:02,958 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 210 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-01-09 22:47:02,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40201 states. [2025-01-09 22:47:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40201 to 40198. [2025-01-09 22:47:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40198 states, 40197 states have (on average 1.3884618255093664) internal successors, (55812), 40197 states have internal predecessors, (55812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40198 states to 40198 states and 55812 transitions. [2025-01-09 22:47:03,466 INFO L78 Accepts]: Start accepts. Automaton has 40198 states and 55812 transitions. Word has length 31 [2025-01-09 22:47:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:03,466 INFO L471 AbstractCegarLoop]: Abstraction has 40198 states and 55812 transitions. [2025-01-09 22:47:03,467 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-01-09 22:47:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 40198 states and 55812 transitions. [2025-01-09 22:47:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:47:03,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:03,481 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-01-09 22:47:03,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:47:03,481 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1384714261, now seen corresponding path program 1 times [2025-01-09 22:47:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659138368] [2025-01-09 22:47:03,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:03,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:47:03,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:47:03,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:03,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:03,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:03,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659138368] [2025-01-09 22:47:03,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659138368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:03,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:03,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:03,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427683598] [2025-01-09 22:47:03,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:03,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:03,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:03,499 INFO L87 Difference]: Start difference. First operand 40198 states and 55812 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-01-09 22:47:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:03,565 INFO L93 Difference]: Finished difference Result 40969 states and 56326 transitions. [2025-01-09 22:47:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:03,566 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-01-09 22:47:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:03,609 INFO L225 Difference]: With dead ends: 40969 [2025-01-09 22:47:03,610 INFO L226 Difference]: Without dead ends: 40969 [2025-01-09 22:47:03,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-01-09 22:47:03,610 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 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-01-09 22:47:03,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40969 states. [2025-01-09 22:47:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40969 to 40966. [2025-01-09 22:47:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40966 states, 40965 states have (on average 1.3749298181374343) internal successors, (56324), 40965 states have internal predecessors, (56324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40966 states to 40966 states and 56324 transitions. [2025-01-09 22:47:04,093 INFO L78 Accepts]: Start accepts. Automaton has 40966 states and 56324 transitions. Word has length 32 [2025-01-09 22:47:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:04,093 INFO L471 AbstractCegarLoop]: Abstraction has 40966 states and 56324 transitions. [2025-01-09 22:47:04,093 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-01-09 22:47:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40966 states and 56324 transitions. [2025-01-09 22:47:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:47:04,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:04,223 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-01-09 22:47:04,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 22:47:04,223 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:04,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:04,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1221309293, now seen corresponding path program 1 times [2025-01-09 22:47:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971642203] [2025-01-09 22:47:04,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:04,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:47:04,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:47:04,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:04,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:04,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:04,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971642203] [2025-01-09 22:47:04,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971642203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:04,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:04,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:04,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905426781] [2025-01-09 22:47:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:04,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:04,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:04,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:04,240 INFO L87 Difference]: Start difference. First operand 40966 states and 56324 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-01-09 22:47:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:04,342 INFO L93 Difference]: Finished difference Result 69641 states and 96262 transitions. [2025-01-09 22:47:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:04,342 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-01-09 22:47:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:04,412 INFO L225 Difference]: With dead ends: 69641 [2025-01-09 22:47:04,412 INFO L226 Difference]: Without dead ends: 69641 [2025-01-09 22:47:04,412 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-01-09 22:47:04,413 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 39 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 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-01-09 22:47:04,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69641 states. [2025-01-09 22:47:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69641 to 61446. [2025-01-09 22:47:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61446 states, 61445 states have (on average 1.3332899340873952) internal successors, (81924), 61445 states have internal predecessors, (81924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61446 states to 61446 states and 81924 transitions. [2025-01-09 22:47:05,269 INFO L78 Accepts]: Start accepts. Automaton has 61446 states and 81924 transitions. Word has length 32 [2025-01-09 22:47:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:05,269 INFO L471 AbstractCegarLoop]: Abstraction has 61446 states and 81924 transitions. [2025-01-09 22:47:05,269 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-01-09 22:47:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 61446 states and 81924 transitions. [2025-01-09 22:47:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:47:05,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:05,298 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-01-09 22:47:05,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:47:05,298 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -772835413, now seen corresponding path program 1 times [2025-01-09 22:47:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61439221] [2025-01-09 22:47:05,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:05,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:47:05,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:47:05,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:05,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61439221] [2025-01-09 22:47:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61439221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399005485] [2025-01-09 22:47:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:05,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:05,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:05,316 INFO L87 Difference]: Start difference. First operand 61446 states and 81924 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-01-09 22:47:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:05,450 INFO L93 Difference]: Finished difference Result 79881 states and 105478 transitions. [2025-01-09 22:47:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:05,451 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-01-09 22:47:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:05,524 INFO L225 Difference]: With dead ends: 79881 [2025-01-09 22:47:05,524 INFO L226 Difference]: Without dead ends: 79881 [2025-01-09 22:47:05,525 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-01-09 22:47:05,525 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 211 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-01-09 22:47:05,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 211 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79881 states. [2025-01-09 22:47:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79881 to 79878. [2025-01-09 22:47:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79878 states, 79877 states have (on average 1.3204802383664884) internal successors, (105476), 79877 states have internal predecessors, (105476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79878 states to 79878 states and 105476 transitions. [2025-01-09 22:47:06,404 INFO L78 Accepts]: Start accepts. Automaton has 79878 states and 105476 transitions. Word has length 32 [2025-01-09 22:47:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:06,404 INFO L471 AbstractCegarLoop]: Abstraction has 79878 states and 105476 transitions. [2025-01-09 22:47:06,404 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-01-09 22:47:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 79878 states and 105476 transitions. [2025-01-09 22:47:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:47:06,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:06,430 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-01-09 22:47:06,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:47:06,430 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:06,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:06,430 INFO L85 PathProgramCache]: Analyzing trace with hash -787446094, now seen corresponding path program 1 times [2025-01-09 22:47:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752421591] [2025-01-09 22:47:06,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:06,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:06,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:47:06,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:47:06,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:06,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:06,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:06,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752421591] [2025-01-09 22:47:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752421591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:06,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:06,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729268514] [2025-01-09 22:47:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:06,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:06,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:06,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:06,448 INFO L87 Difference]: Start difference. First operand 79878 states and 105476 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-01-09 22:47:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:06,789 INFO L93 Difference]: Finished difference Result 80905 states and 105478 transitions. [2025-01-09 22:47:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:06,789 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-01-09 22:47:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:06,858 INFO L225 Difference]: With dead ends: 80905 [2025-01-09 22:47:06,858 INFO L226 Difference]: Without dead ends: 80905 [2025-01-09 22:47:06,858 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-01-09 22:47:06,859 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 61 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 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-01-09 22:47:06,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80905 states. [2025-01-09 22:47:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80905 to 80902. [2025-01-09 22:47:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80902 states, 80901 states have (on average 1.3037663316893486) internal successors, (105476), 80901 states have internal predecessors, (105476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80902 states to 80902 states and 105476 transitions. [2025-01-09 22:47:07,748 INFO L78 Accepts]: Start accepts. Automaton has 80902 states and 105476 transitions. Word has length 33 [2025-01-09 22:47:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:07,749 INFO L471 AbstractCegarLoop]: Abstraction has 80902 states and 105476 transitions. [2025-01-09 22:47:07,749 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-01-09 22:47:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 80902 states and 105476 transitions. [2025-01-09 22:47:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:47:07,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:07,776 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-01-09 22:47:07,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 22:47:07,776 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:07,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1818577460, now seen corresponding path program 1 times [2025-01-09 22:47:07,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280888087] [2025-01-09 22:47:07,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:07,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:47:07,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:47:07,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:07,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:07,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:07,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280888087] [2025-01-09 22:47:07,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280888087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:07,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:07,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:07,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020917028] [2025-01-09 22:47:07,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:07,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:07,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:07,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:07,797 INFO L87 Difference]: Start difference. First operand 80902 states and 105476 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-01-09 22:47:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:08,183 INFO L93 Difference]: Finished difference Result 135177 states and 176134 transitions. [2025-01-09 22:47:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:08,184 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-01-09 22:47:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:08,308 INFO L225 Difference]: With dead ends: 135177 [2025-01-09 22:47:08,308 INFO L226 Difference]: Without dead ends: 135177 [2025-01-09 22:47:08,309 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-01-09 22:47:08,309 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 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-01-09 22:47:08,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135177 states. [2025-01-09 22:47:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135177 to 122886. [2025-01-09 22:47:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122886 states, 122885 states have (on average 1.2666476787240102) internal successors, (155652), 122885 states have internal predecessors, (155652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122886 states to 122886 states and 155652 transitions. [2025-01-09 22:47:09,684 INFO L78 Accepts]: Start accepts. Automaton has 122886 states and 155652 transitions. Word has length 33 [2025-01-09 22:47:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:09,684 INFO L471 AbstractCegarLoop]: Abstraction has 122886 states and 155652 transitions. [2025-01-09 22:47:09,684 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-01-09 22:47:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 122886 states and 155652 transitions. [2025-01-09 22:47:09,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:47:09,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:09,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, 1, 1, 1, 1] [2025-01-09 22:47:09,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:47:09,771 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:09,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:09,771 INFO L85 PathProgramCache]: Analyzing trace with hash -175567246, now seen corresponding path program 1 times [2025-01-09 22:47:09,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:09,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734794844] [2025-01-09 22:47:09,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:09,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:09,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:47:09,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:47:09,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:09,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:09,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:09,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734794844] [2025-01-09 22:47:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734794844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:09,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073105520] [2025-01-09 22:47:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:09,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:09,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:09,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:09,790 INFO L87 Difference]: Start difference. First operand 122886 states and 155652 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-01-09 22:47:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:10,433 INFO L93 Difference]: Finished difference Result 157705 states and 196614 transitions. [2025-01-09 22:47:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:10,433 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-01-09 22:47:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:10,599 INFO L225 Difference]: With dead ends: 157705 [2025-01-09 22:47:10,600 INFO L226 Difference]: Without dead ends: 157705 [2025-01-09 22:47:10,600 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-01-09 22:47:10,600 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 58 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 212 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-01-09 22:47:10,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157705 states. [2025-01-09 22:47:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157705 to 157702. [2025-01-09 22:47:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157702 states, 157701 states have (on average 1.246739082187177) internal successors, (196612), 157701 states have internal predecessors, (196612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157702 states to 157702 states and 196612 transitions. [2025-01-09 22:47:12,093 INFO L78 Accepts]: Start accepts. Automaton has 157702 states and 196612 transitions. Word has length 33 [2025-01-09 22:47:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:12,095 INFO L471 AbstractCegarLoop]: Abstraction has 157702 states and 196612 transitions. [2025-01-09 22:47:12,095 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-01-09 22:47:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 157702 states and 196612 transitions. [2025-01-09 22:47:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:47:12,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:12,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:12,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 22:47:12,151 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:12,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash 548008470, now seen corresponding path program 1 times [2025-01-09 22:47:12,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:12,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464198551] [2025-01-09 22:47:12,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:12,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:12,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:47:12,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:47:12,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:12,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464198551] [2025-01-09 22:47:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464198551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:12,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:12,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480134714] [2025-01-09 22:47:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:12,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:12,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:12,166 INFO L87 Difference]: Start difference. First operand 157702 states and 196612 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:12,825 INFO L93 Difference]: Finished difference Result 159753 states and 196614 transitions. [2025-01-09 22:47:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:12,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-01-09 22:47:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:12,999 INFO L225 Difference]: With dead ends: 159753 [2025-01-09 22:47:12,999 INFO L226 Difference]: Without dead ends: 159753 [2025-01-09 22:47:12,999 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-01-09 22:47:12,999 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 60 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 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-01-09 22:47:12,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159753 states. [2025-01-09 22:47:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159753 to 159750. [2025-01-09 22:47:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159750 states, 159749 states have (on average 1.2307557480798001) internal successors, (196612), 159749 states have internal predecessors, (196612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159750 states to 159750 states and 196612 transitions. [2025-01-09 22:47:14,862 INFO L78 Accepts]: Start accepts. Automaton has 159750 states and 196612 transitions. Word has length 34 [2025-01-09 22:47:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:14,862 INFO L471 AbstractCegarLoop]: Abstraction has 159750 states and 196612 transitions. [2025-01-09 22:47:14,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 159750 states and 196612 transitions. [2025-01-09 22:47:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:47:14,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:14,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:14,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 22:47:14,924 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:14,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1140935272, now seen corresponding path program 1 times [2025-01-09 22:47:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:14,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586467113] [2025-01-09 22:47:14,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:14,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:47:14,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:47:14,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:14,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586467113] [2025-01-09 22:47:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586467113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:14,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:14,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403276362] [2025-01-09 22:47:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:14,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:14,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:14,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:14,941 INFO L87 Difference]: Start difference. First operand 159750 states and 196612 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:15,723 INFO L93 Difference]: Finished difference Result 262153 states and 319494 transitions. [2025-01-09 22:47:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-01-09 22:47:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:16,008 INFO L225 Difference]: With dead ends: 262153 [2025-01-09 22:47:16,008 INFO L226 Difference]: Without dead ends: 262153 [2025-01-09 22:47:16,008 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-01-09 22:47:16,008 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 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-01-09 22:47:16,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262153 states. [2025-01-09 22:47:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262153 to 245766. [2025-01-09 22:47:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245766 states, 245765 states have (on average 1.1999918621447319) internal successors, (294916), 245765 states have internal predecessors, (294916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245766 states to 245766 states and 294916 transitions. [2025-01-09 22:47:18,900 INFO L78 Accepts]: Start accepts. Automaton has 245766 states and 294916 transitions. Word has length 34 [2025-01-09 22:47:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:18,900 INFO L471 AbstractCegarLoop]: Abstraction has 245766 states and 294916 transitions. [2025-01-09 22:47:18,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 245766 states and 294916 transitions. [2025-01-09 22:47:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:47:19,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:19,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:19,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 22:47:19,028 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:19,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1159887318, now seen corresponding path program 1 times [2025-01-09 22:47:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143387368] [2025-01-09 22:47:19,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:19,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:47:19,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:47:19,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:19,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143387368] [2025-01-09 22:47:19,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143387368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:19,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:19,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437980198] [2025-01-09 22:47:19,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:19,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:19,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:19,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:19,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:19,043 INFO L87 Difference]: Start difference. First operand 245766 states and 294916 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:19,953 INFO L93 Difference]: Finished difference Result 311305 states and 364550 transitions. [2025-01-09 22:47:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:19,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-01-09 22:47:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:20,328 INFO L225 Difference]: With dead ends: 311305 [2025-01-09 22:47:20,328 INFO L226 Difference]: Without dead ends: 311305 [2025-01-09 22:47:20,328 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-01-09 22:47:20,328 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 213 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-01-09 22:47:20,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311305 states. [2025-01-09 22:47:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311305 to 311302. [2025-01-09 22:47:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311302 states, 311301 states have (on average 1.1710466718706332) internal successors, (364548), 311301 states have internal predecessors, (364548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311302 states to 311302 states and 364548 transitions. [2025-01-09 22:47:24,592 INFO L78 Accepts]: Start accepts. Automaton has 311302 states and 364548 transitions. Word has length 34 [2025-01-09 22:47:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:24,592 INFO L471 AbstractCegarLoop]: Abstraction has 311302 states and 364548 transitions. [2025-01-09 22:47:24,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 311302 states and 364548 transitions. [2025-01-09 22:47:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:47:24,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:24,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:24,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 22:47:24,746 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:24,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1002562435, now seen corresponding path program 1 times [2025-01-09 22:47:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099858840] [2025-01-09 22:47:24,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:24,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:47:24,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:47:24,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:24,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:24,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099858840] [2025-01-09 22:47:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099858840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:24,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21185308] [2025-01-09 22:47:24,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:24,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:24,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:24,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:24,762 INFO L87 Difference]: Start difference. First operand 311302 states and 364548 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:25,330 INFO L93 Difference]: Finished difference Result 315401 states and 364550 transitions. [2025-01-09 22:47:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:25,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 22:47:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:25,669 INFO L225 Difference]: With dead ends: 315401 [2025-01-09 22:47:25,669 INFO L226 Difference]: Without dead ends: 315401 [2025-01-09 22:47:25,669 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-01-09 22:47:25,670 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 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-01-09 22:47:25,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315401 states. [2025-01-09 22:47:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315401 to 315398. [2025-01-09 22:47:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315398 states, 315397 states have (on average 1.1558385146339376) internal successors, (364548), 315397 states have internal predecessors, (364548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315398 states to 315398 states and 364548 transitions. [2025-01-09 22:47:29,747 INFO L78 Accepts]: Start accepts. Automaton has 315398 states and 364548 transitions. Word has length 35 [2025-01-09 22:47:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:29,747 INFO L471 AbstractCegarLoop]: Abstraction has 315398 states and 364548 transitions. [2025-01-09 22:47:29,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 315398 states and 364548 transitions. [2025-01-09 22:47:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:47:29,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:29,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:29,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 22:47:29,880 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:29,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1603461119, now seen corresponding path program 1 times [2025-01-09 22:47:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233324378] [2025-01-09 22:47:29,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:29,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:47:29,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:47:29,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:29,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:29,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233324378] [2025-01-09 22:47:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233324378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:29,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:29,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:29,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134343884] [2025-01-09 22:47:29,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:29,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:29,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:29,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:29,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:29,895 INFO L87 Difference]: Start difference. First operand 315398 states and 364548 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)