./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:51:58,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:51:58,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:51:58,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:51:58,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:51:58,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:51:58,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:51:58,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:51:58,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:51:58,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:51:58,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:51:58,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:51:58,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:51:58,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:51:58,651 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:51:58,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:51:58,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:51:58,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:51:58,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:51:58,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:51:58,655 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:51:58,655 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:51:58,655 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:51:58,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:51:58,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:51:58,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:51:58,656 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:51:58,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:51:58,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:51:58,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:51:58,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:51:58,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:51:58,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:51:58,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:51:58,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:51:58,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:51:58,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:51:58,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:51:58,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:51:58,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:51:58,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:51:58,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:51:58,658 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-11-17 00:51:58,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:51:58,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:51:58,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:51:58,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:51:58,885 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:51:58,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-17 00:52:00,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:52:00,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:52:00,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-17 00:52:00,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd36d0e3d/2aa74ee35e224fd6b46a406a7659f9f5/FLAG470f110bd [2024-11-17 00:52:00,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd36d0e3d/2aa74ee35e224fd6b46a406a7659f9f5 [2024-11-17 00:52:00,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:52:00,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:52:00,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:52:00,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:52:00,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:52:00,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d7c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00, skipping insertion in model container [2024-11-17 00:52:00,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:52:00,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:52:00,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:52:00,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:52:00,637 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:52:00,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00 WrapperNode [2024-11-17 00:52:00,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:52:00,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:52:00,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:52:00,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:52:00,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,701 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2024-11-17 00:52:00,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:52:00,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:52:00,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:52:00,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:52:00,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,731 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]. [2024-11-17 00:52:00,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:52:00,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:52:00,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:52:00,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:52:00,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:52:00,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:52:00,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:52:00,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:52:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:52:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:52:00,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:52:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:52:00,874 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:52:00,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:52:01,087 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-17 00:52:01,087 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:52:01,098 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:52:01,098 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:52:01,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:01 BoogieIcfgContainer [2024-11-17 00:52:01,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:52:01,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:52:01,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:52:01,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:52:01,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:52:00" (1/3) ... [2024-11-17 00:52:01,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54516336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:01, skipping insertion in model container [2024-11-17 00:52:01,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (2/3) ... [2024-11-17 00:52:01,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54516336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:01, skipping insertion in model container [2024-11-17 00:52:01,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:01" (3/3) ... [2024-11-17 00:52:01,107 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2024-11-17 00:52:01,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:52:01,121 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:52:01,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:52:01,163 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;@61500ec4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:52:01,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:52:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 60 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:52:01,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1265592141, now seen corresponding path program 1 times [2024-11-17 00:52:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295013909] [2024-11-17 00:52:01,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295013909] [2024-11-17 00:52:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295013909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523855378] [2024-11-17 00:52:01,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:52:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:52:01,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:52:01,361 INFO L87 Difference]: Start difference. First operand has 61 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 60 states have internal predecessors, (108), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 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) [2024-11-17 00:52:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,373 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2024-11-17 00:52:01,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:52:01,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 [2024-11-17 00:52:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,381 INFO L225 Difference]: With dead ends: 60 [2024-11-17 00:52:01,381 INFO L226 Difference]: Without dead ends: 57 [2024-11-17 00:52:01,382 INFO L431 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 [2024-11-17 00:52:01,384 INFO L432 NwaCegarLoop]: 104 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, 104 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 [2024-11-17 00:52:01,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-17 00:52:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-17 00:52:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 56 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2024-11-17 00:52:01,409 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 101 transitions. Word has length 6 [2024-11-17 00:52:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,409 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 101 transitions. [2024-11-17 00:52:01,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2024-11-17 00:52:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2024-11-17 00:52:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:52:01,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:52:01,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash 866988084, now seen corresponding path program 1 times [2024-11-17 00:52:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441136797] [2024-11-17 00:52:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441136797] [2024-11-17 00:52:01,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441136797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:01,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719714600] [2024-11-17 00:52:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,478 INFO L87 Difference]: Start difference. First operand 57 states and 101 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,493 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2024-11-17 00:52:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-17 00:52:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,494 INFO L225 Difference]: With dead ends: 56 [2024-11-17 00:52:01,495 INFO L226 Difference]: Without dead ends: 53 [2024-11-17 00:52:01,495 INFO L431 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 [2024-11-17 00:52:01,496 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 100 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 [2024-11-17 00:52:01,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 100 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-17 00:52:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-17 00:52:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 97 transitions. [2024-11-17 00:52:01,508 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 97 transitions. Word has length 8 [2024-11-17 00:52:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,509 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 97 transitions. [2024-11-17 00:52:01,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 97 transitions. [2024-11-17 00:52:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:52:01,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,510 INFO L215 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] [2024-11-17 00:52:01,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:52:01,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash 854289607, now seen corresponding path program 1 times [2024-11-17 00:52:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919088212] [2024-11-17 00:52:01,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919088212] [2024-11-17 00:52:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919088212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276468490] [2024-11-17 00:52:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,606 INFO L87 Difference]: Start difference. First operand 53 states and 97 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) [2024-11-17 00:52:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,627 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2024-11-17 00:52:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,628 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 [2024-11-17 00:52:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,629 INFO L225 Difference]: With dead ends: 103 [2024-11-17 00:52:01,629 INFO L226 Difference]: Without dead ends: 103 [2024-11-17 00:52:01,629 INFO L431 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 [2024-11-17 00:52:01,630 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 75 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 193 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 [2024-11-17 00:52:01,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-17 00:52:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2024-11-17 00:52:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 68 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 128 transitions. [2024-11-17 00:52:01,636 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 128 transitions. Word has length 24 [2024-11-17 00:52:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,636 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 128 transitions. [2024-11-17 00:52:01,637 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) [2024-11-17 00:52:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 128 transitions. [2024-11-17 00:52:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:52:01,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,638 INFO L215 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] [2024-11-17 00:52:01,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:52:01,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 9817736, now seen corresponding path program 1 times [2024-11-17 00:52:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817417736] [2024-11-17 00:52:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817417736] [2024-11-17 00:52:01,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817417736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596090074] [2024-11-17 00:52:01,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,763 INFO L87 Difference]: Start difference. First operand 69 states and 128 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) [2024-11-17 00:52:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,792 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2024-11-17 00:52:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,793 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 [2024-11-17 00:52:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,794 INFO L225 Difference]: With dead ends: 103 [2024-11-17 00:52:01,794 INFO L226 Difference]: Without dead ends: 103 [2024-11-17 00:52:01,794 INFO L431 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 [2024-11-17 00:52:01,795 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 75 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 218 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 [2024-11-17 00:52:01,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-17 00:52:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2024-11-17 00:52:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8686868686868687) internal successors, (185), 99 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2024-11-17 00:52:01,806 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 24 [2024-11-17 00:52:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,806 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2024-11-17 00:52:01,806 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) [2024-11-17 00:52:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2024-11-17 00:52:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:52:01,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,807 INFO L215 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] [2024-11-17 00:52:01,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:52:01,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 714070692, now seen corresponding path program 1 times [2024-11-17 00:52:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863121966] [2024-11-17 00:52:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863121966] [2024-11-17 00:52:01,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863121966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442729337] [2024-11-17 00:52:01,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,847 INFO L87 Difference]: Start difference. First operand 100 states and 185 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) [2024-11-17 00:52:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,858 INFO L93 Difference]: Finished difference Result 107 states and 190 transitions. [2024-11-17 00:52:01,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,858 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 [2024-11-17 00:52:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,862 INFO L225 Difference]: With dead ends: 107 [2024-11-17 00:52:01,862 INFO L226 Difference]: Without dead ends: 107 [2024-11-17 00:52:01,863 INFO L431 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 [2024-11-17 00:52:01,863 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 77 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 246 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 [2024-11-17 00:52:01,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 246 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-17 00:52:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-17 00:52:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.825242718446602) internal successors, (188), 103 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2024-11-17 00:52:01,876 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 25 [2024-11-17 00:52:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2024-11-17 00:52:01,876 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) [2024-11-17 00:52:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2024-11-17 00:52:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:52:01,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,877 INFO L215 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] [2024-11-17 00:52:01,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:52:01,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 305246467, now seen corresponding path program 1 times [2024-11-17 00:52:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448214552] [2024-11-17 00:52:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448214552] [2024-11-17 00:52:01,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448214552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698965488] [2024-11-17 00:52:01,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,925 INFO L87 Difference]: Start difference. First operand 104 states and 188 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) [2024-11-17 00:52:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,944 INFO L93 Difference]: Finished difference Result 198 states and 361 transitions. [2024-11-17 00:52:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,945 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 [2024-11-17 00:52:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,946 INFO L225 Difference]: With dead ends: 198 [2024-11-17 00:52:01,946 INFO L226 Difference]: Without dead ends: 198 [2024-11-17 00:52:01,946 INFO L431 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 [2024-11-17 00:52:01,947 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 72 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 191 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 [2024-11-17 00:52:01,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-17 00:52:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 137. [2024-11-17 00:52:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.8308823529411764) internal successors, (249), 136 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 249 transitions. [2024-11-17 00:52:01,960 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 249 transitions. Word has length 25 [2024-11-17 00:52:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,961 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 249 transitions. [2024-11-17 00:52:01,961 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) [2024-11-17 00:52:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 249 transitions. [2024-11-17 00:52:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:52:01,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,962 INFO L215 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] [2024-11-17 00:52:01,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:52:01,962 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash -539225404, now seen corresponding path program 1 times [2024-11-17 00:52:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799264331] [2024-11-17 00:52:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799264331] [2024-11-17 00:52:01,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799264331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430903143] [2024-11-17 00:52:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,990 INFO L87 Difference]: Start difference. First operand 137 states and 249 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) [2024-11-17 00:52:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,999 INFO L93 Difference]: Finished difference Result 200 states and 359 transitions. [2024-11-17 00:52:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,000 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 [2024-11-17 00:52:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,000 INFO L225 Difference]: With dead ends: 200 [2024-11-17 00:52:02,001 INFO L226 Difference]: Without dead ends: 200 [2024-11-17 00:52:02,001 INFO L431 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 [2024-11-17 00:52:02,001 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 74 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 219 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 [2024-11-17 00:52:02,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-17 00:52:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-11-17 00:52:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.8214285714285714) internal successors, (357), 196 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 357 transitions. [2024-11-17 00:52:02,007 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 357 transitions. Word has length 25 [2024-11-17 00:52:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,007 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 357 transitions. [2024-11-17 00:52:02,007 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) [2024-11-17 00:52:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 357 transitions. [2024-11-17 00:52:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:52:02,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,008 INFO L215 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] [2024-11-17 00:52:02,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:52:02,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,009 INFO L85 PathProgramCache]: Analyzing trace with hash 873595809, now seen corresponding path program 1 times [2024-11-17 00:52:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453793435] [2024-11-17 00:52:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453793435] [2024-11-17 00:52:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453793435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129972176] [2024-11-17 00:52:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,041 INFO L87 Difference]: Start difference. First operand 197 states and 357 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) [2024-11-17 00:52:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,052 INFO L93 Difference]: Finished difference Result 202 states and 359 transitions. [2024-11-17 00:52:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,052 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 [2024-11-17 00:52:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,054 INFO L225 Difference]: With dead ends: 202 [2024-11-17 00:52:02,054 INFO L226 Difference]: Without dead ends: 202 [2024-11-17 00:52:02,054 INFO L431 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 [2024-11-17 00:52:02,056 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 76 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 242 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 [2024-11-17 00:52:02,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 242 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-17 00:52:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2024-11-17 00:52:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.803030303030303) internal successors, (357), 198 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 357 transitions. [2024-11-17 00:52:02,067 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 357 transitions. Word has length 26 [2024-11-17 00:52:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,067 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 357 transitions. [2024-11-17 00:52:02,067 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) [2024-11-17 00:52:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 357 transitions. [2024-11-17 00:52:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:52:02,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,068 INFO L215 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] [2024-11-17 00:52:02,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:52:02,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash 464771584, now seen corresponding path program 1 times [2024-11-17 00:52:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244938812] [2024-11-17 00:52:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244938812] [2024-11-17 00:52:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244938812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19814342] [2024-11-17 00:52:02,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,109 INFO L87 Difference]: Start difference. First operand 199 states and 357 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) [2024-11-17 00:52:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,118 INFO L93 Difference]: Finished difference Result 378 states and 683 transitions. [2024-11-17 00:52:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,118 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 [2024-11-17 00:52:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,119 INFO L225 Difference]: With dead ends: 378 [2024-11-17 00:52:02,119 INFO L226 Difference]: Without dead ends: 378 [2024-11-17 00:52:02,120 INFO L431 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 [2024-11-17 00:52:02,120 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 69 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 189 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 [2024-11-17 00:52:02,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 189 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-17 00:52:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 267. [2024-11-17 00:52:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.7932330827067668) internal successors, (477), 266 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 477 transitions. [2024-11-17 00:52:02,126 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 477 transitions. Word has length 26 [2024-11-17 00:52:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,126 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 477 transitions. [2024-11-17 00:52:02,126 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) [2024-11-17 00:52:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 477 transitions. [2024-11-17 00:52:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:52:02,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,127 INFO L215 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] [2024-11-17 00:52:02,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:52:02,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash -379700287, now seen corresponding path program 1 times [2024-11-17 00:52:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585368082] [2024-11-17 00:52:02,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585368082] [2024-11-17 00:52:02,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585368082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975401708] [2024-11-17 00:52:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,159 INFO L87 Difference]: Start difference. First operand 267 states and 477 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) [2024-11-17 00:52:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,175 INFO L93 Difference]: Finished difference Result 386 states and 683 transitions. [2024-11-17 00:52:02,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,176 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 [2024-11-17 00:52:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,177 INFO L225 Difference]: With dead ends: 386 [2024-11-17 00:52:02,177 INFO L226 Difference]: Without dead ends: 386 [2024-11-17 00:52:02,177 INFO L431 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 [2024-11-17 00:52:02,178 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 220 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 [2024-11-17 00:52:02,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-17 00:52:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2024-11-17 00:52:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.7827225130890052) internal successors, (681), 382 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 681 transitions. [2024-11-17 00:52:02,190 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 681 transitions. Word has length 26 [2024-11-17 00:52:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,190 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 681 transitions. [2024-11-17 00:52:02,190 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) [2024-11-17 00:52:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 681 transitions. [2024-11-17 00:52:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:52:02,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,195 INFO L215 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] [2024-11-17 00:52:02,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:52:02,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1523900413, now seen corresponding path program 1 times [2024-11-17 00:52:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813705681] [2024-11-17 00:52:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813705681] [2024-11-17 00:52:02,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813705681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430755766] [2024-11-17 00:52:02,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,231 INFO L87 Difference]: Start difference. First operand 383 states and 681 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) [2024-11-17 00:52:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,239 INFO L93 Difference]: Finished difference Result 390 states and 683 transitions. [2024-11-17 00:52:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,240 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 [2024-11-17 00:52:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,241 INFO L225 Difference]: With dead ends: 390 [2024-11-17 00:52:02,241 INFO L226 Difference]: Without dead ends: 390 [2024-11-17 00:52:02,241 INFO L431 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 [2024-11-17 00:52:02,242 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 238 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 [2024-11-17 00:52:02,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 238 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-17 00:52:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2024-11-17 00:52:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.7642487046632125) internal successors, (681), 386 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 681 transitions. [2024-11-17 00:52:02,265 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 681 transitions. Word has length 27 [2024-11-17 00:52:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,265 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 681 transitions. [2024-11-17 00:52:02,265 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) [2024-11-17 00:52:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 681 transitions. [2024-11-17 00:52:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:52:02,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,266 INFO L215 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] [2024-11-17 00:52:02,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:52:02,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1115076188, now seen corresponding path program 1 times [2024-11-17 00:52:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173160130] [2024-11-17 00:52:02,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173160130] [2024-11-17 00:52:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173160130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715532838] [2024-11-17 00:52:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,290 INFO L87 Difference]: Start difference. First operand 387 states and 681 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) [2024-11-17 00:52:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,300 INFO L93 Difference]: Finished difference Result 730 states and 1295 transitions. [2024-11-17 00:52:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,301 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 [2024-11-17 00:52:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,303 INFO L225 Difference]: With dead ends: 730 [2024-11-17 00:52:02,303 INFO L226 Difference]: Without dead ends: 730 [2024-11-17 00:52:02,303 INFO L431 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 [2024-11-17 00:52:02,303 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 66 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 187 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 [2024-11-17 00:52:02,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-17 00:52:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 527. [2024-11-17 00:52:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.7433460076045628) internal successors, (917), 526 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 917 transitions. [2024-11-17 00:52:02,312 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 917 transitions. Word has length 27 [2024-11-17 00:52:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,312 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 917 transitions. [2024-11-17 00:52:02,312 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) [2024-11-17 00:52:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 917 transitions. [2024-11-17 00:52:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:52:02,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,313 INFO L215 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] [2024-11-17 00:52:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:52:02,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash 270604317, now seen corresponding path program 1 times [2024-11-17 00:52:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652908759] [2024-11-17 00:52:02,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652908759] [2024-11-17 00:52:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652908759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267866291] [2024-11-17 00:52:02,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,337 INFO L87 Difference]: Start difference. First operand 527 states and 917 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) [2024-11-17 00:52:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,348 INFO L93 Difference]: Finished difference Result 754 states and 1303 transitions. [2024-11-17 00:52:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,348 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 [2024-11-17 00:52:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,350 INFO L225 Difference]: With dead ends: 754 [2024-11-17 00:52:02,350 INFO L226 Difference]: Without dead ends: 754 [2024-11-17 00:52:02,350 INFO L431 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 [2024-11-17 00:52:02,351 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 221 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 [2024-11-17 00:52:02,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-17 00:52:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 751. [2024-11-17 00:52:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.7346666666666666) internal successors, (1301), 750 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1301 transitions. [2024-11-17 00:52:02,363 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1301 transitions. Word has length 27 [2024-11-17 00:52:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,364 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1301 transitions. [2024-11-17 00:52:02,364 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) [2024-11-17 00:52:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1301 transitions. [2024-11-17 00:52:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:52:02,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,365 INFO L215 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] [2024-11-17 00:52:02,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:52:02,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash 208499930, now seen corresponding path program 1 times [2024-11-17 00:52:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208431911] [2024-11-17 00:52:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208431911] [2024-11-17 00:52:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208431911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202834947] [2024-11-17 00:52:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,402 INFO L87 Difference]: Start difference. First operand 751 states and 1301 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) [2024-11-17 00:52:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,413 INFO L93 Difference]: Finished difference Result 762 states and 1303 transitions. [2024-11-17 00:52:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,413 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 [2024-11-17 00:52:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,415 INFO L225 Difference]: With dead ends: 762 [2024-11-17 00:52:02,415 INFO L226 Difference]: Without dead ends: 762 [2024-11-17 00:52:02,415 INFO L431 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 [2024-11-17 00:52:02,416 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 234 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 [2024-11-17 00:52:02,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 234 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-17 00:52:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 759. [2024-11-17 00:52:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 1.7163588390501319) internal successors, (1301), 758 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1301 transitions. [2024-11-17 00:52:02,425 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1301 transitions. Word has length 28 [2024-11-17 00:52:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,425 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1301 transitions. [2024-11-17 00:52:02,425 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) [2024-11-17 00:52:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1301 transitions. [2024-11-17 00:52:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:52:02,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,426 INFO L215 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] [2024-11-17 00:52:02,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:52:02,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash -200324295, now seen corresponding path program 1 times [2024-11-17 00:52:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74313058] [2024-11-17 00:52:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74313058] [2024-11-17 00:52:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74313058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432209618] [2024-11-17 00:52:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,454 INFO L87 Difference]: Start difference. First operand 759 states and 1301 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) [2024-11-17 00:52:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,467 INFO L93 Difference]: Finished difference Result 1418 states and 2455 transitions. [2024-11-17 00:52:02,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,468 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 [2024-11-17 00:52:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,471 INFO L225 Difference]: With dead ends: 1418 [2024-11-17 00:52:02,471 INFO L226 Difference]: Without dead ends: 1418 [2024-11-17 00:52:02,471 INFO L431 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 [2024-11-17 00:52:02,472 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 185 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 [2024-11-17 00:52:02,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2024-11-17 00:52:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1047. [2024-11-17 00:52:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.687380497131931) internal successors, (1765), 1046 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1765 transitions. [2024-11-17 00:52:02,486 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1765 transitions. Word has length 28 [2024-11-17 00:52:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,486 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1765 transitions. [2024-11-17 00:52:02,486 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) [2024-11-17 00:52:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1765 transitions. [2024-11-17 00:52:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:52:02,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,487 INFO L215 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] [2024-11-17 00:52:02,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:52:02,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1044796166, now seen corresponding path program 1 times [2024-11-17 00:52:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303024126] [2024-11-17 00:52:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303024126] [2024-11-17 00:52:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303024126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132019495] [2024-11-17 00:52:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,513 INFO L87 Difference]: Start difference. First operand 1047 states and 1765 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) [2024-11-17 00:52:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,530 INFO L93 Difference]: Finished difference Result 1482 states and 2487 transitions. [2024-11-17 00:52:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,531 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 [2024-11-17 00:52:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,534 INFO L225 Difference]: With dead ends: 1482 [2024-11-17 00:52:02,534 INFO L226 Difference]: Without dead ends: 1482 [2024-11-17 00:52:02,535 INFO L431 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 [2024-11-17 00:52:02,535 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 222 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 [2024-11-17 00:52:02,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2024-11-17 00:52:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1479. [2024-11-17 00:52:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1478 states have (on average 1.6813261163734776) internal successors, (2485), 1478 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2485 transitions. [2024-11-17 00:52:02,551 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2485 transitions. Word has length 28 [2024-11-17 00:52:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,551 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2485 transitions. [2024-11-17 00:52:02,551 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) [2024-11-17 00:52:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2485 transitions. [2024-11-17 00:52:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:52:02,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,553 INFO L215 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] [2024-11-17 00:52:02,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:52:02,553 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1914216106, now seen corresponding path program 1 times [2024-11-17 00:52:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288751295] [2024-11-17 00:52:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288751295] [2024-11-17 00:52:02,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288751295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602074500] [2024-11-17 00:52:02,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,590 INFO L87 Difference]: Start difference. First operand 1479 states and 2485 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) [2024-11-17 00:52:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,606 INFO L93 Difference]: Finished difference Result 1498 states and 2487 transitions. [2024-11-17 00:52:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,607 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 [2024-11-17 00:52:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,610 INFO L225 Difference]: With dead ends: 1498 [2024-11-17 00:52:02,610 INFO L226 Difference]: Without dead ends: 1498 [2024-11-17 00:52:02,611 INFO L431 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 [2024-11-17 00:52:02,612 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 230 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 [2024-11-17 00:52:02,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 230 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-11-17 00:52:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1495. [2024-11-17 00:52:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1494 states have (on average 1.6633199464524766) internal successors, (2485), 1494 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 2485 transitions. [2024-11-17 00:52:02,636 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 2485 transitions. Word has length 29 [2024-11-17 00:52:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 2485 transitions. [2024-11-17 00:52:02,636 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) [2024-11-17 00:52:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2485 transitions. [2024-11-17 00:52:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:52:02,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,637 INFO L215 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] [2024-11-17 00:52:02,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:52:02,637 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1971926965, now seen corresponding path program 1 times [2024-11-17 00:52:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129843844] [2024-11-17 00:52:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129843844] [2024-11-17 00:52:02,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129843844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085737645] [2024-11-17 00:52:02,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,660 INFO L87 Difference]: Start difference. First operand 1495 states and 2485 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) [2024-11-17 00:52:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,678 INFO L93 Difference]: Finished difference Result 2762 states and 4647 transitions. [2024-11-17 00:52:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,678 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 [2024-11-17 00:52:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,684 INFO L225 Difference]: With dead ends: 2762 [2024-11-17 00:52:02,684 INFO L226 Difference]: Without dead ends: 2762 [2024-11-17 00:52:02,684 INFO L431 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 [2024-11-17 00:52:02,684 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 60 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 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, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2024-11-17 00:52:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2087. [2024-11-17 00:52:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 2086 states have (on average 1.6284755512943432) internal successors, (3397), 2086 states have internal predecessors, (3397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3397 transitions. [2024-11-17 00:52:02,714 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3397 transitions. Word has length 29 [2024-11-17 00:52:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,714 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 3397 transitions. [2024-11-17 00:52:02,714 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) [2024-11-17 00:52:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3397 transitions. [2024-11-17 00:52:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:52:02,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,715 INFO L215 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] [2024-11-17 00:52:02,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:52:02,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1127455094, now seen corresponding path program 1 times [2024-11-17 00:52:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076788936] [2024-11-17 00:52:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076788936] [2024-11-17 00:52:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076788936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425251171] [2024-11-17 00:52:02,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,738 INFO L87 Difference]: Start difference. First operand 2087 states and 3397 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) [2024-11-17 00:52:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,754 INFO L93 Difference]: Finished difference Result 2922 states and 4743 transitions. [2024-11-17 00:52:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,755 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 [2024-11-17 00:52:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,761 INFO L225 Difference]: With dead ends: 2922 [2024-11-17 00:52:02,761 INFO L226 Difference]: Without dead ends: 2922 [2024-11-17 00:52:02,761 INFO L431 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 [2024-11-17 00:52:02,761 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 223 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 [2024-11-17 00:52:02,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2024-11-17 00:52:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2919. [2024-11-17 00:52:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2918 states have (on average 1.6247429746401645) internal successors, (4741), 2918 states have internal predecessors, (4741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4741 transitions. [2024-11-17 00:52:02,793 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4741 transitions. Word has length 29 [2024-11-17 00:52:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,793 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 4741 transitions. [2024-11-17 00:52:02,794 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) [2024-11-17 00:52:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4741 transitions. [2024-11-17 00:52:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:52:02,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,795 INFO L215 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] [2024-11-17 00:52:02,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:52:02,796 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1001056787, now seen corresponding path program 1 times [2024-11-17 00:52:02,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71419650] [2024-11-17 00:52:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71419650] [2024-11-17 00:52:02,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71419650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94342514] [2024-11-17 00:52:02,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,818 INFO L87 Difference]: Start difference. First operand 2919 states and 4741 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) [2024-11-17 00:52:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,837 INFO L93 Difference]: Finished difference Result 2954 states and 4743 transitions. [2024-11-17 00:52:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,837 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 [2024-11-17 00:52:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,844 INFO L225 Difference]: With dead ends: 2954 [2024-11-17 00:52:02,844 INFO L226 Difference]: Without dead ends: 2954 [2024-11-17 00:52:02,844 INFO L431 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 [2024-11-17 00:52:02,845 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 226 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 [2024-11-17 00:52:02,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2024-11-17 00:52:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2951. [2024-11-17 00:52:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2950 states have (on average 1.6071186440677967) internal successors, (4741), 2950 states have internal predecessors, (4741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4741 transitions. [2024-11-17 00:52:02,885 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4741 transitions. Word has length 30 [2024-11-17 00:52:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,900 INFO L471 AbstractCegarLoop]: Abstraction has 2951 states and 4741 transitions. [2024-11-17 00:52:02,900 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) [2024-11-17 00:52:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4741 transitions. [2024-11-17 00:52:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:52:02,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,902 INFO L215 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] [2024-11-17 00:52:02,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:52:02,902 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash 592232562, now seen corresponding path program 1 times [2024-11-17 00:52:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070535288] [2024-11-17 00:52:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070535288] [2024-11-17 00:52:02,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070535288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023900486] [2024-11-17 00:52:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,932 INFO L87 Difference]: Start difference. First operand 2951 states and 4741 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) [2024-11-17 00:52:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,961 INFO L93 Difference]: Finished difference Result 5386 states and 8775 transitions. [2024-11-17 00:52:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,962 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 [2024-11-17 00:52:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,980 INFO L225 Difference]: With dead ends: 5386 [2024-11-17 00:52:02,980 INFO L226 Difference]: Without dead ends: 5386 [2024-11-17 00:52:02,980 INFO L431 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 [2024-11-17 00:52:02,980 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 57 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 181 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 [2024-11-17 00:52:02,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2024-11-17 00:52:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 4167. [2024-11-17 00:52:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4167 states, 4166 states have (on average 1.5681709073451753) internal successors, (6533), 4166 states have internal predecessors, (6533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 6533 transitions. [2024-11-17 00:52:03,037 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 6533 transitions. Word has length 30 [2024-11-17 00:52:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:03,038 INFO L471 AbstractCegarLoop]: Abstraction has 4167 states and 6533 transitions. [2024-11-17 00:52:03,038 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) [2024-11-17 00:52:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 6533 transitions. [2024-11-17 00:52:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:52:03,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:03,041 INFO L215 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] [2024-11-17 00:52:03,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:52:03,041 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:03,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash -252239309, now seen corresponding path program 1 times [2024-11-17 00:52:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:03,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419325718] [2024-11-17 00:52:03,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:03,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419325718] [2024-11-17 00:52:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419325718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:03,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673904053] [2024-11-17 00:52:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:03,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:03,058 INFO L87 Difference]: Start difference. First operand 4167 states and 6533 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) [2024-11-17 00:52:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:03,083 INFO L93 Difference]: Finished difference Result 5770 states and 9031 transitions. [2024-11-17 00:52:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:03,083 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 [2024-11-17 00:52:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:03,090 INFO L225 Difference]: With dead ends: 5770 [2024-11-17 00:52:03,090 INFO L226 Difference]: Without dead ends: 5770 [2024-11-17 00:52:03,090 INFO L431 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 [2024-11-17 00:52:03,091 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 224 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 [2024-11-17 00:52:03,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2024-11-17 00:52:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5767. [2024-11-17 00:52:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 5766 states have (on average 1.5659035726673605) internal successors, (9029), 5766 states have internal predecessors, (9029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 9029 transitions. [2024-11-17 00:52:03,206 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 9029 transitions. Word has length 30 [2024-11-17 00:52:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:03,207 INFO L471 AbstractCegarLoop]: Abstraction has 5767 states and 9029 transitions. [2024-11-17 00:52:03,207 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) [2024-11-17 00:52:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 9029 transitions. [2024-11-17 00:52:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:52:03,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:03,210 INFO L215 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] [2024-11-17 00:52:03,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:52:03,210 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:03,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:03,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1180196527, now seen corresponding path program 1 times [2024-11-17 00:52:03,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:03,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112759552] [2024-11-17 00:52:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:03,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112759552] [2024-11-17 00:52:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112759552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:03,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390137040] [2024-11-17 00:52:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:03,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:03,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:03,228 INFO L87 Difference]: Start difference. First operand 5767 states and 9029 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) [2024-11-17 00:52:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:03,250 INFO L93 Difference]: Finished difference Result 5834 states and 9031 transitions. [2024-11-17 00:52:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:03,251 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 [2024-11-17 00:52:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:03,256 INFO L225 Difference]: With dead ends: 5834 [2024-11-17 00:52:03,256 INFO L226 Difference]: Without dead ends: 5834 [2024-11-17 00:52:03,256 INFO L431 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 [2024-11-17 00:52:03,257 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 222 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 [2024-11-17 00:52:03,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 222 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5834 states. [2024-11-17 00:52:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5834 to 5831. [2024-11-17 00:52:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5831 states, 5830 states have (on average 1.548713550600343) internal successors, (9029), 5830 states have internal predecessors, (9029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5831 states to 5831 states and 9029 transitions. [2024-11-17 00:52:03,306 INFO L78 Accepts]: Start accepts. Automaton has 5831 states and 9029 transitions. Word has length 31 [2024-11-17 00:52:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:03,306 INFO L471 AbstractCegarLoop]: Abstraction has 5831 states and 9029 transitions. [2024-11-17 00:52:03,306 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) [2024-11-17 00:52:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5831 states and 9029 transitions. [2024-11-17 00:52:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:52:03,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:03,309 INFO L215 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] [2024-11-17 00:52:03,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 00:52:03,310 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:03,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:03,310 INFO L85 PathProgramCache]: Analyzing trace with hash 771372302, now seen corresponding path program 1 times [2024-11-17 00:52:03,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:03,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745468343] [2024-11-17 00:52:03,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:03,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:03,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:03,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745468343] [2024-11-17 00:52:03,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745468343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:03,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:03,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:03,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668921207] [2024-11-17 00:52:03,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:03,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:03,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:03,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:03,337 INFO L87 Difference]: Start difference. First operand 5831 states and 9029 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) [2024-11-17 00:52:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:03,395 INFO L93 Difference]: Finished difference Result 10506 states and 16519 transitions. [2024-11-17 00:52:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:03,395 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 [2024-11-17 00:52:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:03,420 INFO L225 Difference]: With dead ends: 10506 [2024-11-17 00:52:03,424 INFO L226 Difference]: Without dead ends: 10506 [2024-11-17 00:52:03,424 INFO L431 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 [2024-11-17 00:52:03,425 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 54 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 179 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 [2024-11-17 00:52:03,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10506 states. [2024-11-17 00:52:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10506 to 8327. [2024-11-17 00:52:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8327 states, 8326 states have (on average 1.507206341580591) internal successors, (12549), 8326 states have internal predecessors, (12549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8327 states to 8327 states and 12549 transitions. [2024-11-17 00:52:03,705 INFO L78 Accepts]: Start accepts. Automaton has 8327 states and 12549 transitions. Word has length 31 [2024-11-17 00:52:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:03,705 INFO L471 AbstractCegarLoop]: Abstraction has 8327 states and 12549 transitions. [2024-11-17 00:52:03,705 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) [2024-11-17 00:52:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 12549 transitions. [2024-11-17 00:52:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:52:03,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:03,713 INFO L215 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] [2024-11-17 00:52:03,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 00:52:03,713 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:03,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash -73099569, now seen corresponding path program 1 times [2024-11-17 00:52:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640791850] [2024-11-17 00:52:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640791850] [2024-11-17 00:52:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640791850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646511582] [2024-11-17 00:52:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:03,733 INFO L87 Difference]: Start difference. First operand 8327 states and 12549 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) [2024-11-17 00:52:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:03,790 INFO L93 Difference]: Finished difference Result 11402 states and 17159 transitions. [2024-11-17 00:52:03,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:03,790 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 [2024-11-17 00:52:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:03,804 INFO L225 Difference]: With dead ends: 11402 [2024-11-17 00:52:03,805 INFO L226 Difference]: Without dead ends: 11402 [2024-11-17 00:52:03,805 INFO L431 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 [2024-11-17 00:52:03,805 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 225 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 [2024-11-17 00:52:03,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 225 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11402 states. [2024-11-17 00:52:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11402 to 11399. [2024-11-17 00:52:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11399 states, 11398 states have (on average 1.5052640814177927) internal successors, (17157), 11398 states have internal predecessors, (17157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11399 states to 11399 states and 17157 transitions. [2024-11-17 00:52:03,991 INFO L78 Accepts]: Start accepts. Automaton has 11399 states and 17157 transitions. Word has length 31 [2024-11-17 00:52:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:03,991 INFO L471 AbstractCegarLoop]: Abstraction has 11399 states and 17157 transitions. [2024-11-17 00:52:03,991 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) [2024-11-17 00:52:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 11399 states and 17157 transitions. [2024-11-17 00:52:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:52:03,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:03,998 INFO L215 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] [2024-11-17 00:52:03,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 00:52:03,998 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:03,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1856412852, now seen corresponding path program 1 times [2024-11-17 00:52:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53761302] [2024-11-17 00:52:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53761302] [2024-11-17 00:52:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53761302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106108575] [2024-11-17 00:52:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:04,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:04,016 INFO L87 Difference]: Start difference. First operand 11399 states and 17157 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) [2024-11-17 00:52:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:04,068 INFO L93 Difference]: Finished difference Result 11530 states and 17159 transitions. [2024-11-17 00:52:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:04,069 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 [2024-11-17 00:52:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:04,083 INFO L225 Difference]: With dead ends: 11530 [2024-11-17 00:52:04,084 INFO L226 Difference]: Without dead ends: 11530 [2024-11-17 00:52:04,084 INFO L431 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 [2024-11-17 00:52:04,084 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 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 [2024-11-17 00:52:04,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11530 states. [2024-11-17 00:52:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11530 to 11527. [2024-11-17 00:52:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11527 states, 11526 states have (on average 1.4885476314419572) internal successors, (17157), 11526 states have internal predecessors, (17157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11527 states to 11527 states and 17157 transitions. [2024-11-17 00:52:04,323 INFO L78 Accepts]: Start accepts. Automaton has 11527 states and 17157 transitions. Word has length 32 [2024-11-17 00:52:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:04,323 INFO L471 AbstractCegarLoop]: Abstraction has 11527 states and 17157 transitions. [2024-11-17 00:52:04,323 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) [2024-11-17 00:52:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 11527 states and 17157 transitions. [2024-11-17 00:52:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:52:04,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:04,329 INFO L215 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] [2024-11-17 00:52:04,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 00:52:04,330 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:04,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2029730219, now seen corresponding path program 1 times [2024-11-17 00:52:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812456901] [2024-11-17 00:52:04,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:04,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812456901] [2024-11-17 00:52:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812456901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:04,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194693410] [2024-11-17 00:52:04,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:04,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:04,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:04,346 INFO L87 Difference]: Start difference. First operand 11527 states and 17157 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) [2024-11-17 00:52:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:04,382 INFO L93 Difference]: Finished difference Result 20490 states and 30983 transitions. [2024-11-17 00:52:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:04,382 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 [2024-11-17 00:52:04,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:04,407 INFO L225 Difference]: With dead ends: 20490 [2024-11-17 00:52:04,407 INFO L226 Difference]: Without dead ends: 20490 [2024-11-17 00:52:04,408 INFO L431 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 [2024-11-17 00:52:04,408 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 51 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 177 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 [2024-11-17 00:52:04,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20490 states. [2024-11-17 00:52:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20490 to 16647. [2024-11-17 00:52:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16647 states, 16646 states have (on average 1.4459329568665145) internal successors, (24069), 16646 states have internal predecessors, (24069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16647 states to 16647 states and 24069 transitions. [2024-11-17 00:52:04,841 INFO L78 Accepts]: Start accepts. Automaton has 16647 states and 24069 transitions. Word has length 32 [2024-11-17 00:52:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:04,842 INFO L471 AbstractCegarLoop]: Abstraction has 16647 states and 24069 transitions. [2024-11-17 00:52:04,842 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) [2024-11-17 00:52:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16647 states and 24069 transitions. [2024-11-17 00:52:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:52:04,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:04,857 INFO L215 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] [2024-11-17 00:52:04,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 00:52:04,857 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:04,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:04,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1185258348, now seen corresponding path program 1 times [2024-11-17 00:52:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:04,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019319105] [2024-11-17 00:52:04,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:04,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:04,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019319105] [2024-11-17 00:52:04,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019319105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:04,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:04,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:04,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921481553] [2024-11-17 00:52:04,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:04,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:04,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:04,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:04,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:04,879 INFO L87 Difference]: Start difference. First operand 16647 states and 24069 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) [2024-11-17 00:52:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:04,933 INFO L93 Difference]: Finished difference Result 22538 states and 32519 transitions. [2024-11-17 00:52:04,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:04,933 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 [2024-11-17 00:52:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:04,966 INFO L225 Difference]: With dead ends: 22538 [2024-11-17 00:52:04,966 INFO L226 Difference]: Without dead ends: 22538 [2024-11-17 00:52:04,967 INFO L431 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 [2024-11-17 00:52:04,967 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 226 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 [2024-11-17 00:52:04,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 226 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22538 states. [2024-11-17 00:52:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22538 to 22535. [2024-11-17 00:52:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22535 states, 22534 states have (on average 1.4430194372947547) internal successors, (32517), 22534 states have internal predecessors, (32517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22535 states to 22535 states and 32517 transitions. [2024-11-17 00:52:05,313 INFO L78 Accepts]: Start accepts. Automaton has 22535 states and 32517 transitions. Word has length 32 [2024-11-17 00:52:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:05,313 INFO L471 AbstractCegarLoop]: Abstraction has 22535 states and 32517 transitions. [2024-11-17 00:52:05,313 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) [2024-11-17 00:52:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 22535 states and 32517 transitions. [2024-11-17 00:52:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:52:05,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:05,326 INFO L215 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] [2024-11-17 00:52:05,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-17 00:52:05,327 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:05,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1502029816, now seen corresponding path program 1 times [2024-11-17 00:52:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399423389] [2024-11-17 00:52:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:05,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:05,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399423389] [2024-11-17 00:52:05,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399423389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:05,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:05,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63606286] [2024-11-17 00:52:05,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:05,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:05,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:05,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:05,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:05,344 INFO L87 Difference]: Start difference. First operand 22535 states and 32517 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) [2024-11-17 00:52:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:05,523 INFO L93 Difference]: Finished difference Result 22794 states and 32519 transitions. [2024-11-17 00:52:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:05,527 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 [2024-11-17 00:52:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:05,563 INFO L225 Difference]: With dead ends: 22794 [2024-11-17 00:52:05,563 INFO L226 Difference]: Without dead ends: 22794 [2024-11-17 00:52:05,563 INFO L431 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 [2024-11-17 00:52:05,564 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 214 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 [2024-11-17 00:52:05,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22794 states. [2024-11-17 00:52:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22794 to 22791. [2024-11-17 00:52:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22791 states, 22790 states have (on average 1.4268100043878895) internal successors, (32517), 22790 states have internal predecessors, (32517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22791 states to 22791 states and 32517 transitions. [2024-11-17 00:52:05,751 INFO L78 Accepts]: Start accepts. Automaton has 22791 states and 32517 transitions. Word has length 33 [2024-11-17 00:52:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:05,752 INFO L471 AbstractCegarLoop]: Abstraction has 22791 states and 32517 transitions. [2024-11-17 00:52:05,752 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) [2024-11-17 00:52:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 22791 states and 32517 transitions. [2024-11-17 00:52:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:52:05,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:05,771 INFO L215 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] [2024-11-17 00:52:05,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-17 00:52:05,772 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:05,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1910854041, now seen corresponding path program 1 times [2024-11-17 00:52:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280053037] [2024-11-17 00:52:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280053037] [2024-11-17 00:52:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280053037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:05,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072662049] [2024-11-17 00:52:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:05,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:05,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:05,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:05,792 INFO L87 Difference]: Start difference. First operand 22791 states and 32517 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) [2024-11-17 00:52:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:05,958 INFO L93 Difference]: Finished difference Result 39946 states and 57863 transitions. [2024-11-17 00:52:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:05,959 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 [2024-11-17 00:52:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:06,020 INFO L225 Difference]: With dead ends: 39946 [2024-11-17 00:52:06,021 INFO L226 Difference]: Without dead ends: 39946 [2024-11-17 00:52:06,021 INFO L431 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 [2024-11-17 00:52:06,022 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 48 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 175 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 [2024-11-17 00:52:06,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39946 states. [2024-11-17 00:52:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39946 to 33287. [2024-11-17 00:52:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33287 states, 33286 states have (on average 1.384516012738088) internal successors, (46085), 33286 states have internal predecessors, (46085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33287 states to 33287 states and 46085 transitions. [2024-11-17 00:52:06,648 INFO L78 Accepts]: Start accepts. Automaton has 33287 states and 46085 transitions. Word has length 33 [2024-11-17 00:52:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:06,648 INFO L471 AbstractCegarLoop]: Abstraction has 33287 states and 46085 transitions. [2024-11-17 00:52:06,649 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) [2024-11-17 00:52:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 33287 states and 46085 transitions. [2024-11-17 00:52:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:52:06,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:06,685 INFO L215 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] [2024-11-17 00:52:06,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 00:52:06,686 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:06,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1539641384, now seen corresponding path program 1 times [2024-11-17 00:52:06,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:06,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691363162] [2024-11-17 00:52:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:06,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691363162] [2024-11-17 00:52:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691363162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:06,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248781077] [2024-11-17 00:52:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:06,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:06,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:06,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:06,707 INFO L87 Difference]: Start difference. First operand 33287 states and 46085 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) [2024-11-17 00:52:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:06,810 INFO L93 Difference]: Finished difference Result 44554 states and 61447 transitions. [2024-11-17 00:52:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:06,810 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 [2024-11-17 00:52:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:06,998 INFO L225 Difference]: With dead ends: 44554 [2024-11-17 00:52:06,999 INFO L226 Difference]: Without dead ends: 44554 [2024-11-17 00:52:06,999 INFO L431 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 [2024-11-17 00:52:06,999 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 227 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 [2024-11-17 00:52:06,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44554 states. [2024-11-17 00:52:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44554 to 44551. [2024-11-17 00:52:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44551 states, 44550 states have (on average 1.379236812570146) internal successors, (61445), 44550 states have internal predecessors, (61445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44551 states to 44551 states and 61445 transitions. [2024-11-17 00:52:07,508 INFO L78 Accepts]: Start accepts. Automaton has 44551 states and 61445 transitions. Word has length 33 [2024-11-17 00:52:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:07,508 INFO L471 AbstractCegarLoop]: Abstraction has 44551 states and 61445 transitions. [2024-11-17 00:52:07,509 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) [2024-11-17 00:52:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 44551 states and 61445 transitions. [2024-11-17 00:52:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:52:07,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:07,526 INFO L215 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] [2024-11-17 00:52:07,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-17 00:52:07,528 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:07,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash 893902981, now seen corresponding path program 1 times [2024-11-17 00:52:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:07,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514043291] [2024-11-17 00:52:07,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:07,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:07,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514043291] [2024-11-17 00:52:07,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514043291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:07,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:07,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526959652] [2024-11-17 00:52:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:07,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:07,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:07,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:07,737 INFO L87 Difference]: Start difference. First operand 44551 states and 61445 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) [2024-11-17 00:52:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:07,812 INFO L93 Difference]: Finished difference Result 45066 states and 61447 transitions. [2024-11-17 00:52:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:07,812 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 [2024-11-17 00:52:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:07,856 INFO L225 Difference]: With dead ends: 45066 [2024-11-17 00:52:07,856 INFO L226 Difference]: Without dead ends: 45066 [2024-11-17 00:52:07,856 INFO L431 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 [2024-11-17 00:52:07,857 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 210 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 [2024-11-17 00:52:07,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 210 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45066 states. [2024-11-17 00:52:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45066 to 45063. [2024-11-17 00:52:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45063 states, 45062 states have (on average 1.3635657538502508) internal successors, (61445), 45062 states have internal predecessors, (61445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45063 states to 45063 states and 61445 transitions. [2024-11-17 00:52:08,482 INFO L78 Accepts]: Start accepts. Automaton has 45063 states and 61445 transitions. Word has length 34 [2024-11-17 00:52:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:08,483 INFO L471 AbstractCegarLoop]: Abstraction has 45063 states and 61445 transitions. [2024-11-17 00:52:08,483 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) [2024-11-17 00:52:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 45063 states and 61445 transitions. [2024-11-17 00:52:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:52:08,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:08,507 INFO L215 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] [2024-11-17 00:52:08,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-17 00:52:08,507 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:08,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash 485078756, now seen corresponding path program 1 times [2024-11-17 00:52:08,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:08,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890495624] [2024-11-17 00:52:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890495624] [2024-11-17 00:52:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890495624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:08,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:08,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513802524] [2024-11-17 00:52:08,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:08,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:08,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:08,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:08,536 INFO L87 Difference]: Start difference. First operand 45063 states and 61445 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) [2024-11-17 00:52:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:08,968 INFO L93 Difference]: Finished difference Result 77834 states and 107527 transitions. [2024-11-17 00:52:08,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:08,972 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 [2024-11-17 00:52:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:09,045 INFO L225 Difference]: With dead ends: 77834 [2024-11-17 00:52:09,045 INFO L226 Difference]: Without dead ends: 77834 [2024-11-17 00:52:09,045 INFO L431 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 [2024-11-17 00:52:09,046 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 173 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 [2024-11-17 00:52:09,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77834 states. [2024-11-17 00:52:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77834 to 66567. [2024-11-17 00:52:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66567 states, 66566 states have (on average 1.3230327794970405) internal successors, (88069), 66566 states have internal predecessors, (88069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66567 states to 66567 states and 88069 transitions. [2024-11-17 00:52:09,691 INFO L78 Accepts]: Start accepts. Automaton has 66567 states and 88069 transitions. Word has length 34 [2024-11-17 00:52:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:09,692 INFO L471 AbstractCegarLoop]: Abstraction has 66567 states and 88069 transitions. [2024-11-17 00:52:09,692 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) [2024-11-17 00:52:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 66567 states and 88069 transitions. [2024-11-17 00:52:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:52:09,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:09,721 INFO L215 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] [2024-11-17 00:52:09,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-17 00:52:09,722 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:09,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash -359393115, now seen corresponding path program 1 times [2024-11-17 00:52:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822944195] [2024-11-17 00:52:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:09,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822944195] [2024-11-17 00:52:09,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822944195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:09,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:09,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244041131] [2024-11-17 00:52:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:09,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:09,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:09,738 INFO L87 Difference]: Start difference. First operand 66567 states and 88069 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) [2024-11-17 00:52:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:10,054 INFO L93 Difference]: Finished difference Result 88074 states and 115719 transitions. [2024-11-17 00:52:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:10,055 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 [2024-11-17 00:52:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:10,143 INFO L225 Difference]: With dead ends: 88074 [2024-11-17 00:52:10,144 INFO L226 Difference]: Without dead ends: 88074 [2024-11-17 00:52:10,144 INFO L431 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 [2024-11-17 00:52:10,144 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 228 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 [2024-11-17 00:52:10,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 228 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88074 states. [2024-11-17 00:52:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88074 to 88071. [2024-11-17 00:52:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88071 states, 88070 states have (on average 1.3139207448620416) internal successors, (115717), 88070 states have internal predecessors, (115717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88071 states to 88071 states and 115717 transitions. [2024-11-17 00:52:11,208 INFO L78 Accepts]: Start accepts. Automaton has 88071 states and 115717 transitions. Word has length 34 [2024-11-17 00:52:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,208 INFO L471 AbstractCegarLoop]: Abstraction has 88071 states and 115717 transitions. [2024-11-17 00:52:11,208 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) [2024-11-17 00:52:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 88071 states and 115717 transitions. [2024-11-17 00:52:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 00:52:11,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,260 INFO L215 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] [2024-11-17 00:52:11,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-17 00:52:11,260 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2141598367, now seen corresponding path program 1 times [2024-11-17 00:52:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515585447] [2024-11-17 00:52:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515585447] [2024-11-17 00:52:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515585447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542533292] [2024-11-17 00:52:11,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,288 INFO L87 Difference]: Start difference. First operand 88071 states and 115717 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) [2024-11-17 00:52:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,806 INFO L93 Difference]: Finished difference Result 89098 states and 115719 transitions. [2024-11-17 00:52:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,807 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 [2024-11-17 00:52:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,899 INFO L225 Difference]: With dead ends: 89098 [2024-11-17 00:52:11,899 INFO L226 Difference]: Without dead ends: 89098 [2024-11-17 00:52:11,899 INFO L431 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 [2024-11-17 00:52:11,899 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 67 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 206 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 [2024-11-17 00:52:11,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 206 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89098 states. [2024-11-17 00:52:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89098 to 89095. [2024-11-17 00:52:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89095 states, 89094 states have (on average 1.2988192246391452) internal successors, (115717), 89094 states have internal predecessors, (115717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89095 states to 89095 states and 115717 transitions. [2024-11-17 00:52:12,749 INFO L78 Accepts]: Start accepts. Automaton has 89095 states and 115717 transitions. Word has length 35 [2024-11-17 00:52:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,749 INFO L471 AbstractCegarLoop]: Abstraction has 89095 states and 115717 transitions. [2024-11-17 00:52:12,749 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) [2024-11-17 00:52:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 89095 states and 115717 transitions. [2024-11-17 00:52:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 00:52:12,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,784 INFO L215 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] [2024-11-17 00:52:12,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-17 00:52:12,784 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1744544704, now seen corresponding path program 1 times [2024-11-17 00:52:12,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042228734] [2024-11-17 00:52:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042228734] [2024-11-17 00:52:12,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042228734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486839587] [2024-11-17 00:52:12,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,801 INFO L87 Difference]: Start difference. First operand 89095 states and 115717 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) [2024-11-17 00:52:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:13,016 INFO L93 Difference]: Finished difference Result 151562 states and 198663 transitions. [2024-11-17 00:52:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:13,017 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 [2024-11-17 00:52:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:13,186 INFO L225 Difference]: With dead ends: 151562 [2024-11-17 00:52:13,186 INFO L226 Difference]: Without dead ends: 151562 [2024-11-17 00:52:13,186 INFO L431 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 [2024-11-17 00:52:13,187 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 171 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 [2024-11-17 00:52:13,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151562 states. [2024-11-17 00:52:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151562 to 133127. [2024-11-17 00:52:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133127 states, 133126 states have (on average 1.2615191622973725) internal successors, (167941), 133126 states have internal predecessors, (167941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133127 states to 133127 states and 167941 transitions. [2024-11-17 00:52:15,181 INFO L78 Accepts]: Start accepts. Automaton has 133127 states and 167941 transitions. Word has length 35 [2024-11-17 00:52:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:15,181 INFO L471 AbstractCegarLoop]: Abstraction has 133127 states and 167941 transitions. [2024-11-17 00:52:15,181 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) [2024-11-17 00:52:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 133127 states and 167941 transitions. [2024-11-17 00:52:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 00:52:15,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:15,270 INFO L215 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] [2024-11-17 00:52:15,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-17 00:52:15,271 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:15,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash 900072833, now seen corresponding path program 1 times [2024-11-17 00:52:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747350491] [2024-11-17 00:52:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747350491] [2024-11-17 00:52:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747350491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:15,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:15,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:15,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419473323] [2024-11-17 00:52:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:15,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:15,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:15,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:15,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:15,289 INFO L87 Difference]: Start difference. First operand 133127 states and 167941 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) [2024-11-17 00:52:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:16,287 INFO L93 Difference]: Finished difference Result 174090 states and 217095 transitions. [2024-11-17 00:52:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:16,288 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 [2024-11-17 00:52:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:16,497 INFO L225 Difference]: With dead ends: 174090 [2024-11-17 00:52:16,498 INFO L226 Difference]: Without dead ends: 174090 [2024-11-17 00:52:16,498 INFO L431 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 [2024-11-17 00:52:16,498 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 229 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 [2024-11-17 00:52:16,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174090 states. [2024-11-17 00:52:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174090 to 174087. [2024-11-17 00:52:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174087 states, 174086 states have (on average 1.247044564180922) internal successors, (217093), 174086 states have internal predecessors, (217093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174087 states to 174087 states and 217093 transitions. [2024-11-17 00:52:18,505 INFO L78 Accepts]: Start accepts. Automaton has 174087 states and 217093 transitions. Word has length 35 [2024-11-17 00:52:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:18,505 INFO L471 AbstractCegarLoop]: Abstraction has 174087 states and 217093 transitions. [2024-11-17 00:52:18,505 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) [2024-11-17 00:52:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 174087 states and 217093 transitions. [2024-11-17 00:52:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 00:52:18,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:18,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:18,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-17 00:52:18,589 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:18,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1752866370, now seen corresponding path program 1 times [2024-11-17 00:52:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:18,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044601806] [2024-11-17 00:52:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044601806] [2024-11-17 00:52:18,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044601806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:18,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:18,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387991955] [2024-11-17 00:52:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:18,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:18,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:18,630 INFO L87 Difference]: Start difference. First operand 174087 states and 217093 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:18,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:18,942 INFO L93 Difference]: Finished difference Result 176138 states and 217095 transitions. [2024-11-17 00:52:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-17 00:52:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:20,062 INFO L225 Difference]: With dead ends: 176138 [2024-11-17 00:52:20,063 INFO L226 Difference]: Without dead ends: 176138 [2024-11-17 00:52:20,063 INFO L431 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 [2024-11-17 00:52:20,063 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 202 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 [2024-11-17 00:52:20,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 202 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176138 states. [2024-11-17 00:52:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176138 to 176135. [2024-11-17 00:52:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176135 states, 176134 states have (on average 1.232544539952536) internal successors, (217093), 176134 states have internal predecessors, (217093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176135 states to 176135 states and 217093 transitions. [2024-11-17 00:52:22,258 INFO L78 Accepts]: Start accepts. Automaton has 176135 states and 217093 transitions. Word has length 36 [2024-11-17 00:52:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:22,260 INFO L471 AbstractCegarLoop]: Abstraction has 176135 states and 217093 transitions. [2024-11-17 00:52:22,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 176135 states and 217093 transitions. [2024-11-17 00:52:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 00:52:22,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:22,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:22,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-17 00:52:22,337 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:22,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2133276701, now seen corresponding path program 1 times [2024-11-17 00:52:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:22,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333325415] [2024-11-17 00:52:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:22,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333325415] [2024-11-17 00:52:22,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333325415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:22,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:22,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162511464] [2024-11-17 00:52:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:22,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:22,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:22,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:22,367 INFO L87 Difference]: Start difference. First operand 176135 states and 217093 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:23,543 INFO L93 Difference]: Finished difference Result 294922 states and 364551 transitions. [2024-11-17 00:52:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:23,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-17 00:52:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:23,886 INFO L225 Difference]: With dead ends: 294922 [2024-11-17 00:52:23,887 INFO L226 Difference]: Without dead ends: 294922 [2024-11-17 00:52:23,887 INFO L431 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 [2024-11-17 00:52:23,887 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 39 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 169 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 [2024-11-17 00:52:23,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294922 states. [2024-11-17 00:52:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294922 to 266247. [2024-11-17 00:52:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266247 states, 266246 states have (on average 1.1999917369650623) internal successors, (319493), 266246 states have internal predecessors, (319493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266247 states to 266247 states and 319493 transitions. [2024-11-17 00:52:27,885 INFO L78 Accepts]: Start accepts. Automaton has 266247 states and 319493 transitions. Word has length 36 [2024-11-17 00:52:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:27,885 INFO L471 AbstractCegarLoop]: Abstraction has 266247 states and 319493 transitions. [2024-11-17 00:52:27,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 266247 states and 319493 transitions. [2024-11-17 00:52:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 00:52:28,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:28,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:28,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-17 00:52:28,084 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:28,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1288804830, now seen corresponding path program 1 times [2024-11-17 00:52:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909216323] [2024-11-17 00:52:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909216323] [2024-11-17 00:52:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909216323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:28,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:28,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724480483] [2024-11-17 00:52:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:28,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:28,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:28,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:28,100 INFO L87 Difference]: Start difference. First operand 266247 states and 319493 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:29,586 INFO L93 Difference]: Finished difference Result 344074 states and 405511 transitions. [2024-11-17 00:52:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:29,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-17 00:52:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:30,064 INFO L225 Difference]: With dead ends: 344074 [2024-11-17 00:52:30,064 INFO L226 Difference]: Without dead ends: 344074 [2024-11-17 00:52:30,064 INFO L431 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 [2024-11-17 00:52:30,065 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 230 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 [2024-11-17 00:52:30,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 230 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344074 states. [2024-11-17 00:52:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344074 to 344071. [2024-11-17 00:52:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344071 states, 344070 states have (on average 1.1785654082018193) internal successors, (405509), 344070 states have internal predecessors, (405509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344071 states to 344071 states and 405509 transitions. [2024-11-17 00:52:34,040 INFO L78 Accepts]: Start accepts. Automaton has 344071 states and 405509 transitions. Word has length 36 [2024-11-17 00:52:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:34,041 INFO L471 AbstractCegarLoop]: Abstraction has 344071 states and 405509 transitions. [2024-11-17 00:52:34,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 344071 states and 405509 transitions. [2024-11-17 00:52:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:52:35,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:35,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:35,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-17 00:52:35,065 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:35,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1707884218, now seen corresponding path program 1 times [2024-11-17 00:52:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909770239] [2024-11-17 00:52:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909770239] [2024-11-17 00:52:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909770239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:35,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:35,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199699490] [2024-11-17 00:52:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:35,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:35,105 INFO L87 Difference]: Start difference. First operand 344071 states and 405509 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:35,786 INFO L93 Difference]: Finished difference Result 348170 states and 405511 transitions. [2024-11-17 00:52:35,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:35,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-17 00:52:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:36,172 INFO L225 Difference]: With dead ends: 348170 [2024-11-17 00:52:36,173 INFO L226 Difference]: Without dead ends: 348170 [2024-11-17 00:52:36,173 INFO L431 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 [2024-11-17 00:52:36,173 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 65 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 198 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 [2024-11-17 00:52:36,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348170 states.