./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_10.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_10.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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:05:37,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:05:37,391 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:37,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:05:37,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:05:37,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:05:37,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:05:37,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:05:37,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:05:37,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:05:37,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:05:37,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:05:37,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:05:37,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:05:37,437 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:05:37,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:05:37,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:05:37,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:05:37,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:05:37,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:05:37,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:05:37,439 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:05:37,440 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:05:37,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:05:37,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:05:37,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:05:37,441 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:05:37,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:05:37,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:05:37,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:05:37,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:05:37,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:05:37,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:05:37,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:05:37,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:05:37,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:05:37,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:05:37,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:05:37,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:05:37,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:05:37,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:05:37,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:05:37,445 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2024-11-19 07:05:37,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:05:37,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:05:37,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:05:37,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:05:37,745 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:05:37,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2024-11-19 07:05:39,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:05:39,415 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:05:39,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2024-11-19 07:05:39,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5eec4c83/2eeddfa2abfa4860a5d01433abea6367/FLAG2c41a1b20 [2024-11-19 07:05:39,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5eec4c83/2eeddfa2abfa4860a5d01433abea6367 [2024-11-19 07:05:39,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:05:39,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:05:39,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:05:39,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:05:39,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:05:39,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:05:39" (1/1) ... [2024-11-19 07:05:39,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a3f208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:39, skipping insertion in model container [2024-11-19 07:05:39,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:05:39" (1/1) ... [2024-11-19 07:05:39,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:05:40,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:05:40,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:05:40,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:05:40,094 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:05:40,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40 WrapperNode [2024-11-19 07:05:40,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:05:40,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:05:40,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:05:40,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:05:40,103 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:05:40" (1/1) ... [2024-11-19 07:05:40,109 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:05:40" (1/1) ... [2024-11-19 07:05:40,127 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-19 07:05:40,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:05:40,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:05:40,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:05:40,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:05:40,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,159 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:05:40,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:05:40,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:05:40,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:05:40,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:05:40,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (1/1) ... [2024-11-19 07:05:40,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:05:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:05:40,207 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:05:40,209 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:05:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:05:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:05:40,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:05:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:05:40,304 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:05:40,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:05:40,513 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-19 07:05:40,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:05:40,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:05:40,529 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 07:05:40,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:05:40 BoogieIcfgContainer [2024-11-19 07:05:40,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:05:40,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:05:40,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:05:40,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:05:40,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:05:39" (1/3) ... [2024-11-19 07:05:40,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172da48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:05:40, skipping insertion in model container [2024-11-19 07:05:40,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:40" (2/3) ... [2024-11-19 07:05:40,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172da48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:05:40, skipping insertion in model container [2024-11-19 07:05:40,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:05:40" (3/3) ... [2024-11-19 07:05:40,543 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2024-11-19 07:05:40,559 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:05:40,559 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 07:05:40,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:05:40,602 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;@6eed08a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:05:40,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 07:05:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 40 states have (on average 1.875) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 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:05:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:05:40,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:40,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:05:40,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:40,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash 28703470, now seen corresponding path program 1 times [2024-11-19 07:05:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058293819] [2024-11-19 07:05:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:40,744 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:05:40,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:40,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058293819] [2024-11-19 07:05:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058293819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:40,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:05:40,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970355284] [2024-11-19 07:05:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:40,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 07:05:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:40,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 07:05:40,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 07:05:40,784 INFO L87 Difference]: Start difference. First operand has 43 states, 40 states have (on average 1.875) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 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:05:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:40,795 INFO L93 Difference]: Finished difference Result 42 states and 71 transitions. [2024-11-19 07:05:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 07:05:40,797 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:05:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:40,803 INFO L225 Difference]: With dead ends: 42 [2024-11-19 07:05:40,803 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 07:05:40,805 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:05:40,809 INFO L432 NwaCegarLoop]: 71 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, 71 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:05:40,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 07:05:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 07:05:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 39 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2024-11-19 07:05:40,838 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 69 transitions. Word has length 5 [2024-11-19 07:05:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:40,838 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 69 transitions. [2024-11-19 07:05:40,838 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:05:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 69 transitions. [2024-11-19 07:05:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:05:40,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:40,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:05:40,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:05:40,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash 889697966, now seen corresponding path program 1 times [2024-11-19 07:05:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:40,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754332644] [2024-11-19 07:05:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:40,903 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:05:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754332644] [2024-11-19 07:05:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754332644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:40,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:05:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934763345] [2024-11-19 07:05:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:40,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:40,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:40,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:40,911 INFO L87 Difference]: Start difference. First operand 40 states and 69 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:05:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:40,928 INFO L93 Difference]: Finished difference Result 39 states and 68 transitions. [2024-11-19 07:05:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:40,929 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:05:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:40,930 INFO L225 Difference]: With dead ends: 39 [2024-11-19 07:05:40,944 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 07:05:40,944 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:05:40,948 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 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:05:40,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 07:05:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 07:05:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 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:05:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2024-11-19 07:05:40,957 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 6 [2024-11-19 07:05:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:40,958 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 66 transitions. [2024-11-19 07:05:40,958 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:05:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. [2024-11-19 07:05:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 07:05:40,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:40,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:40,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:05:40,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:40,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 458860360, now seen corresponding path program 1 times [2024-11-19 07:05:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:40,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263319814] [2024-11-19 07:05:40,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,079 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:05:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263319814] [2024-11-19 07:05:41,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263319814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243433817] [2024-11-19 07:05:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,087 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,111 INFO L93 Difference]: Finished difference Result 71 states and 127 transitions. [2024-11-19 07:05:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 07:05:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,112 INFO L225 Difference]: With dead ends: 71 [2024-11-19 07:05:41,113 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 07:05:41,113 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:05:41,114 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 130 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:05:41,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 07:05:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2024-11-19 07:05:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 87 transitions. [2024-11-19 07:05:41,121 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 87 transitions. Word has length 18 [2024-11-19 07:05:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,122 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 87 transitions. [2024-11-19 07:05:41,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2024-11-19 07:05:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 07:05:41,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:41,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:05:41,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash -552256890, now seen corresponding path program 1 times [2024-11-19 07:05:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535077028] [2024-11-19 07:05:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,198 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:05:41,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535077028] [2024-11-19 07:05:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535077028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793567947] [2024-11-19 07:05:41,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,201 INFO L87 Difference]: Start difference. First operand 48 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,234 INFO L93 Difference]: Finished difference Result 71 states and 125 transitions. [2024-11-19 07:05:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 07:05:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,238 INFO L225 Difference]: With dead ends: 71 [2024-11-19 07:05:41,238 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 07:05:41,239 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:05:41,240 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 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:05:41,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 07:05:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-11-19 07:05:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 0 states have call successors, (0), 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:05:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 123 transitions. [2024-11-19 07:05:41,250 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 123 transitions. Word has length 18 [2024-11-19 07:05:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,250 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 123 transitions. [2024-11-19 07:05:41,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 123 transitions. [2024-11-19 07:05:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:05:41,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:41,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:05:41,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1346377270, now seen corresponding path program 1 times [2024-11-19 07:05:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102596552] [2024-11-19 07:05:41,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,313 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:05:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102596552] [2024-11-19 07:05:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102596552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955258847] [2024-11-19 07:05:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,318 INFO L87 Difference]: Start difference. First operand 68 states and 123 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,342 INFO L93 Difference]: Finished difference Result 74 states and 127 transitions. [2024-11-19 07:05:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 07:05:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,344 INFO L225 Difference]: With dead ends: 74 [2024-11-19 07:05:41,344 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 07:05:41,344 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:05:41,345 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 163 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:05:41,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 07:05:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-11-19 07:05:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 0 states have call successors, (0), 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:05:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 125 transitions. [2024-11-19 07:05:41,360 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 125 transitions. Word has length 19 [2024-11-19 07:05:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,361 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 125 transitions. [2024-11-19 07:05:41,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 125 transitions. [2024-11-19 07:05:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:05:41,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:41,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:05:41,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash 66513592, now seen corresponding path program 1 times [2024-11-19 07:05:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399440400] [2024-11-19 07:05:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,440 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:05:41,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399440400] [2024-11-19 07:05:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399440400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161065925] [2024-11-19 07:05:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,446 INFO L87 Difference]: Start difference. First operand 71 states and 125 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,472 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2024-11-19 07:05:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 07:05:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,473 INFO L225 Difference]: With dead ends: 133 [2024-11-19 07:05:41,474 INFO L226 Difference]: Without dead ends: 133 [2024-11-19 07:05:41,474 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:05:41,475 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 46 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 128 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:05:41,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-19 07:05:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2024-11-19 07:05:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 0 states have call successors, (0), 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:05:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2024-11-19 07:05:41,494 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 19 [2024-11-19 07:05:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,494 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2024-11-19 07:05:41,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2024-11-19 07:05:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:05:41,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:41,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 07:05:41,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash -944603658, now seen corresponding path program 1 times [2024-11-19 07:05:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568957619] [2024-11-19 07:05:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,559 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:05:41,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568957619] [2024-11-19 07:05:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568957619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458371561] [2024-11-19 07:05:41,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,563 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,584 INFO L93 Difference]: Finished difference Result 135 states and 234 transitions. [2024-11-19 07:05:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 07:05:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,586 INFO L225 Difference]: With dead ends: 135 [2024-11-19 07:05:41,588 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 07:05:41,588 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:05:41,589 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 146 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:05:41,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 07:05:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-19 07:05:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 0 states have call successors, (0), 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:05:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 232 transitions. [2024-11-19 07:05:41,599 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 232 transitions. Word has length 19 [2024-11-19 07:05:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,599 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 232 transitions. [2024-11-19 07:05:41,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 232 transitions. [2024-11-19 07:05:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 07:05:41,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,601 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] [2024-11-19 07:05:41,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 07:05:41,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539921, now seen corresponding path program 1 times [2024-11-19 07:05:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714718369] [2024-11-19 07:05:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,644 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:05:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714718369] [2024-11-19 07:05:41,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714718369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988076973] [2024-11-19 07:05:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,648 INFO L87 Difference]: Start difference. First operand 132 states and 232 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,660 INFO L93 Difference]: Finished difference Result 137 states and 234 transitions. [2024-11-19 07:05:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 07:05:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,662 INFO L225 Difference]: With dead ends: 137 [2024-11-19 07:05:41,663 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 07:05:41,663 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:05:41,664 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 159 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:05:41,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 07:05:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-19 07:05:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 0 states have call successors, (0), 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:05:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 232 transitions. [2024-11-19 07:05:41,681 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 232 transitions. Word has length 20 [2024-11-19 07:05:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,681 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 232 transitions. [2024-11-19 07:05:41,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 232 transitions. [2024-11-19 07:05:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 07:05:41,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,682 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] [2024-11-19 07:05:41,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:05:41,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 788676243, now seen corresponding path program 1 times [2024-11-19 07:05:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490535039] [2024-11-19 07:05:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,734 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:05:41,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490535039] [2024-11-19 07:05:41,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490535039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045423680] [2024-11-19 07:05:41,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,738 INFO L87 Difference]: Start difference. First operand 134 states and 232 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,756 INFO L93 Difference]: Finished difference Result 257 states and 438 transitions. [2024-11-19 07:05:41,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 07:05:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,758 INFO L225 Difference]: With dead ends: 257 [2024-11-19 07:05:41,761 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 07:05:41,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,762 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 130 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:05:41,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 07:05:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2024-11-19 07:05:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.7233201581027668) internal successors, (436), 253 states have internal predecessors, (436), 0 states have call successors, (0), 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:05:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 436 transitions. [2024-11-19 07:05:41,777 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 436 transitions. Word has length 20 [2024-11-19 07:05:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,778 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 436 transitions. [2024-11-19 07:05:41,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 436 transitions. [2024-11-19 07:05:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 07:05:41,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,780 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] [2024-11-19 07:05:41,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 07:05:41,780 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1799793493, now seen corresponding path program 1 times [2024-11-19 07:05:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521881627] [2024-11-19 07:05:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,822 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:05:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521881627] [2024-11-19 07:05:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521881627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85074408] [2024-11-19 07:05:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,826 INFO L87 Difference]: Start difference. First operand 254 states and 436 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,838 INFO L93 Difference]: Finished difference Result 321 states and 554 transitions. [2024-11-19 07:05:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 07:05:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,840 INFO L225 Difference]: With dead ends: 321 [2024-11-19 07:05:41,841 INFO L226 Difference]: Without dead ends: 321 [2024-11-19 07:05:41,841 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:05:41,842 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 43 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 173 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:05:41,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 173 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-19 07:05:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 254. [2024-11-19 07:05:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 0 states have call successors, (0), 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:05:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 432 transitions. [2024-11-19 07:05:41,855 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 432 transitions. Word has length 20 [2024-11-19 07:05:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,856 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 432 transitions. [2024-11-19 07:05:41,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 432 transitions. [2024-11-19 07:05:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 07:05:41,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,860 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] [2024-11-19 07:05:41,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:05:41,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1314211103, now seen corresponding path program 1 times [2024-11-19 07:05:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769059246] [2024-11-19 07:05:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,915 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:05:41,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769059246] [2024-11-19 07:05:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769059246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658371262] [2024-11-19 07:05:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:41,918 INFO L87 Difference]: Start difference. First operand 254 states and 432 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:41,931 INFO L93 Difference]: Finished difference Result 469 states and 802 transitions. [2024-11-19 07:05:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:41,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 07:05:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:41,933 INFO L225 Difference]: With dead ends: 469 [2024-11-19 07:05:41,933 INFO L226 Difference]: Without dead ends: 469 [2024-11-19 07:05:41,933 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:05:41,935 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 40 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 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:05:41,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-19 07:05:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 354. [2024-11-19 07:05:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.6770538243626063) internal successors, (592), 353 states have internal predecessors, (592), 0 states have call successors, (0), 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:05:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 592 transitions. [2024-11-19 07:05:41,950 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 592 transitions. Word has length 21 [2024-11-19 07:05:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:41,951 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 592 transitions. [2024-11-19 07:05:41,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 592 transitions. [2024-11-19 07:05:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 07:05:41,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:41,955 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] [2024-11-19 07:05:41,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:05:41,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:41,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1969638943, now seen corresponding path program 1 times [2024-11-19 07:05:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105599815] [2024-11-19 07:05:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:41,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:41,995 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:05:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105599815] [2024-11-19 07:05:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105599815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:41,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126375474] [2024-11-19 07:05:41,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:41,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:41,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:41,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,000 INFO L87 Difference]: Start difference. First operand 354 states and 592 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,013 INFO L93 Difference]: Finished difference Result 493 states and 814 transitions. [2024-11-19 07:05:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 07:05:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,015 INFO L225 Difference]: With dead ends: 493 [2024-11-19 07:05:42,016 INFO L226 Difference]: Without dead ends: 493 [2024-11-19 07:05:42,016 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:05:42,017 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 148 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:05:42,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-19 07:05:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2024-11-19 07:05:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.6605316973415134) internal successors, (812), 489 states have internal predecessors, (812), 0 states have call successors, (0), 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:05:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 812 transitions. [2024-11-19 07:05:42,031 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 812 transitions. Word has length 21 [2024-11-19 07:05:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,031 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 812 transitions. [2024-11-19 07:05:42,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 812 transitions. [2024-11-19 07:05:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:05:42,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,034 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] [2024-11-19 07:05:42,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:05:42,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2079198818, now seen corresponding path program 1 times [2024-11-19 07:05:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694574061] [2024-11-19 07:05:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,077 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:05:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694574061] [2024-11-19 07:05:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694574061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412936890] [2024-11-19 07:05:42,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,081 INFO L87 Difference]: Start difference. First operand 490 states and 812 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,098 INFO L93 Difference]: Finished difference Result 505 states and 822 transitions. [2024-11-19 07:05:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:05:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,101 INFO L225 Difference]: With dead ends: 505 [2024-11-19 07:05:42,101 INFO L226 Difference]: Without dead ends: 505 [2024-11-19 07:05:42,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:05:42,102 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 151 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:05:42,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-19 07:05:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2024-11-19 07:05:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 0 states have call successors, (0), 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:05:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 820 transitions. [2024-11-19 07:05:42,116 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 820 transitions. Word has length 22 [2024-11-19 07:05:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,117 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 820 transitions. [2024-11-19 07:05:42,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 820 transitions. [2024-11-19 07:05:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:05:42,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,118 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] [2024-11-19 07:05:42,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:05:42,119 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 935904800, now seen corresponding path program 1 times [2024-11-19 07:05:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347918931] [2024-11-19 07:05:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,153 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:05:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347918931] [2024-11-19 07:05:42,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347918931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260443663] [2024-11-19 07:05:42,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,156 INFO L87 Difference]: Start difference. First operand 502 states and 820 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,173 INFO L93 Difference]: Finished difference Result 905 states and 1486 transitions. [2024-11-19 07:05:42,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:05:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,178 INFO L225 Difference]: With dead ends: 905 [2024-11-19 07:05:42,178 INFO L226 Difference]: Without dead ends: 905 [2024-11-19 07:05:42,178 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:05:42,179 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 122 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:05:42,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-19 07:05:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 710. [2024-11-19 07:05:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 0 states have call successors, (0), 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:05:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1132 transitions. [2024-11-19 07:05:42,201 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1132 transitions. Word has length 22 [2024-11-19 07:05:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,201 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1132 transitions. [2024-11-19 07:05:42,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1132 transitions. [2024-11-19 07:05:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:05:42,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,203 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] [2024-11-19 07:05:42,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:05:42,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash -75212450, now seen corresponding path program 1 times [2024-11-19 07:05:42,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655160459] [2024-11-19 07:05:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,242 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:05:42,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655160459] [2024-11-19 07:05:42,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655160459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896843384] [2024-11-19 07:05:42,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,247 INFO L87 Difference]: Start difference. First operand 710 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,262 INFO L93 Difference]: Finished difference Result 969 states and 1526 transitions. [2024-11-19 07:05:42,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:05:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,268 INFO L225 Difference]: With dead ends: 969 [2024-11-19 07:05:42,268 INFO L226 Difference]: Without dead ends: 969 [2024-11-19 07:05:42,269 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:05:42,270 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 149 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:05:42,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-19 07:05:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 966. [2024-11-19 07:05:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 0 states have call successors, (0), 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:05:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1524 transitions. [2024-11-19 07:05:42,290 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1524 transitions. Word has length 22 [2024-11-19 07:05:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,290 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1524 transitions. [2024-11-19 07:05:42,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1524 transitions. [2024-11-19 07:05:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:05:42,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,291 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:05:42,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 07:05:42,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1045071990, now seen corresponding path program 1 times [2024-11-19 07:05:42,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682104107] [2024-11-19 07:05:42,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,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:05:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682104107] [2024-11-19 07:05:42,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682104107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219989266] [2024-11-19 07:05:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,324 INFO L87 Difference]: Start difference. First operand 966 states and 1524 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:05:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,339 INFO L93 Difference]: Finished difference Result 985 states and 1526 transitions. [2024-11-19 07:05:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,339 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:05:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,344 INFO L225 Difference]: With dead ends: 985 [2024-11-19 07:05:42,344 INFO L226 Difference]: Without dead ends: 985 [2024-11-19 07:05:42,344 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:05:42,345 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 147 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:05:42,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-19 07:05:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 982. [2024-11-19 07:05:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 0 states have call successors, (0), 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:05:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1524 transitions. [2024-11-19 07:05:42,363 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1524 transitions. Word has length 23 [2024-11-19 07:05:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,364 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1524 transitions. [2024-11-19 07:05:42,364 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:05:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1524 transitions. [2024-11-19 07:05:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:05:42,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,366 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:05:42,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:05:42,366 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1970031628, now seen corresponding path program 1 times [2024-11-19 07:05:42,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450950027] [2024-11-19 07:05:42,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,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:05:42,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450950027] [2024-11-19 07:05:42,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450950027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682895987] [2024-11-19 07:05:42,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,393 INFO L87 Difference]: Start difference. First operand 982 states and 1524 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:05:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,409 INFO L93 Difference]: Finished difference Result 1737 states and 2710 transitions. [2024-11-19 07:05:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,409 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:05:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,415 INFO L225 Difference]: With dead ends: 1737 [2024-11-19 07:05:42,415 INFO L226 Difference]: Without dead ends: 1737 [2024-11-19 07:05:42,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:05:42,415 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 120 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:05:42,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2024-11-19 07:05:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1414. [2024-11-19 07:05:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 0 states have call successors, (0), 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:05:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2132 transitions. [2024-11-19 07:05:42,443 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2132 transitions. Word has length 23 [2024-11-19 07:05:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,444 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2132 transitions. [2024-11-19 07:05:42,444 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:05:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2132 transitions. [2024-11-19 07:05:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:05:42,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,447 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:05:42,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 07:05:42,447 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash 958914378, now seen corresponding path program 1 times [2024-11-19 07:05:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852941072] [2024-11-19 07:05:42,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,487 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:05:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852941072] [2024-11-19 07:05:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852941072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008512016] [2024-11-19 07:05:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,490 INFO L87 Difference]: Start difference. First operand 1414 states and 2132 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:05:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,509 INFO L93 Difference]: Finished difference Result 1897 states and 2822 transitions. [2024-11-19 07:05:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,510 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:05:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,516 INFO L225 Difference]: With dead ends: 1897 [2024-11-19 07:05:42,516 INFO L226 Difference]: Without dead ends: 1897 [2024-11-19 07:05:42,516 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:05:42,518 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 150 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:05:42,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2024-11-19 07:05:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1894. [2024-11-19 07:05:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 0 states have call successors, (0), 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:05:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2820 transitions. [2024-11-19 07:05:42,558 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2820 transitions. Word has length 23 [2024-11-19 07:05:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,558 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2820 transitions. [2024-11-19 07:05:42,558 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:05:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2820 transitions. [2024-11-19 07:05:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:05:42,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,561 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:05:42,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:05:42,561 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash 948099177, now seen corresponding path program 1 times [2024-11-19 07:05:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937082107] [2024-11-19 07:05:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,587 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:05:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937082107] [2024-11-19 07:05:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937082107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157739693] [2024-11-19 07:05:42,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,590 INFO L87 Difference]: Start difference. First operand 1894 states and 2820 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:05:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,606 INFO L93 Difference]: Finished difference Result 1929 states and 2822 transitions. [2024-11-19 07:05:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,607 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:05:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,612 INFO L225 Difference]: With dead ends: 1929 [2024-11-19 07:05:42,612 INFO L226 Difference]: Without dead ends: 1929 [2024-11-19 07:05:42,613 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:05:42,613 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 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:05:42,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-19 07:05:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1926. [2024-11-19 07:05:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 0 states have call successors, (0), 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:05:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2820 transitions. [2024-11-19 07:05:42,653 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2820 transitions. Word has length 24 [2024-11-19 07:05:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2820 transitions. [2024-11-19 07:05:42,654 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:05:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2820 transitions. [2024-11-19 07:05:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:05:42,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,656 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:05:42,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 07:05:42,657 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash -331764501, now seen corresponding path program 1 times [2024-11-19 07:05:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160673787] [2024-11-19 07:05:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,678 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:05:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160673787] [2024-11-19 07:05:42,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160673787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287696179] [2024-11-19 07:05:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,681 INFO L87 Difference]: Start difference. First operand 1926 states and 2820 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:05:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,703 INFO L93 Difference]: Finished difference Result 3337 states and 4902 transitions. [2024-11-19 07:05:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,704 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:05:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,714 INFO L225 Difference]: With dead ends: 3337 [2024-11-19 07:05:42,714 INFO L226 Difference]: Without dead ends: 3337 [2024-11-19 07:05:42,714 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:05:42,715 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 118 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:05:42,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2024-11-19 07:05:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2822. [2024-11-19 07:05:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 0 states have call successors, (0), 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:05:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 4004 transitions. [2024-11-19 07:05:42,773 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 4004 transitions. Word has length 24 [2024-11-19 07:05:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,773 INFO L471 AbstractCegarLoop]: Abstraction has 2822 states and 4004 transitions. [2024-11-19 07:05:42,774 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:05:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 4004 transitions. [2024-11-19 07:05:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:05:42,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,778 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:05:42,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 07:05:42,778 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1342881751, now seen corresponding path program 1 times [2024-11-19 07:05:42,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257210376] [2024-11-19 07:05:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,802 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:05:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257210376] [2024-11-19 07:05:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257210376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080471423] [2024-11-19 07:05:42,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,805 INFO L87 Difference]: Start difference. First operand 2822 states and 4004 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:05:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:42,830 INFO L93 Difference]: Finished difference Result 3721 states and 5190 transitions. [2024-11-19 07:05:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:42,831 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:05:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:42,841 INFO L225 Difference]: With dead ends: 3721 [2024-11-19 07:05:42,841 INFO L226 Difference]: Without dead ends: 3721 [2024-11-19 07:05:42,841 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:05:42,842 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 151 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:05:42,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-11-19 07:05:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3718. [2024-11-19 07:05:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3718 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 0 states have call successors, (0), 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:05:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 5188 transitions. [2024-11-19 07:05:42,938 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 5188 transitions. Word has length 24 [2024-11-19 07:05:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:42,939 INFO L471 AbstractCegarLoop]: Abstraction has 3718 states and 5188 transitions. [2024-11-19 07:05:42,939 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:05:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 5188 transitions. [2024-11-19 07:05:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:05:42,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:42,943 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:05:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 07:05:42,943 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:42,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1688093515, now seen corresponding path program 1 times [2024-11-19 07:05:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:42,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346744681] [2024-11-19 07:05:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:42,970 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:05:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346744681] [2024-11-19 07:05:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346744681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:42,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:42,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758508230] [2024-11-19 07:05:42,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:42,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:42,973 INFO L87 Difference]: Start difference. First operand 3718 states and 5188 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:05:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:43,000 INFO L93 Difference]: Finished difference Result 3785 states and 5190 transitions. [2024-11-19 07:05:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:43,001 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:05:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:43,012 INFO L225 Difference]: With dead ends: 3785 [2024-11-19 07:05:43,012 INFO L226 Difference]: Without dead ends: 3785 [2024-11-19 07:05:43,013 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:05:43,014 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 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:05:43,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2024-11-19 07:05:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3782. [2024-11-19 07:05:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 0 states have call successors, (0), 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:05:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5188 transitions. [2024-11-19 07:05:43,077 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5188 transitions. Word has length 25 [2024-11-19 07:05:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:43,077 INFO L471 AbstractCegarLoop]: Abstraction has 3782 states and 5188 transitions. [2024-11-19 07:05:43,077 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:05:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5188 transitions. [2024-11-19 07:05:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:05:43,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:43,083 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:05:43,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 07:05:43,083 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1327010103, now seen corresponding path program 1 times [2024-11-19 07:05:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138966427] [2024-11-19 07:05:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:43,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138966427] [2024-11-19 07:05:43,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138966427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:43,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:43,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:43,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425312595] [2024-11-19 07:05:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:43,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:43,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:43,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:43,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:43,107 INFO L87 Difference]: Start difference. First operand 3782 states and 5188 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:05:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:43,139 INFO L93 Difference]: Finished difference Result 6409 states and 8774 transitions. [2024-11-19 07:05:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:43,139 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:05:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:43,156 INFO L225 Difference]: With dead ends: 6409 [2024-11-19 07:05:43,157 INFO L226 Difference]: Without dead ends: 6409 [2024-11-19 07:05:43,157 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:05:43,157 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 116 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:05:43,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2024-11-19 07:05:43,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 5638. [2024-11-19 07:05:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 0 states have call successors, (0), 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:05:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 7492 transitions. [2024-11-19 07:05:43,336 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 7492 transitions. Word has length 25 [2024-11-19 07:05:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:43,336 INFO L471 AbstractCegarLoop]: Abstraction has 5638 states and 7492 transitions. [2024-11-19 07:05:43,337 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:05:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 7492 transitions. [2024-11-19 07:05:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:05:43,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:43,343 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:05:43,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 07:05:43,344 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:43,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash 315892853, now seen corresponding path program 1 times [2024-11-19 07:05:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797562920] [2024-11-19 07:05:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:43,366 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:05:43,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:43,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797562920] [2024-11-19 07:05:43,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797562920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:43,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:43,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:43,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419587004] [2024-11-19 07:05:43,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:43,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:43,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:43,368 INFO L87 Difference]: Start difference. First operand 5638 states and 7492 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:05:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:43,412 INFO L93 Difference]: Finished difference Result 7305 states and 9478 transitions. [2024-11-19 07:05:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:43,413 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:05:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:43,428 INFO L225 Difference]: With dead ends: 7305 [2024-11-19 07:05:43,428 INFO L226 Difference]: Without dead ends: 7305 [2024-11-19 07:05:43,429 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:05:43,430 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 42 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 152 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:05:43,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7305 states. [2024-11-19 07:05:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7305 to 7302. [2024-11-19 07:05:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7302 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 0 states have call successors, (0), 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:05:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9476 transitions. [2024-11-19 07:05:43,544 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9476 transitions. Word has length 25 [2024-11-19 07:05:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:43,544 INFO L471 AbstractCegarLoop]: Abstraction has 7302 states and 9476 transitions. [2024-11-19 07:05:43,544 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:05:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9476 transitions. [2024-11-19 07:05:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:05:43,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:43,552 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:05:43,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 07:05:43,553 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:43,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:43,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1805677772, now seen corresponding path program 1 times [2024-11-19 07:05:43,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:43,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224045373] [2024-11-19 07:05:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:43,578 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:05:43,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224045373] [2024-11-19 07:05:43,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224045373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:43,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:43,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:43,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349001147] [2024-11-19 07:05:43,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:43,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:43,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:43,581 INFO L87 Difference]: Start difference. First operand 7302 states and 9476 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:05:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:43,615 INFO L93 Difference]: Finished difference Result 7433 states and 9478 transitions. [2024-11-19 07:05:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:43,619 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:05:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:43,634 INFO L225 Difference]: With dead ends: 7433 [2024-11-19 07:05:43,634 INFO L226 Difference]: Without dead ends: 7433 [2024-11-19 07:05:43,635 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:05:43,635 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 135 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:05:43,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2024-11-19 07:05:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7430. [2024-11-19 07:05:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7430 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 0 states have call successors, (0), 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:05:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7430 states to 7430 states and 9476 transitions. [2024-11-19 07:05:43,830 INFO L78 Accepts]: Start accepts. Automaton has 7430 states and 9476 transitions. Word has length 26 [2024-11-19 07:05:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:43,830 INFO L471 AbstractCegarLoop]: Abstraction has 7430 states and 9476 transitions. [2024-11-19 07:05:43,830 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:05:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 7430 states and 9476 transitions. [2024-11-19 07:05:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:05:43,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:43,840 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:05:43,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 07:05:43,840 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:43,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1209425846, now seen corresponding path program 1 times [2024-11-19 07:05:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:43,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164911223] [2024-11-19 07:05:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:43,862 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:05:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164911223] [2024-11-19 07:05:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164911223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768791382] [2024-11-19 07:05:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:43,865 INFO L87 Difference]: Start difference. First operand 7430 states and 9476 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:05:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:43,932 INFO L93 Difference]: Finished difference Result 12297 states and 15494 transitions. [2024-11-19 07:05:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:43,933 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:05:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:43,955 INFO L225 Difference]: With dead ends: 12297 [2024-11-19 07:05:43,955 INFO L226 Difference]: Without dead ends: 12297 [2024-11-19 07:05:43,955 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:05:43,956 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 114 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:05:43,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 114 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12297 states. [2024-11-19 07:05:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12297 to 11270. [2024-11-19 07:05:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11270 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 0 states have call successors, (0), 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:05:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 13956 transitions. [2024-11-19 07:05:44,158 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 13956 transitions. Word has length 26 [2024-11-19 07:05:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:44,158 INFO L471 AbstractCegarLoop]: Abstraction has 11270 states and 13956 transitions. [2024-11-19 07:05:44,158 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:05:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 13956 transitions. [2024-11-19 07:05:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:05:44,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:44,173 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:05:44,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 07:05:44,173 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:44,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash 198308596, now seen corresponding path program 1 times [2024-11-19 07:05:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:44,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361099837] [2024-11-19 07:05:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:44,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:44,195 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:05:44,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:44,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361099837] [2024-11-19 07:05:44,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361099837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:44,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:44,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598798987] [2024-11-19 07:05:44,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:44,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:44,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:44,197 INFO L87 Difference]: Start difference. First operand 11270 states and 13956 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:05:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:44,267 INFO L93 Difference]: Finished difference Result 14345 states and 17158 transitions. [2024-11-19 07:05:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:44,268 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:05:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:44,291 INFO L225 Difference]: With dead ends: 14345 [2024-11-19 07:05:44,292 INFO L226 Difference]: Without dead ends: 14345 [2024-11-19 07:05:44,292 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:05:44,293 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 153 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:05:44,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14345 states. [2024-11-19 07:05:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14345 to 14342. [2024-11-19 07:05:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14342 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 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:05:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14342 states to 14342 states and 17156 transitions. [2024-11-19 07:05:44,565 INFO L78 Accepts]: Start accepts. Automaton has 14342 states and 17156 transitions. Word has length 26 [2024-11-19 07:05:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:44,566 INFO L471 AbstractCegarLoop]: Abstraction has 14342 states and 17156 transitions. [2024-11-19 07:05:44,566 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:05:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14342 states and 17156 transitions. [2024-11-19 07:05:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:05:44,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:44,581 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:05:44,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 07:05:44,582 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:44,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1155811872, now seen corresponding path program 1 times [2024-11-19 07:05:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:44,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248877645] [2024-11-19 07:05:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:44,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:44,610 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:05:44,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:44,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248877645] [2024-11-19 07:05:44,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248877645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:44,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049575548] [2024-11-19 07:05:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:44,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:44,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:44,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:44,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:44,612 INFO L87 Difference]: Start difference. First operand 14342 states and 17156 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:05:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:44,689 INFO L93 Difference]: Finished difference Result 14601 states and 17158 transitions. [2024-11-19 07:05:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:44,690 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:05:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:44,715 INFO L225 Difference]: With dead ends: 14601 [2024-11-19 07:05:44,715 INFO L226 Difference]: Without dead ends: 14601 [2024-11-19 07:05:44,716 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:05:44,716 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 131 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:05:44,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2024-11-19 07:05:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14598. [2024-11-19 07:05:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14598 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 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:05:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14598 states to 14598 states and 17156 transitions. [2024-11-19 07:05:45,049 INFO L78 Accepts]: Start accepts. Automaton has 14598 states and 17156 transitions. Word has length 27 [2024-11-19 07:05:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:45,049 INFO L471 AbstractCegarLoop]: Abstraction has 14598 states and 17156 transitions. [2024-11-19 07:05:45,049 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:05:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 14598 states and 17156 transitions. [2024-11-19 07:05:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:05:45,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:45,158 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:05:45,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 07:05:45,158 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:45,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1859291746, now seen corresponding path program 1 times [2024-11-19 07:05:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117637322] [2024-11-19 07:05:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:45,215 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:05:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117637322] [2024-11-19 07:05:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117637322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:45,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:45,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320033455] [2024-11-19 07:05:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:45,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:45,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:45,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:45,218 INFO L87 Difference]: Start difference. First operand 14598 states and 17156 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:05:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:45,297 INFO L93 Difference]: Finished difference Result 23558 states and 26884 transitions. [2024-11-19 07:05:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:45,297 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:05:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:45,341 INFO L225 Difference]: With dead ends: 23558 [2024-11-19 07:05:45,342 INFO L226 Difference]: Without dead ends: 23558 [2024-11-19 07:05:45,343 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:05:45,343 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 110 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:05:45,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 110 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23558 states. [2024-11-19 07:05:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23558 to 22534. [2024-11-19 07:05:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.1476501131673547) internal successors, (25860), 22533 states have internal predecessors, (25860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 25860 transitions. [2024-11-19 07:05:45,775 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 25860 transitions. Word has length 27 [2024-11-19 07:05:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:45,776 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 25860 transitions. [2024-11-19 07:05:45,776 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:05:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 25860 transitions. [2024-11-19 07:05:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:05:45,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:45,806 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:05:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 07:05:45,806 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:45,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash 848174496, now seen corresponding path program 1 times [2024-11-19 07:05:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:45,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806765808] [2024-11-19 07:05:45,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:45,831 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:05:45,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806765808] [2024-11-19 07:05:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806765808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:45,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877991375] [2024-11-19 07:05:45,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:45,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:45,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:45,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:45,834 INFO L87 Difference]: Start difference. First operand 22534 states and 25860 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:05:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:45,923 INFO L93 Difference]: Finished difference Result 28163 states and 30722 transitions. [2024-11-19 07:05:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:45,924 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:05:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:45,924 INFO L225 Difference]: With dead ends: 28163 [2024-11-19 07:05:45,924 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 07:05:45,925 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:05:45,925 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 150 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:05:45,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 07:05:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 07:05:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 07:05:45,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-11-19 07:05:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:45,927 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 07:05:45,927 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:05:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 07:05:45,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 07:05:45,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-19 07:05:45,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-19 07:05:45,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 07:05:45,934 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:45,935 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 07:05:45,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:05:45 BoogieIcfgContainer [2024-11-19 07:05:45,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 07:05:45,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 07:05:45,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 07:05:45,939 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 07:05:45,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:05:40" (3/4) ... [2024-11-19 07:05:45,941 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 07:05:45,949 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 07:05:45,950 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 07:05:45,950 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 07:05:45,950 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 07:05:46,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 07:05:46,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 07:05:46,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 07:05:46,047 INFO L158 Benchmark]: Toolchain (without parser) took 6223.28ms. Allocated memory was 155.2MB in the beginning and 595.6MB in the end (delta: 440.4MB). Free memory was 100.2MB in the beginning and 284.2MB in the end (delta: -183.9MB). Peak memory consumption was 258.2MB. Max. memory is 16.1GB. [2024-11-19 07:05:46,048 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 119.9MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 07:05:46,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.78ms. Allocated memory is still 155.2MB. Free memory was 99.9MB in the beginning and 86.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 07:05:46,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.48ms. Allocated memory is still 155.2MB. Free memory was 86.7MB in the beginning and 85.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 07:05:46,048 INFO L158 Benchmark]: Boogie Preprocessor took 45.66ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 07:05:46,049 INFO L158 Benchmark]: RCFGBuilder took 353.14ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 67.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 07:05:46,049 INFO L158 Benchmark]: TraceAbstraction took 5403.09ms. Allocated memory was 155.2MB in the beginning and 595.6MB in the end (delta: 440.4MB). Free memory was 67.3MB in the beginning and 290.5MB in the end (delta: -223.2MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. [2024-11-19 07:05:46,049 INFO L158 Benchmark]: Witness Printer took 108.52ms. Allocated memory is still 595.6MB. Free memory was 290.5MB in the beginning and 284.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 07:05:46,052 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 119.9MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.78ms. Allocated memory is still 155.2MB. Free memory was 99.9MB in the beginning and 86.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.48ms. Allocated memory is still 155.2MB. Free memory was 86.7MB in the beginning and 85.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.66ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.14ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 67.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5403.09ms. Allocated memory was 155.2MB in the beginning and 595.6MB in the end (delta: 440.4MB). Free memory was 67.3MB in the beginning and 290.5MB in the end (delta: -223.2MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. * Witness Printer took 108.52ms. Allocated memory is still 595.6MB. Free memory was 290.5MB in the beginning and 284.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1234 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1234 mSDsluCounter, 4036 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1556 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2480 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22534occurred in iteration=29, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 4150 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 07:05:46,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE