./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 3061b6dc 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:05:57,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:05:57,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:05:57,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:05:57,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:05:58,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:05:58,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:05:58,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:05:58,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:05:58,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:05:58,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:05:58,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:05:58,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:05:58,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:05:58,018 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:05:58,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:05:58,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:05:58,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:05:58,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:05:58,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:05:58,022 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:05:58,022 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:05:58,023 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:05:58,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:05:58,023 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:05:58,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:05:58,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:05:58,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:05:58,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:05:58,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:05:58,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:05:58,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:05:58,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:05:58,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:05:58,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:05:58,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:05:58,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:05:58,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:05:58,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:05:58,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:05:58,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:05:58,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:05:58,030 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-19 07:05:58,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:05:58,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:05:58,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:05:58,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:05:58,327 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:05:58,328 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-19 07:05:59,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:06:00,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:06:00,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-19 07:06:00,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50db9fc1c/d4bc7f1a8a464538bfe74ca71dd949b1/FLAGc09ca7cf3 [2024-11-19 07:06:00,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50db9fc1c/d4bc7f1a8a464538bfe74ca71dd949b1 [2024-11-19 07:06:00,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:06:00,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:06:00,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:06:00,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:06:00,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:06:00,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69edcc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00, skipping insertion in model container [2024-11-19 07:06:00,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:06:00,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:06:00,446 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:06:00,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:06:00,490 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:06:00,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00 WrapperNode [2024-11-19 07:06:00,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:06:00,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:06:00,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:06:00,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:06:00,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,549 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 209 [2024-11-19 07:06:00,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:06:00,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:06:00,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:06:00,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:06:00,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,583 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-19 07:06:00,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:06:00,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:06:00,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:06:00,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:06:00,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (1/1) ... [2024-11-19 07:06:00,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:06:00,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:06:00,647 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-19 07:06:00,649 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-19 07:06:00,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:06:00,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:06:00,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:06:00,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:06:00,763 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:06:00,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:06:01,050 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-19 07:06:01,050 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:06:01,064 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:06:01,064 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 07:06:01,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:01 BoogieIcfgContainer [2024-11-19 07:06:01,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:06:01,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:06:01,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:06:01,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:06:01,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:06:00" (1/3) ... [2024-11-19 07:06:01,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77548735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:06:01, skipping insertion in model container [2024-11-19 07:06:01,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:00" (2/3) ... [2024-11-19 07:06:01,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77548735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:06:01, skipping insertion in model container [2024-11-19 07:06:01,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:01" (3/3) ... [2024-11-19 07:06:01,073 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2024-11-19 07:06:01,095 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:06:01,096 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 07:06:01,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:06:01,148 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;@1ef0b464, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:06:01,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 07:06:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 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-19 07:06:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:06:01,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:01,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:06:01,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:01,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash 28959894, now seen corresponding path program 1 times [2024-11-19 07:06:01,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:01,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538017828] [2024-11-19 07:06:01,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:01,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:01,359 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-19 07:06:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:01,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538017828] [2024-11-19 07:06:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538017828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:01,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:06:01,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680152987] [2024-11-19 07:06:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:01,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 07:06:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 07:06:01,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 07:06:01,410 INFO L87 Difference]: Start difference. First operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:01,430 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2024-11-19 07:06:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 07:06:01,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 07:06:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:01,441 INFO L225 Difference]: With dead ends: 57 [2024-11-19 07:06:01,441 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 07:06:01,442 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-19 07:06:01,447 INFO L432 NwaCegarLoop]: 101 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, 101 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-19 07:06:01,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 07:06:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-19 07:06:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 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-19 07:06:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 99 transitions. [2024-11-19 07:06:01,488 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 99 transitions. Word has length 5 [2024-11-19 07:06:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:01,488 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 99 transitions. [2024-11-19 07:06:01,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2024-11-19 07:06:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:06:01,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:01,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:06:01,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:06:01,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:01,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash 889700686, now seen corresponding path program 1 times [2024-11-19 07:06:01,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:01,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958236441] [2024-11-19 07:06:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:01,584 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-19 07:06:01,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:01,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958236441] [2024-11-19 07:06:01,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958236441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:01,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:01,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:06:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496206762] [2024-11-19 07:06:01,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:01,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:01,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:01,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:01,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:01,589 INFO L87 Difference]: Start difference. First operand 55 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:01,607 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2024-11-19 07:06:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:06:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:01,610 INFO L225 Difference]: With dead ends: 54 [2024-11-19 07:06:01,610 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 07:06:01,610 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-19 07:06:01,611 INFO L432 NwaCegarLoop]: 98 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, 98 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-19 07:06:01,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 07:06:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-19 07:06:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 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-19 07:06:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 96 transitions. [2024-11-19 07:06:01,626 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 96 transitions. Word has length 6 [2024-11-19 07:06:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:01,627 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 96 transitions. [2024-11-19 07:06:01,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 96 transitions. [2024-11-19 07:06:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:06:01,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:01,629 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] [2024-11-19 07:06:01,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:06:01,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:01,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1809331837, now seen corresponding path program 1 times [2024-11-19 07:06:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:01,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15124243] [2024-11-19 07:06:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:01,767 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-19 07:06:01,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15124243] [2024-11-19 07:06:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15124243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:01,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640838368] [2024-11-19 07:06:01,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:01,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:01,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:01,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:01,771 INFO L87 Difference]: Start difference. First operand 52 states and 96 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:01,801 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2024-11-19 07:06:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:01,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 07:06:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:01,803 INFO L225 Difference]: With dead ends: 101 [2024-11-19 07:06:01,803 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 07:06:01,803 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-19 07:06:01,805 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 74 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 190 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-19 07:06:01,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 190 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 07:06:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 68. [2024-11-19 07:06:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 0 states have call successors, (0), 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-19 07:06:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 127 transitions. [2024-11-19 07:06:01,817 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 127 transitions. Word has length 23 [2024-11-19 07:06:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:01,818 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 127 transitions. [2024-11-19 07:06:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 127 transitions. [2024-11-19 07:06:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:06:01,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:01,823 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] [2024-11-19 07:06:01,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:06:01,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:01,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash 120388095, now seen corresponding path program 1 times [2024-11-19 07:06:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572920715] [2024-11-19 07:06:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:01,934 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-19 07:06:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:01,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572920715] [2024-11-19 07:06:01,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572920715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:01,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:01,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:01,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693386443] [2024-11-19 07:06:01,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:01,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:01,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:01,944 INFO L87 Difference]: Start difference. First operand 68 states and 127 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:01,975 INFO L93 Difference]: Finished difference Result 101 states and 185 transitions. [2024-11-19 07:06:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 07:06:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:01,978 INFO L225 Difference]: With dead ends: 101 [2024-11-19 07:06:01,980 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 07:06:01,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-19 07:06:01,981 INFO L432 NwaCegarLoop]: 125 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, 215 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-19 07:06:01,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 215 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 07:06:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-19 07:06:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 0 states have call successors, (0), 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-19 07:06:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 183 transitions. [2024-11-19 07:06:01,997 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 183 transitions. Word has length 23 [2024-11-19 07:06:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:01,997 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 183 transitions. [2024-11-19 07:06:01,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2024-11-19 07:06:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:06:01,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:01,999 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-19 07:06:01,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:06:01,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 261267327, now seen corresponding path program 1 times [2024-11-19 07:06:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673229148] [2024-11-19 07:06:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,068 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-19 07:06:02,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673229148] [2024-11-19 07:06:02,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673229148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215521034] [2024-11-19 07:06:02,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,072 INFO L87 Difference]: Start difference. First operand 98 states and 183 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-19 07:06:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,106 INFO L93 Difference]: Finished difference Result 104 states and 187 transitions. [2024-11-19 07:06:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,107 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-19 07:06:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,108 INFO L225 Difference]: With dead ends: 104 [2024-11-19 07:06:02,110 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 07:06:02,110 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-19 07:06:02,112 INFO L432 NwaCegarLoop]: 154 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, 243 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-19 07:06:02,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 07:06:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-19 07:06:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.85) internal successors, (185), 100 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-19 07:06:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 185 transitions. [2024-11-19 07:06:02,124 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 185 transitions. Word has length 24 [2024-11-19 07:06:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,125 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 185 transitions. [2024-11-19 07:06:02,125 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-19 07:06:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 185 transitions. [2024-11-19 07:06:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:06:02,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,126 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-19 07:06:02,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:06:02,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash -556381123, now seen corresponding path program 1 times [2024-11-19 07:06:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196155842] [2024-11-19 07:06:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,176 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-19 07:06:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196155842] [2024-11-19 07:06:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196155842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718382680] [2024-11-19 07:06:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,178 INFO L87 Difference]: Start difference. First operand 101 states and 185 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-19 07:06:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,204 INFO L93 Difference]: Finished difference Result 193 states and 356 transitions. [2024-11-19 07:06:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,204 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-19 07:06:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,206 INFO L225 Difference]: With dead ends: 193 [2024-11-19 07:06:02,206 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 07:06:02,206 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-19 07:06:02,207 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 188 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-19 07:06:02,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 07:06:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2024-11-19 07:06:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.849624060150376) internal successors, (246), 133 states have internal predecessors, (246), 0 states have call successors, (0), 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-19 07:06:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 246 transitions. [2024-11-19 07:06:02,226 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 246 transitions. Word has length 24 [2024-11-19 07:06:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,226 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 246 transitions. [2024-11-19 07:06:02,226 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-19 07:06:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 246 transitions. [2024-11-19 07:06:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:06:02,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,227 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-19 07:06:02,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 07:06:02,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2049642431, now seen corresponding path program 1 times [2024-11-19 07:06:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918388947] [2024-11-19 07:06:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,285 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-19 07:06:02,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918388947] [2024-11-19 07:06:02,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918388947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033908902] [2024-11-19 07:06:02,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,288 INFO L87 Difference]: Start difference. First operand 134 states and 246 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-19 07:06:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,309 INFO L93 Difference]: Finished difference Result 195 states and 354 transitions. [2024-11-19 07:06:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,310 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-19 07:06:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,312 INFO L225 Difference]: With dead ends: 195 [2024-11-19 07:06:02,312 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 07:06:02,313 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-19 07:06:02,313 INFO L432 NwaCegarLoop]: 127 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, 216 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-19 07:06:02,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 07:06:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-19 07:06:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 0 states have call successors, (0), 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-19 07:06:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 352 transitions. [2024-11-19 07:06:02,325 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 352 transitions. Word has length 24 [2024-11-19 07:06:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,326 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 352 transitions. [2024-11-19 07:06:02,326 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-19 07:06:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 352 transitions. [2024-11-19 07:06:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:06:02,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,331 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-19 07:06:02,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 07:06:02,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -61379830, now seen corresponding path program 1 times [2024-11-19 07:06:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268545249] [2024-11-19 07:06:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,390 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-19 07:06:02,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268545249] [2024-11-19 07:06:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268545249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122140635] [2024-11-19 07:06:02,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,394 INFO L87 Difference]: Start difference. First operand 192 states and 352 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-19 07:06:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,414 INFO L93 Difference]: Finished difference Result 197 states and 354 transitions. [2024-11-19 07:06:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,414 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-19 07:06:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,415 INFO L225 Difference]: With dead ends: 197 [2024-11-19 07:06:02,415 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 07:06: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-19 07:06:02,416 INFO L432 NwaCegarLoop]: 151 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, 239 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-19 07:06:02,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 239 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 07:06:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-11-19 07:06:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.8238341968911918) internal successors, (352), 193 states have internal predecessors, (352), 0 states have call successors, (0), 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-19 07:06:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 352 transitions. [2024-11-19 07:06:02,428 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 352 transitions. Word has length 25 [2024-11-19 07:06:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,429 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 352 transitions. [2024-11-19 07:06:02,429 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-19 07:06:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 352 transitions. [2024-11-19 07:06:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:06:02,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,430 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-19 07:06:02,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:06:02,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash -879028280, now seen corresponding path program 1 times [2024-11-19 07:06:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433339675] [2024-11-19 07:06:02,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,474 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-19 07:06:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433339675] [2024-11-19 07:06:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433339675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431993338] [2024-11-19 07:06:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,476 INFO L87 Difference]: Start difference. First operand 194 states and 352 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-19 07:06:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,494 INFO L93 Difference]: Finished difference Result 377 states and 678 transitions. [2024-11-19 07:06:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,495 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-19 07:06:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,497 INFO L225 Difference]: With dead ends: 377 [2024-11-19 07:06:02,497 INFO L226 Difference]: Without dead ends: 377 [2024-11-19 07:06:02,497 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-19 07:06:02,498 INFO L432 NwaCegarLoop]: 101 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, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:02,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-19 07:06:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2024-11-19 07:06:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.8123324396782843) internal successors, (676), 373 states have internal predecessors, (676), 0 states have call successors, (0), 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-19 07:06:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 676 transitions. [2024-11-19 07:06:02,507 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 676 transitions. Word has length 25 [2024-11-19 07:06:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,507 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 676 transitions. [2024-11-19 07:06:02,508 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-19 07:06:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 676 transitions. [2024-11-19 07:06:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:06:02,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,512 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-19 07:06:02,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 07:06:02,513 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash 809915462, now seen corresponding path program 1 times [2024-11-19 07:06:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471544682] [2024-11-19 07:06:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,560 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-19 07:06:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471544682] [2024-11-19 07:06:02,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471544682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235144032] [2024-11-19 07:06:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,562 INFO L87 Difference]: Start difference. First operand 374 states and 676 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-19 07:06:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,576 INFO L93 Difference]: Finished difference Result 481 states and 874 transitions. [2024-11-19 07:06:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,576 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-19 07:06:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,578 INFO L225 Difference]: With dead ends: 481 [2024-11-19 07:06:02,578 INFO L226 Difference]: Without dead ends: 481 [2024-11-19 07:06:02,579 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-19 07:06:02,579 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 68 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:02,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 263 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-19 07:06:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 374. [2024-11-19 07:06:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.801608579088472) internal successors, (672), 373 states have internal predecessors, (672), 0 states have call successors, (0), 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-19 07:06:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 672 transitions. [2024-11-19 07:06:02,590 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 672 transitions. Word has length 25 [2024-11-19 07:06:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 672 transitions. [2024-11-19 07:06:02,590 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-19 07:06:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 672 transitions. [2024-11-19 07:06:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:06:02,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,592 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-19 07:06:02,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:06:02,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1473496534, now seen corresponding path program 1 times [2024-11-19 07:06:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024502616] [2024-11-19 07:06:02,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,649 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-19 07:06:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024502616] [2024-11-19 07:06:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024502616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510887367] [2024-11-19 07:06:02,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,651 INFO L87 Difference]: Start difference. First operand 374 states and 672 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-19 07:06:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,666 INFO L93 Difference]: Finished difference Result 709 states and 1282 transitions. [2024-11-19 07:06:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,666 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-19 07:06:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,669 INFO L225 Difference]: With dead ends: 709 [2024-11-19 07:06:02,669 INFO L226 Difference]: Without dead ends: 709 [2024-11-19 07:06:02,671 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-19 07:06:02,671 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 184 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-19 07:06:02,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-19 07:06:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 514. [2024-11-19 07:06:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 1.7777777777777777) internal successors, (912), 513 states have internal predecessors, (912), 0 states have call successors, (0), 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-19 07:06:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 912 transitions. [2024-11-19 07:06:02,686 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 912 transitions. Word has length 26 [2024-11-19 07:06:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,686 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 912 transitions. [2024-11-19 07:06:02,686 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-19 07:06:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 912 transitions. [2024-11-19 07:06:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:06:02,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,687 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-19 07:06:02,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:06:02,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1132527020, now seen corresponding path program 1 times [2024-11-19 07:06:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094789359] [2024-11-19 07:06:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,729 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-19 07:06:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094789359] [2024-11-19 07:06:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094789359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175880072] [2024-11-19 07:06:02,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,730 INFO L87 Difference]: Start difference. First operand 514 states and 912 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-19 07:06:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,750 INFO L93 Difference]: Finished difference Result 733 states and 1294 transitions. [2024-11-19 07:06:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,751 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-19 07:06:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,753 INFO L225 Difference]: With dead ends: 733 [2024-11-19 07:06:02,754 INFO L226 Difference]: Without dead ends: 733 [2024-11-19 07:06:02,754 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-19 07:06:02,758 INFO L432 NwaCegarLoop]: 131 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, 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-19 07:06:02,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-19 07:06:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2024-11-19 07:06:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.7722908093278464) internal successors, (1292), 729 states have internal predecessors, (1292), 0 states have call successors, (0), 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-19 07:06:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1292 transitions. [2024-11-19 07:06:02,793 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1292 transitions. Word has length 26 [2024-11-19 07:06:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,793 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1292 transitions. [2024-11-19 07:06:02,794 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-19 07:06:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1292 transitions. [2024-11-19 07:06:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:06:02,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06: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] [2024-11-19 07:06:02,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:06:02,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1572834643, now seen corresponding path program 1 times [2024-11-19 07:06:02,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989883433] [2024-11-19 07:06:02,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,890 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-19 07:06:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989883433] [2024-11-19 07:06:02,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989883433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102726114] [2024-11-19 07:06:02,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,894 INFO L87 Difference]: Start difference. First operand 730 states and 1292 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-19 07:06:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,912 INFO L93 Difference]: Finished difference Result 745 states and 1302 transitions. [2024-11-19 07:06:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:02,913 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-19 07:06:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:02,916 INFO L225 Difference]: With dead ends: 745 [2024-11-19 07:06:02,917 INFO L226 Difference]: Without dead ends: 745 [2024-11-19 07:06:02,918 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-19 07:06:02,920 INFO L432 NwaCegarLoop]: 145 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, 231 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-19 07:06:02,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-19 07:06:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 742. [2024-11-19 07:06:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 0 states have call successors, (0), 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-19 07:06:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1300 transitions. [2024-11-19 07:06:02,938 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1300 transitions. Word has length 27 [2024-11-19 07:06:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,938 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1300 transitions. [2024-11-19 07:06:02,938 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-19 07:06:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1300 transitions. [2024-11-19 07:06:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:06:02,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,940 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-19 07:06:02,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:06:02,940 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,941 INFO L85 PathProgramCache]: Analyzing trace with hash 755186193, now seen corresponding path program 1 times [2024-11-19 07:06:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529744799] [2024-11-19 07:06:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,978 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-19 07:06:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529744799] [2024-11-19 07:06:02,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529744799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177394014] [2024-11-19 07:06:02,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,980 INFO L87 Difference]: Start difference. First operand 742 states and 1300 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-19 07:06:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:02,998 INFO L93 Difference]: Finished difference Result 1385 states and 2446 transitions. [2024-11-19 07:06:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,000 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-19 07:06:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,006 INFO L225 Difference]: With dead ends: 1385 [2024-11-19 07:06:03,006 INFO L226 Difference]: Without dead ends: 1385 [2024-11-19 07:06:03,007 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-19 07:06:03,007 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 182 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-19 07:06:03,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-19 07:06:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1030. [2024-11-19 07:06:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 0 states have call successors, (0), 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-19 07:06:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1772 transitions. [2024-11-19 07:06:03,037 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1772 transitions. Word has length 27 [2024-11-19 07:06:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:03,039 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1772 transitions. [2024-11-19 07:06:03,039 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-19 07:06:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1772 transitions. [2024-11-19 07:06:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:06:03,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06: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] [2024-11-19 07:06:03,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:06:03,042 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash -933757549, now seen corresponding path program 1 times [2024-11-19 07:06:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:03,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818222273] [2024-11-19 07:06:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:03,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:03,072 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-19 07:06:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818222273] [2024-11-19 07:06:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818222273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145473311] [2024-11-19 07:06:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:03,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:03,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:03,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:03,074 INFO L87 Difference]: Start difference. First operand 1030 states and 1772 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-19 07:06:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:03,095 INFO L93 Difference]: Finished difference Result 1449 states and 2486 transitions. [2024-11-19 07:06:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,095 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-19 07:06:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,101 INFO L225 Difference]: With dead ends: 1449 [2024-11-19 07:06:03,101 INFO L226 Difference]: Without dead ends: 1449 [2024-11-19 07:06:03,102 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-19 07:06:03,103 INFO L432 NwaCegarLoop]: 133 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, 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-19 07:06:03,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-11-19 07:06:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1446. [2024-11-19 07:06:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 0 states have call successors, (0), 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-19 07:06:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2484 transitions. [2024-11-19 07:06:03,133 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2484 transitions. Word has length 27 [2024-11-19 07:06:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 2484 transitions. [2024-11-19 07:06:03,134 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-19 07:06:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2484 transitions. [2024-11-19 07:06:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:06:03,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:03,136 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-19 07:06:03,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 07:06:03,136 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:03,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1942533015, now seen corresponding path program 1 times [2024-11-19 07:06:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:03,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399436330] [2024-11-19 07:06:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:03,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:03,167 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-19 07:06:03,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:03,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399436330] [2024-11-19 07:06:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399436330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:03,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:03,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:03,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561939230] [2024-11-19 07:06:03,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:03,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:03,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:03,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:03,171 INFO L87 Difference]: Start difference. First operand 1446 states and 2484 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-19 07:06:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:03,196 INFO L93 Difference]: Finished difference Result 1465 states and 2486 transitions. [2024-11-19 07:06:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,197 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-19 07:06:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,202 INFO L225 Difference]: With dead ends: 1465 [2024-11-19 07:06:03,202 INFO L226 Difference]: Without dead ends: 1465 [2024-11-19 07:06:03,202 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-19 07:06:03,203 INFO L432 NwaCegarLoop]: 142 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, 227 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-19 07:06:03,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2024-11-19 07:06:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1462. [2024-11-19 07:06:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 0 states have call successors, (0), 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-19 07:06:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2484 transitions. [2024-11-19 07:06:03,235 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2484 transitions. Word has length 28 [2024-11-19 07:06:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:03,235 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 2484 transitions. [2024-11-19 07:06:03,235 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-19 07:06:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2484 transitions. [2024-11-19 07:06:03,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:06:03,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:03,238 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-19 07:06:03,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:06:03,238 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:03,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1124884565, now seen corresponding path program 1 times [2024-11-19 07:06:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:03,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126257537] [2024-11-19 07:06:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:03,272 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-19 07:06:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:03,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126257537] [2024-11-19 07:06:03,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126257537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:03,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400652267] [2024-11-19 07:06:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:03,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:03,274 INFO L87 Difference]: Start difference. First operand 1462 states and 2484 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-19 07:06:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:03,296 INFO L93 Difference]: Finished difference Result 2697 states and 4630 transitions. [2024-11-19 07:06:03,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,297 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-19 07:06:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,305 INFO L225 Difference]: With dead ends: 2697 [2024-11-19 07:06:03,305 INFO L226 Difference]: Without dead ends: 2697 [2024-11-19 07:06:03,306 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-19 07:06:03,306 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 59 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 180 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-19 07:06:03,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2024-11-19 07:06:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2054. [2024-11-19 07:06:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 0 states have call successors, (0), 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-19 07:06:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 3412 transitions. [2024-11-19 07:06:03,386 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 3412 transitions. Word has length 28 [2024-11-19 07:06:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:03,386 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 3412 transitions. [2024-11-19 07:06:03,386 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-19 07:06:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 3412 transitions. [2024-11-19 07:06:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:06:03,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:03,389 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-19 07:06:03,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 07:06:03,389 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:03,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash -564059177, now seen corresponding path program 1 times [2024-11-19 07:06:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377587954] [2024-11-19 07:06:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:03,419 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-19 07:06:03,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377587954] [2024-11-19 07:06:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377587954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:03,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779623431] [2024-11-19 07:06:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:03,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:03,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:03,421 INFO L87 Difference]: Start difference. First operand 2054 states and 3412 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-19 07:06:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:03,447 INFO L93 Difference]: Finished difference Result 2857 states and 4742 transitions. [2024-11-19 07:06:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,447 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-19 07:06:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,457 INFO L225 Difference]: With dead ends: 2857 [2024-11-19 07:06:03,457 INFO L226 Difference]: Without dead ends: 2857 [2024-11-19 07:06:03,457 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-19 07:06:03,458 INFO L432 NwaCegarLoop]: 135 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, 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-19 07:06:03,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2024-11-19 07:06:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2854. [2024-11-19 07:06:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 0 states have call successors, (0), 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-19 07:06:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4740 transitions. [2024-11-19 07:06:03,512 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4740 transitions. Word has length 28 [2024-11-19 07:06:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:03,512 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 4740 transitions. [2024-11-19 07:06:03,512 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-19 07:06:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4740 transitions. [2024-11-19 07:06:03,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:06:03,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:03,515 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-19 07:06:03,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:06:03,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash 518291230, now seen corresponding path program 1 times [2024-11-19 07:06:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:03,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013732036] [2024-11-19 07:06:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:03,545 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-19 07:06:03,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:03,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013732036] [2024-11-19 07:06:03,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013732036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:03,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:03,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:03,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69485531] [2024-11-19 07:06:03,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:03,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:03,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:03,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:03,547 INFO L87 Difference]: Start difference. First operand 2854 states and 4740 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-19 07:06:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:03,571 INFO L93 Difference]: Finished difference Result 2889 states and 4742 transitions. [2024-11-19 07:06:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,571 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-19 07:06:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,581 INFO L225 Difference]: With dead ends: 2889 [2024-11-19 07:06:03,581 INFO L226 Difference]: Without dead ends: 2889 [2024-11-19 07:06:03,582 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-19 07:06:03,582 INFO L432 NwaCegarLoop]: 139 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, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:03,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2024-11-19 07:06:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2886. [2024-11-19 07:06:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 0 states have call successors, (0), 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-19 07:06:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4740 transitions. [2024-11-19 07:06:03,646 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4740 transitions. Word has length 29 [2024-11-19 07:06:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:03,646 INFO L471 AbstractCegarLoop]: Abstraction has 2886 states and 4740 transitions. [2024-11-19 07:06:03,646 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-19 07:06:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4740 transitions. [2024-11-19 07:06:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:06:03,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:03,649 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-19 07:06:03,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 07:06:03,650 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:03,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash -299357220, now seen corresponding path program 1 times [2024-11-19 07:06:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:03,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377788869] [2024-11-19 07:06:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:03,682 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-19 07:06:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377788869] [2024-11-19 07:06:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377788869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815438687] [2024-11-19 07:06:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:03,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:03,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:03,684 INFO L87 Difference]: Start difference. First operand 2886 states and 4740 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-19 07:06:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:03,720 INFO L93 Difference]: Finished difference Result 5257 states and 8742 transitions. [2024-11-19 07:06:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,720 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-19 07:06:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,739 INFO L225 Difference]: With dead ends: 5257 [2024-11-19 07:06:03,739 INFO L226 Difference]: Without dead ends: 5257 [2024-11-19 07:06:03,739 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-19 07:06:03,740 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 56 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 178 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-19 07:06:03,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2024-11-19 07:06:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 4102. [2024-11-19 07:06:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 0 states have call successors, (0), 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-19 07:06:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 6564 transitions. [2024-11-19 07:06:03,865 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 6564 transitions. Word has length 29 [2024-11-19 07:06:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:03,865 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 6564 transitions. [2024-11-19 07:06:03,865 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-19 07:06:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 6564 transitions. [2024-11-19 07:06:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:06:03,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:03,873 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-19 07:06:03,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 07:06:03,873 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:03,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1988300962, now seen corresponding path program 1 times [2024-11-19 07:06:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:03,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438964729] [2024-11-19 07:06:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:03,904 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-19 07:06:03,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438964729] [2024-11-19 07:06:03,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438964729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:03,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:03,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:03,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301049564] [2024-11-19 07:06:03,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:03,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:03,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:03,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:03,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:03,909 INFO L87 Difference]: Start difference. First operand 4102 states and 6564 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-19 07:06:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:03,942 INFO L93 Difference]: Finished difference Result 5641 states and 9030 transitions. [2024-11-19 07:06:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,943 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-19 07:06:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,974 INFO L225 Difference]: With dead ends: 5641 [2024-11-19 07:06:03,975 INFO L226 Difference]: Without dead ends: 5641 [2024-11-19 07:06:03,975 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-19 07:06:03,975 INFO L432 NwaCegarLoop]: 137 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, 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-19 07:06:03,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2024-11-19 07:06:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5638. [2024-11-19 07:06:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 0 states have call successors, (0), 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-19 07:06:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 9028 transitions. [2024-11-19 07:06:04,096 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 9028 transitions. Word has length 29 [2024-11-19 07:06:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:04,096 INFO L471 AbstractCegarLoop]: Abstraction has 5638 states and 9028 transitions. [2024-11-19 07:06:04,097 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-19 07:06:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 9028 transitions. [2024-11-19 07:06:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:06:04,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:04,102 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-19 07:06:04,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 07:06:04,102 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:04,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash -683520574, now seen corresponding path program 1 times [2024-11-19 07:06:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:04,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810125720] [2024-11-19 07:06:04,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:04,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:04,140 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-19 07:06:04,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810125720] [2024-11-19 07:06:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810125720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082511996] [2024-11-19 07:06:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:04,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:04,142 INFO L87 Difference]: Start difference. First operand 5638 states and 9028 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-19 07:06:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:04,173 INFO L93 Difference]: Finished difference Result 5705 states and 9030 transitions. [2024-11-19 07:06:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:04,175 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-19 07:06:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:04,185 INFO L225 Difference]: With dead ends: 5705 [2024-11-19 07:06:04,185 INFO L226 Difference]: Without dead ends: 5705 [2024-11-19 07:06:04,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-19 07:06:04,186 INFO L432 NwaCegarLoop]: 136 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, 219 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:04,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 219 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2024-11-19 07:06:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 5702. [2024-11-19 07:06:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5702 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 0 states have call successors, (0), 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-19 07:06:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 9028 transitions. [2024-11-19 07:06:04,362 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 9028 transitions. Word has length 30 [2024-11-19 07:06:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:04,362 INFO L471 AbstractCegarLoop]: Abstraction has 5702 states and 9028 transitions. [2024-11-19 07:06:04,363 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-19 07:06:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 9028 transitions. [2024-11-19 07:06:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:06:04,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:04,369 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-19 07:06:04,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 07:06:04,370 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:04,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1501169024, now seen corresponding path program 1 times [2024-11-19 07:06:04,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:04,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394929926] [2024-11-19 07:06:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:04,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:04,411 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-19 07:06:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394929926] [2024-11-19 07:06:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394929926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:04,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:04,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282994232] [2024-11-19 07:06:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:04,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:04,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:04,415 INFO L87 Difference]: Start difference. First operand 5702 states and 9028 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-19 07:06:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:04,458 INFO L93 Difference]: Finished difference Result 10249 states and 16454 transitions. [2024-11-19 07:06:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:04,458 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-19 07:06:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:04,479 INFO L225 Difference]: With dead ends: 10249 [2024-11-19 07:06:04,479 INFO L226 Difference]: Without dead ends: 10249 [2024-11-19 07:06:04,479 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-19 07:06:04,480 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:04,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10249 states. [2024-11-19 07:06:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10249 to 8198. [2024-11-19 07:06:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8198 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 0 states have call successors, (0), 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-19 07:06:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8198 states to 8198 states and 12612 transitions. [2024-11-19 07:06:04,696 INFO L78 Accepts]: Start accepts. Automaton has 8198 states and 12612 transitions. Word has length 30 [2024-11-19 07:06:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:04,696 INFO L471 AbstractCegarLoop]: Abstraction has 8198 states and 12612 transitions. [2024-11-19 07:06:04,697 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-19 07:06:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 8198 states and 12612 transitions. [2024-11-19 07:06:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:06:04,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:04,707 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-19 07:06:04,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 07:06:04,707 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:04,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1104854530, now seen corresponding path program 1 times [2024-11-19 07:06:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459091788] [2024-11-19 07:06:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:04,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-19 07:06:04,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:04,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459091788] [2024-11-19 07:06:04,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459091788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:04,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:04,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:04,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175767116] [2024-11-19 07:06:04,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:04,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:04,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:04,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:04,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:04,734 INFO L87 Difference]: Start difference. First operand 8198 states and 12612 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-19 07:06:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:04,788 INFO L93 Difference]: Finished difference Result 11145 states and 17158 transitions. [2024-11-19 07:06:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:04,788 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-19 07:06:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:04,810 INFO L225 Difference]: With dead ends: 11145 [2024-11-19 07:06:04,810 INFO L226 Difference]: Without dead ends: 11145 [2024-11-19 07:06:04,811 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-19 07:06:04,811 INFO L432 NwaCegarLoop]: 139 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, 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-19 07:06:04,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11145 states. [2024-11-19 07:06:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11145 to 11142. [2024-11-19 07:06:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11142 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 0 states have call successors, (0), 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-19 07:06:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11142 states to 11142 states and 17156 transitions. [2024-11-19 07:06:05,087 INFO L78 Accepts]: Start accepts. Automaton has 11142 states and 17156 transitions. Word has length 30 [2024-11-19 07:06:05,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,087 INFO L471 AbstractCegarLoop]: Abstraction has 11142 states and 17156 transitions. [2024-11-19 07:06:05,087 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-19 07:06:05,087 INFO L276 IsEmpty]: Start isEmpty. Operand 11142 states and 17156 transitions. [2024-11-19 07:06:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:06:05,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,097 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-19 07:06:05,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 07:06:05,097 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,097 INFO L85 PathProgramCache]: Analyzing trace with hash 715029737, now seen corresponding path program 1 times [2024-11-19 07:06:05,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885801421] [2024-11-19 07:06:05,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,125 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-19 07:06:05,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885801421] [2024-11-19 07:06:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885801421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001548627] [2024-11-19 07:06:05,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,126 INFO L87 Difference]: Start difference. First operand 11142 states and 17156 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-19 07:06:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,166 INFO L93 Difference]: Finished difference Result 11273 states and 17158 transitions. [2024-11-19 07:06:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,167 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-19 07:06:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,188 INFO L225 Difference]: With dead ends: 11273 [2024-11-19 07:06:05,188 INFO L226 Difference]: Without dead ends: 11273 [2024-11-19 07:06:05,188 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-19 07:06:05,189 INFO L432 NwaCegarLoop]: 133 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, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2024-11-19 07:06:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 11270. [2024-11-19 07:06:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11270 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 0 states have call successors, (0), 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-19 07:06:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 17156 transitions. [2024-11-19 07:06:05,396 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 17156 transitions. Word has length 31 [2024-11-19 07:06:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,396 INFO L471 AbstractCegarLoop]: Abstraction has 11270 states and 17156 transitions. [2024-11-19 07:06:05,397 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-19 07:06:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 17156 transitions. [2024-11-19 07:06:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:06:05,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,410 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-19 07:06:05,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 07:06:05,411 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -102618713, now seen corresponding path program 1 times [2024-11-19 07:06:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618308319] [2024-11-19 07:06:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,455 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-19 07:06:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618308319] [2024-11-19 07:06:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618308319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39509096] [2024-11-19 07:06:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,456 INFO L87 Difference]: Start difference. First operand 11270 states and 17156 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-19 07:06:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,512 INFO L93 Difference]: Finished difference Result 19977 states and 30854 transitions. [2024-11-19 07:06:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,512 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-19 07:06:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,553 INFO L225 Difference]: With dead ends: 19977 [2024-11-19 07:06:05,553 INFO L226 Difference]: Without dead ends: 19977 [2024-11-19 07:06:05,553 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-19 07:06:05,554 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 50 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19977 states. [2024-11-19 07:06:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19977 to 16390. [2024-11-19 07:06:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16390 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 0 states have call successors, (0), 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-19 07:06:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16390 states to 16390 states and 24196 transitions. [2024-11-19 07:06:06,039 INFO L78 Accepts]: Start accepts. Automaton has 16390 states and 24196 transitions. Word has length 31 [2024-11-19 07:06:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:06,039 INFO L471 AbstractCegarLoop]: Abstraction has 16390 states and 24196 transitions. [2024-11-19 07:06:06,039 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-19 07:06:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 16390 states and 24196 transitions. [2024-11-19 07:06:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:06:06,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:06,054 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-19 07:06:06,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 07:06:06,055 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:06,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1791562455, now seen corresponding path program 1 times [2024-11-19 07:06:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628009504] [2024-11-19 07:06:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:06,088 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-19 07:06:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:06,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628009504] [2024-11-19 07:06:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628009504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:06,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553661947] [2024-11-19 07:06:06,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:06,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:06,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:06,091 INFO L87 Difference]: Start difference. First operand 16390 states and 24196 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-19 07:06:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:06,155 INFO L93 Difference]: Finished difference Result 22025 states and 32518 transitions. [2024-11-19 07:06:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:06,156 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-19 07:06:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:06,209 INFO L225 Difference]: With dead ends: 22025 [2024-11-19 07:06:06,210 INFO L226 Difference]: Without dead ends: 22025 [2024-11-19 07:06:06,210 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-19 07:06:06,211 INFO L432 NwaCegarLoop]: 141 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, 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-19 07:06:06,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:06,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22025 states. [2024-11-19 07:06:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22025 to 22022. [2024-11-19 07:06:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22022 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 0 states have call successors, (0), 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-19 07:06:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22022 states to 22022 states and 32516 transitions. [2024-11-19 07:06:06,612 INFO L78 Accepts]: Start accepts. Automaton has 22022 states and 32516 transitions. Word has length 31 [2024-11-19 07:06:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:06,612 INFO L471 AbstractCegarLoop]: Abstraction has 22022 states and 32516 transitions. [2024-11-19 07:06:06,612 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-19 07:06:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22022 states and 32516 transitions. [2024-11-19 07:06:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 07:06:06,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:06,629 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-19 07:06:06,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 07:06:06,630 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:06,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:06,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1120426989, now seen corresponding path program 1 times [2024-11-19 07:06:06,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:06,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606517762] [2024-11-19 07:06:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:06,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:06,657 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-19 07:06:06,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:06,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606517762] [2024-11-19 07:06:06,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606517762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:06,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:06,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505758739] [2024-11-19 07:06:06,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:06,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:06,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:06,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:06,660 INFO L87 Difference]: Start difference. First operand 22022 states and 32516 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-19 07:06:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:06,864 INFO L93 Difference]: Finished difference Result 22281 states and 32518 transitions. [2024-11-19 07:06:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:06,864 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-19 07:06:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:06,899 INFO L225 Difference]: With dead ends: 22281 [2024-11-19 07:06:06,899 INFO L226 Difference]: Without dead ends: 22281 [2024-11-19 07:06:06,900 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-19 07:06:06,900 INFO L432 NwaCegarLoop]: 130 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, 211 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:06,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22281 states. [2024-11-19 07:06:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22281 to 22278. [2024-11-19 07:06:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22278 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 0 states have call successors, (0), 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-19 07:06:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22278 states to 22278 states and 32516 transitions. [2024-11-19 07:06:07,253 INFO L78 Accepts]: Start accepts. Automaton has 22278 states and 32516 transitions. Word has length 32 [2024-11-19 07:06:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:07,253 INFO L471 AbstractCegarLoop]: Abstraction has 22278 states and 32516 transitions. [2024-11-19 07:06:07,253 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-19 07:06:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 22278 states and 32516 transitions. [2024-11-19 07:06:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 07:06:07,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:07,277 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-19 07:06:07,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 07:06:07,277 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 302778539, now seen corresponding path program 1 times [2024-11-19 07:06:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107209475] [2024-11-19 07:06:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:07,310 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-19 07:06:07,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107209475] [2024-11-19 07:06:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107209475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:07,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230105536] [2024-11-19 07:06:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:07,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:07,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:07,313 INFO L87 Difference]: Start difference. First operand 22278 states and 32516 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-19 07:06:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:07,439 INFO L93 Difference]: Finished difference Result 38921 states and 57606 transitions. [2024-11-19 07:06:07,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:07,440 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-19 07:06:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:07,517 INFO L225 Difference]: With dead ends: 38921 [2024-11-19 07:06:07,518 INFO L226 Difference]: Without dead ends: 38921 [2024-11-19 07:06:07,519 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-19 07:06:07,519 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:07,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38921 states. [2024-11-19 07:06:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38921 to 32774. [2024-11-19 07:06:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32774 states, 32773 states have (on average 1.4139688157934884) internal successors, (46340), 32773 states have internal predecessors, (46340), 0 states have call successors, (0), 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-19 07:06:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32774 states to 32774 states and 46340 transitions. [2024-11-19 07:06:08,326 INFO L78 Accepts]: Start accepts. Automaton has 32774 states and 46340 transitions. Word has length 32 [2024-11-19 07:06:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:08,327 INFO L471 AbstractCegarLoop]: Abstraction has 32774 states and 46340 transitions. [2024-11-19 07:06:08,327 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-19 07:06:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 32774 states and 46340 transitions. [2024-11-19 07:06:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 07:06:08,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:08,390 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-19 07:06:08,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 07:06:08,391 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:08,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1386165203, now seen corresponding path program 1 times [2024-11-19 07:06:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433035127] [2024-11-19 07:06:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:08,418 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-19 07:06:08,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:08,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433035127] [2024-11-19 07:06:08,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433035127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:08,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:08,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:08,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020630989] [2024-11-19 07:06:08,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:08,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:08,420 INFO L87 Difference]: Start difference. First operand 32774 states and 46340 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-19 07:06:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:08,642 INFO L93 Difference]: Finished difference Result 43529 states and 61446 transitions. [2024-11-19 07:06:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:08,643 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-19 07:06:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:08,709 INFO L225 Difference]: With dead ends: 43529 [2024-11-19 07:06:08,710 INFO L226 Difference]: Without dead ends: 43529 [2024-11-19 07:06:08,710 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-19 07:06:08,711 INFO L432 NwaCegarLoop]: 143 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, 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-19 07:06:08,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43529 states. [2024-11-19 07:06:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43529 to 43526. [2024-11-19 07:06:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43526 states, 43525 states have (on average 1.411694428489374) internal successors, (61444), 43525 states have internal predecessors, (61444), 0 states have call successors, (0), 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-19 07:06:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43526 states to 43526 states and 61444 transitions. [2024-11-19 07:06:09,560 INFO L78 Accepts]: Start accepts. Automaton has 43526 states and 61444 transitions. Word has length 32 [2024-11-19 07:06:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:09,561 INFO L471 AbstractCegarLoop]: Abstraction has 43526 states and 61444 transitions. [2024-11-19 07:06:09,561 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-19 07:06:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 43526 states and 61444 transitions. [2024-11-19 07:06:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:06:09,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:09,580 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-19 07:06:09,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 07:06:09,580 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:09,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 802850484, now seen corresponding path program 1 times [2024-11-19 07:06:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38161525] [2024-11-19 07:06:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:09,604 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-19 07:06:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38161525] [2024-11-19 07:06:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38161525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:09,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080371710] [2024-11-19 07:06:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:09,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:09,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:09,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:09,607 INFO L87 Difference]: Start difference. First operand 43526 states and 61444 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-19 07:06:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:09,728 INFO L93 Difference]: Finished difference Result 44041 states and 61446 transitions. [2024-11-19 07:06:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:09,729 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-19 07:06:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:09,786 INFO L225 Difference]: With dead ends: 44041 [2024-11-19 07:06:09,787 INFO L226 Difference]: Without dead ends: 44041 [2024-11-19 07:06:09,787 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-19 07:06:09,788 INFO L432 NwaCegarLoop]: 127 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, 207 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:09,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44041 states. [2024-11-19 07:06:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44041 to 44038. [2024-11-19 07:06:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44038 states, 44037 states have (on average 1.395281240774803) internal successors, (61444), 44037 states have internal predecessors, (61444), 0 states have call successors, (0), 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-19 07:06:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44038 states to 44038 states and 61444 transitions. [2024-11-19 07:06:10,637 INFO L78 Accepts]: Start accepts. Automaton has 44038 states and 61444 transitions. Word has length 33 [2024-11-19 07:06:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:10,638 INFO L471 AbstractCegarLoop]: Abstraction has 44038 states and 61444 transitions. [2024-11-19 07:06:10,638 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-19 07:06:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 44038 states and 61444 transitions. [2024-11-19 07:06:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:06:10,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:10,678 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-19 07:06:10,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 07:06:10,678 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -14797966, now seen corresponding path program 1 times [2024-11-19 07:06:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420481204] [2024-11-19 07:06:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:10,704 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-19 07:06:10,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:10,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420481204] [2024-11-19 07:06:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420481204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:10,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:10,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429479728] [2024-11-19 07:06:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:10,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:10,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:10,707 INFO L87 Difference]: Start difference. First operand 44038 states and 61444 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-19 07:06:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:10,966 INFO L93 Difference]: Finished difference Result 86025 states and 116742 transitions. [2024-11-19 07:06:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:10,966 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-19 07:06:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:11,105 INFO L225 Difference]: With dead ends: 86025 [2024-11-19 07:06:11,105 INFO L226 Difference]: Without dead ends: 86025 [2024-11-19 07:06:11,106 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-19 07:06:11,106 INFO L432 NwaCegarLoop]: 109 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, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:11,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86025 states. [2024-11-19 07:06:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86025 to 86022. [2024-11-19 07:06:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86022 states, 86021 states have (on average 1.357110473024029) internal successors, (116740), 86021 states have internal predecessors, (116740), 0 states have call successors, (0), 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-19 07:06:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86022 states to 86022 states and 116740 transitions. [2024-11-19 07:06:12,577 INFO L78 Accepts]: Start accepts. Automaton has 86022 states and 116740 transitions. Word has length 33 [2024-11-19 07:06:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:12,578 INFO L471 AbstractCegarLoop]: Abstraction has 86022 states and 116740 transitions. [2024-11-19 07:06:12,578 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-19 07:06:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 86022 states and 116740 transitions. [2024-11-19 07:06:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:06:12,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:12,611 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-19 07:06:12,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 07:06:12,611 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:12,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1674145776, now seen corresponding path program 1 times [2024-11-19 07:06:12,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:12,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746395013] [2024-11-19 07:06:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:12,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:12,646 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-19 07:06:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746395013] [2024-11-19 07:06:12,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746395013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198233141] [2024-11-19 07:06:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:12,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:12,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:12,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:12,648 INFO L87 Difference]: Start difference. First operand 86022 states and 116740 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-19 07:06:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:12,857 INFO L93 Difference]: Finished difference Result 96265 states and 134150 transitions. [2024-11-19 07:06:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:12,857 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-19 07:06:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:12,971 INFO L225 Difference]: With dead ends: 96265 [2024-11-19 07:06:12,971 INFO L226 Difference]: Without dead ends: 96265 [2024-11-19 07:06:12,971 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-19 07:06:12,972 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 44 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:12,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 223 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96265 states. [2024-11-19 07:06:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96265 to 86022. [2024-11-19 07:06:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86022 states, 86021 states have (on average 1.345206403087618) internal successors, (115716), 86021 states have internal predecessors, (115716), 0 states have call successors, (0), 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-19 07:06:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86022 states to 86022 states and 115716 transitions. [2024-11-19 07:06:14,690 INFO L78 Accepts]: Start accepts. Automaton has 86022 states and 115716 transitions. Word has length 33 [2024-11-19 07:06:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:14,691 INFO L471 AbstractCegarLoop]: Abstraction has 86022 states and 115716 transitions. [2024-11-19 07:06:14,691 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-19 07:06:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 86022 states and 115716 transitions. [2024-11-19 07:06:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:06:14,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:14,740 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-19 07:06:14,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 07:06:14,741 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash -452076008, now seen corresponding path program 1 times [2024-11-19 07:06:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823613329] [2024-11-19 07:06:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:14,766 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-19 07:06:14,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:14,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823613329] [2024-11-19 07:06:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823613329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:14,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279877357] [2024-11-19 07:06:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:14,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:14,769 INFO L87 Difference]: Start difference. First operand 86022 states and 115716 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-19 07:06:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:15,196 INFO L93 Difference]: Finished difference Result 146441 states and 198662 transitions. [2024-11-19 07:06:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:15,197 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-19 07:06:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:15,388 INFO L225 Difference]: With dead ends: 146441 [2024-11-19 07:06:15,388 INFO L226 Difference]: Without dead ends: 146441 [2024-11-19 07:06:15,388 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-19 07:06:15,389 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 41 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:15,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146441 states. [2024-11-19 07:06:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146441 to 130054. [2024-11-19 07:06:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130054 states, 130053 states have (on average 1.3070671187900318) internal successors, (169988), 130053 states have internal predecessors, (169988), 0 states have call successors, (0), 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-19 07:06:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130054 states to 130054 states and 169988 transitions. [2024-11-19 07:06:17,484 INFO L78 Accepts]: Start accepts. Automaton has 130054 states and 169988 transitions. Word has length 34 [2024-11-19 07:06:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:17,485 INFO L471 AbstractCegarLoop]: Abstraction has 130054 states and 169988 transitions. [2024-11-19 07:06:17,485 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-19 07:06:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 130054 states and 169988 transitions. [2024-11-19 07:06:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:06:17,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:17,542 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-19 07:06:17,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 07:06:17,543 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:17,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2141019750, now seen corresponding path program 1 times [2024-11-19 07:06:17,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:17,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116457711] [2024-11-19 07:06:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:17,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:17,565 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-19 07:06:17,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116457711] [2024-11-19 07:06:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116457711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:17,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:17,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795301848] [2024-11-19 07:06:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:17,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:17,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:17,567 INFO L87 Difference]: Start difference. First operand 130054 states and 169988 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-19 07:06:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:18,513 INFO L93 Difference]: Finished difference Result 168969 states and 219142 transitions. [2024-11-19 07:06:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:18,514 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-19 07:06:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:18,721 INFO L225 Difference]: With dead ends: 168969 [2024-11-19 07:06:18,721 INFO L226 Difference]: Without dead ends: 168969 [2024-11-19 07:06:18,722 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-19 07:06:18,722 INFO L432 NwaCegarLoop]: 147 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, 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-19 07:06:18,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 226 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168969 states. [2024-11-19 07:06:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168969 to 168966. [2024-11-19 07:06:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168966 states, 168965 states have (on average 1.296954990678543) internal successors, (219140), 168965 states have internal predecessors, (219140), 0 states have call successors, (0), 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-19 07:06:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168966 states to 168966 states and 219140 transitions. [2024-11-19 07:06:21,292 INFO L78 Accepts]: Start accepts. Automaton has 168966 states and 219140 transitions. Word has length 34 [2024-11-19 07:06:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:21,292 INFO L471 AbstractCegarLoop]: Abstraction has 168966 states and 219140 transitions. [2024-11-19 07:06:21,292 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-19 07:06:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 168966 states and 219140 transitions. [2024-11-19 07:06:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 07:06:21,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:21,359 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-19 07:06:21,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 07:06:21,360 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:21,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1122782851, now seen corresponding path program 1 times [2024-11-19 07:06:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550722807] [2024-11-19 07:06:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:21,380 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-19 07:06:21,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:21,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550722807] [2024-11-19 07:06:21,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550722807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:21,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:21,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:21,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867681493] [2024-11-19 07:06:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:21,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:21,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:21,382 INFO L87 Difference]: Start difference. First operand 168966 states and 219140 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-19 07:06:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:21,708 INFO L93 Difference]: Finished difference Result 172041 states and 221190 transitions. [2024-11-19 07:06:21,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:21,709 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-19 07:06:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:22,680 INFO L225 Difference]: With dead ends: 172041 [2024-11-19 07:06:22,680 INFO L226 Difference]: Without dead ends: 172041 [2024-11-19 07:06:22,680 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-19 07:06:22,681 INFO L432 NwaCegarLoop]: 121 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, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:22,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172041 states. [2024-11-19 07:06:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172041 to 172038. [2024-11-19 07:06:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172038 states, 172037 states have (on average 1.2857001691496597) internal successors, (221188), 172037 states have internal predecessors, (221188), 0 states have call successors, (0), 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-19 07:06:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172038 states to 172038 states and 221188 transitions. [2024-11-19 07:06:25,185 INFO L78 Accepts]: Start accepts. Automaton has 172038 states and 221188 transitions. Word has length 35 [2024-11-19 07:06:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:25,186 INFO L471 AbstractCegarLoop]: Abstraction has 172038 states and 221188 transitions. [2024-11-19 07:06:25,186 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-19 07:06:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 172038 states and 221188 transitions. [2024-11-19 07:06:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 07:06:25,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:25,295 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-19 07:06:25,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 07:06:25,295 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:25,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1940431301, now seen corresponding path program 1 times [2024-11-19 07:06:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022566948] [2024-11-19 07:06:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:25,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:25,320 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-19 07:06:25,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:25,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022566948] [2024-11-19 07:06:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022566948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:25,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:25,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951735606] [2024-11-19 07:06:25,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:25,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:25,322 INFO L87 Difference]: Start difference. First operand 172038 states and 221188 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-19 07:06:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:26,057 INFO L93 Difference]: Finished difference Result 286729 states and 368646 transitions. [2024-11-19 07:06:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:26,058 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-19 07:06:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:26,451 INFO L225 Difference]: With dead ends: 286729 [2024-11-19 07:06:26,451 INFO L226 Difference]: Without dead ends: 286729 [2024-11-19 07:06:26,451 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-19 07:06:26,452 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:26,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286729 states. [2024-11-19 07:06:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286729 to 262150. [2024-11-19 07:06:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262150 states, 262149 states have (on average 1.2499914170948583) internal successors, (327684), 262149 states have internal predecessors, (327684), 0 states have call successors, (0), 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-19 07:06:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262150 states to 262150 states and 327684 transitions. [2024-11-19 07:06:30,397 INFO L78 Accepts]: Start accepts. Automaton has 262150 states and 327684 transitions. Word has length 35 [2024-11-19 07:06:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:30,398 INFO L471 AbstractCegarLoop]: Abstraction has 262150 states and 327684 transitions. [2024-11-19 07:06:30,398 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-19 07:06:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 262150 states and 327684 transitions. [2024-11-19 07:06:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 07:06:30,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:30,564 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-19 07:06:30,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 07:06:30,564 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:30,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash 665592253, now seen corresponding path program 1 times [2024-11-19 07:06:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935696750] [2024-11-19 07:06:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:30,588 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-19 07:06:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935696750] [2024-11-19 07:06:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935696750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:30,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:30,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647517977] [2024-11-19 07:06:30,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:30,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:30,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:30,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:30,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:30,590 INFO L87 Difference]: Start difference. First operand 262150 states and 327684 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-19 07:06:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:32,779 INFO L93 Difference]: Finished difference Result 335881 states and 413702 transitions. [2024-11-19 07:06:32,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:32,780 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-19 07:06:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:33,280 INFO L225 Difference]: With dead ends: 335881 [2024-11-19 07:06:33,280 INFO L226 Difference]: Without dead ends: 335881 [2024-11-19 07:06:33,280 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-19 07:06:33,281 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 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-19 07:06:33,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335881 states. [2024-11-19 07:06:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335881 to 335878. [2024-11-19 07:06:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335878 states, 335877 states have (on average 1.2317008905045597) internal successors, (413700), 335877 states have internal predecessors, (413700), 0 states have call successors, (0), 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-19 07:06:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335878 states to 335878 states and 413700 transitions. [2024-11-19 07:06:38,946 INFO L78 Accepts]: Start accepts. Automaton has 335878 states and 413700 transitions. Word has length 35 [2024-11-19 07:06:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:38,946 INFO L471 AbstractCegarLoop]: Abstraction has 335878 states and 413700 transitions. [2024-11-19 07:06:38,947 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-19 07:06:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 335878 states and 413700 transitions. [2024-11-19 07:06:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 07:06:39,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:39,220 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-19 07:06:39,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 07:06:39,221 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:39,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash -17146107, now seen corresponding path program 1 times [2024-11-19 07:06:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:39,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113729342] [2024-11-19 07:06:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:39,246 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-19 07:06:39,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:39,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113729342] [2024-11-19 07:06:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113729342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:39,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:39,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931197862] [2024-11-19 07:06:39,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:39,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:39,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:39,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:39,248 INFO L87 Difference]: Start difference. First operand 335878 states and 413700 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)