./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_6.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_6.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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:06:01,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:06:01,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:06:01,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:06:01,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:06:01,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:06:01,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:06:01,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:06:01,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:06:01,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:06:01,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:06:01,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:06:01,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:06:01,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:06:01,894 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:06:01,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:06:01,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:06:01,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:06:01,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:06:01,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:06:01,898 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:06:01,900 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:06:01,900 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:06:01,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:06:01,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:06:01,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:06:01,900 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:06:01,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:06:01,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:06:01,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:06:01,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:06:01,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:06:01,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:06:01,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:06:01,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:06:01,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:06:01,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:06:01,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:06:01,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:06:01,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:06:01,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:06:01,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:06:01,904 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2024-11-19 07:06:02,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:06:02,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:06:02,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:06:02,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:06:02,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:06:02,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2024-11-19 07:06:03,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:06:03,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:06:03,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2024-11-19 07:06:03,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23757697a/408790df1c6141c18dae9859162f9a32/FLAG5d54c39b2 [2024-11-19 07:06:04,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23757697a/408790df1c6141c18dae9859162f9a32 [2024-11-19 07:06:04,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:06:04,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:06:04,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:06:04,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:06:04,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:06:04,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1697fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04, skipping insertion in model container [2024-11-19 07:06:04,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:06:04,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:06:04,172 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:06:04,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:06:04,198 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:06:04,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04 WrapperNode [2024-11-19 07:06:04,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:06:04,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:06:04,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:06:04,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:06:04,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,225 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2024-11-19 07:06:04,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:06:04,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:06:04,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:06:04,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:06:04,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,243 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 07:06:04,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:06:04,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:06:04,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:06:04,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:06:04,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (1/1) ... [2024-11-19 07:06:04,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:06:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:06:04,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 07:06:04,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 07:06:04,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:06:04,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:06:04,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:06:04,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:06:04,391 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:06:04,395 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:06:04,526 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-19 07:06:04,527 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:06:04,540 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:06:04,541 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 07:06:04,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:04 BoogieIcfgContainer [2024-11-19 07:06:04,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:06:04,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:06:04,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:06:04,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:06:04,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:06:04" (1/3) ... [2024-11-19 07:06:04,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362f13a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:06:04, skipping insertion in model container [2024-11-19 07:06:04,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:04" (2/3) ... [2024-11-19 07:06:04,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362f13a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:06:04, skipping insertion in model container [2024-11-19 07:06:04,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:04" (3/3) ... [2024-11-19 07:06:04,551 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2024-11-19 07:06:04,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:06:04,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 07:06:04,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:06:04,621 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;@48070339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:06:04,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 07:06:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:06:04,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:04,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:06:04,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash 28807965, now seen corresponding path program 1 times [2024-11-19 07:06:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:04,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381922346] [2024-11-19 07:06:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381922346] [2024-11-19 07:06:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381922346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:04,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:06:04,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749151582] [2024-11-19 07:06:04,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:04,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 07:06:04,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:04,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 07:06:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 07:06:04,796 INFO L87 Difference]: Start difference. First operand has 31 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:04,805 INFO L93 Difference]: Finished difference Result 30 states and 47 transitions. [2024-11-19 07:06:04,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 07:06:04,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 07:06:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:04,813 INFO L225 Difference]: With dead ends: 30 [2024-11-19 07:06:04,813 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 07:06:04,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 07:06:04,817 INFO L432 NwaCegarLoop]: 47 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, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:04,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 07:06:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 07:06:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2024-11-19 07:06:04,857 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 5 [2024-11-19 07:06:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:04,858 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-11-19 07:06:04,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2024-11-19 07:06:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:06:04,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:04,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:06:04,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:06:04,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash 889695790, now seen corresponding path program 1 times [2024-11-19 07:06:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788783331] [2024-11-19 07:06:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:04,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788783331] [2024-11-19 07:06:04,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788783331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:04,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:04,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:06:04,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040561507] [2024-11-19 07:06:04,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:04,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:04,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:04,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:04,955 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:04,963 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2024-11-19 07:06:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:04,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:06:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:04,964 INFO L225 Difference]: With dead ends: 27 [2024-11-19 07:06:04,964 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 07:06:04,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:04,966 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:04,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 07:06:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-19 07:06:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2024-11-19 07:06:04,972 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 6 [2024-11-19 07:06:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:04,972 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. [2024-11-19 07:06:04,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. [2024-11-19 07:06:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 07:06:04,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:04,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:04,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:06:04,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash -882171908, now seen corresponding path program 1 times [2024-11-19 07:06:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:04,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086204366] [2024-11-19 07:06:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:04,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086204366] [2024-11-19 07:06:05,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086204366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941665326] [2024-11-19 07:06:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,030 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,048 INFO L93 Difference]: Finished difference Result 47 states and 79 transitions. [2024-11-19 07:06:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-19 07:06:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,049 INFO L225 Difference]: With dead ends: 47 [2024-11-19 07:06:05,049 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 07:06:05,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,050 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 82 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 07:06:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2024-11-19 07:06:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 55 transitions. [2024-11-19 07:06:05,061 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 55 transitions. Word has length 14 [2024-11-19 07:06:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,061 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 55 transitions. [2024-11-19 07:06:05,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 55 transitions. [2024-11-19 07:06:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 07:06:05,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:06:05,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1275198918, now seen corresponding path program 1 times [2024-11-19 07:06:05,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706150434] [2024-11-19 07:06:05,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706150434] [2024-11-19 07:06:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706150434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722362434] [2024-11-19 07:06:05,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,113 INFO L87 Difference]: Start difference. First operand 32 states and 55 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,134 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2024-11-19 07:06:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-19 07:06:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,135 INFO L225 Difference]: With dead ends: 47 [2024-11-19 07:06:05,136 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 07:06:05,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,137 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 07:06:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-19 07:06:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 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:06:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 75 transitions. [2024-11-19 07:06:05,142 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 75 transitions. Word has length 14 [2024-11-19 07:06:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,142 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 75 transitions. [2024-11-19 07:06:05,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 75 transitions. [2024-11-19 07:06:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:06:05,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:06:05,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1570875158, now seen corresponding path program 1 times [2024-11-19 07:06:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604155997] [2024-11-19 07:06:05,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604155997] [2024-11-19 07:06:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604155997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621773134] [2024-11-19 07:06:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,197 INFO L87 Difference]: Start difference. First operand 44 states and 75 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,217 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2024-11-19 07:06:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-19 07:06:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,218 INFO L225 Difference]: With dead ends: 50 [2024-11-19 07:06:05,218 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 07:06:05,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,219 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 07:06:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-19 07:06:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 77 transitions. [2024-11-19 07:06:05,225 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 77 transitions. Word has length 15 [2024-11-19 07:06:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,225 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 77 transitions. [2024-11-19 07:06:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 77 transitions. [2024-11-19 07:06:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:06:05,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:06:05,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash -869810580, now seen corresponding path program 1 times [2024-11-19 07:06:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283973490] [2024-11-19 07:06:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283973490] [2024-11-19 07:06:05,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283973490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61788202] [2024-11-19 07:06:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,269 INFO L87 Difference]: Start difference. First operand 47 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,285 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2024-11-19 07:06:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-19 07:06:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,287 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:06:05,287 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:06:05,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,287 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:06:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2024-11-19 07:06:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 102 transitions. [2024-11-19 07:06:05,297 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 102 transitions. Word has length 15 [2024-11-19 07:06:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,297 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 102 transitions. [2024-11-19 07:06:05,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 102 transitions. [2024-11-19 07:06:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:06:05,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 07:06:05,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1262837590, now seen corresponding path program 1 times [2024-11-19 07:06:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958350468] [2024-11-19 07:06:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958350468] [2024-11-19 07:06:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958350468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439020527] [2024-11-19 07:06:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,326 INFO L87 Difference]: Start difference. First operand 62 states and 102 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,339 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2024-11-19 07:06:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-19 07:06:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,340 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:06:05,340 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:06:05,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,341 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:06:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-19 07:06:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 136 transitions. [2024-11-19 07:06:05,346 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 136 transitions. Word has length 15 [2024-11-19 07:06:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,346 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 136 transitions. [2024-11-19 07:06:05,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 136 transitions. [2024-11-19 07:06:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:06:05,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 07:06:05,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1187663419, now seen corresponding path program 1 times [2024-11-19 07:06:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619727003] [2024-11-19 07:06:05,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619727003] [2024-11-19 07:06:05,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619727003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340876511] [2024-11-19 07:06:05,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,375 INFO L87 Difference]: Start difference. First operand 84 states and 136 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,385 INFO L93 Difference]: Finished difference Result 89 states and 138 transitions. [2024-11-19 07:06:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-19 07:06:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,386 INFO L225 Difference]: With dead ends: 89 [2024-11-19 07:06:05,386 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 07:06:05,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,387 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 07:06:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-19 07:06:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. [2024-11-19 07:06:05,399 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 16 [2024-11-19 07:06:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,399 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. [2024-11-19 07:06:05,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. [2024-11-19 07:06:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:06:05,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:06:05,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash -486598841, now seen corresponding path program 1 times [2024-11-19 07:06:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056860277] [2024-11-19 07:06:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056860277] [2024-11-19 07:06:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056860277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123009702] [2024-11-19 07:06:05,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,439 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,456 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2024-11-19 07:06:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-19 07:06:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,458 INFO L225 Difference]: With dead ends: 161 [2024-11-19 07:06:05,458 INFO L226 Difference]: Without dead ends: 161 [2024-11-19 07:06:05,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,458 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 82 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-19 07:06:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-11-19 07:06:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5541401273885351) internal successors, (244), 157 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 244 transitions. [2024-11-19 07:06:05,469 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 244 transitions. Word has length 16 [2024-11-19 07:06:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,469 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 244 transitions. [2024-11-19 07:06:05,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions. [2024-11-19 07:06:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:06:05,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 07:06:05,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash -93571831, now seen corresponding path program 1 times [2024-11-19 07:06:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80987395] [2024-11-19 07:06:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80987395] [2024-11-19 07:06:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80987395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238534930] [2024-11-19 07:06:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,506 INFO L87 Difference]: Start difference. First operand 158 states and 244 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,519 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-19 07:06:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-19 07:06:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,521 INFO L225 Difference]: With dead ends: 193 [2024-11-19 07:06:05,521 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 07:06:05,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,522 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 07:06:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 158. [2024-11-19 07:06:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 240 transitions. [2024-11-19 07:06:05,536 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 240 transitions. Word has length 16 [2024-11-19 07:06:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,536 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 240 transitions. [2024-11-19 07:06:05,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2024-11-19 07:06:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 07:06:05,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:06:05,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2101976469, now seen corresponding path program 1 times [2024-11-19 07:06:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926213764] [2024-11-19 07:06:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926213764] [2024-11-19 07:06:05,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926213764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25481478] [2024-11-19 07:06:05,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,573 INFO L87 Difference]: Start difference. First operand 158 states and 240 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,586 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2024-11-19 07:06:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-19 07:06:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,588 INFO L225 Difference]: With dead ends: 277 [2024-11-19 07:06:05,588 INFO L226 Difference]: Without dead ends: 277 [2024-11-19 07:06:05,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:06:05,589 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-19 07:06:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 226. [2024-11-19 07:06:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4933333333333334) internal successors, (336), 225 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 336 transitions. [2024-11-19 07:06:05,599 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 336 transitions. Word has length 17 [2024-11-19 07:06:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,600 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 336 transitions. [2024-11-19 07:06:05,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 336 transitions. [2024-11-19 07:06:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 07:06:05,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:06:05,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1708949459, now seen corresponding path program 1 times [2024-11-19 07:06:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674396364] [2024-11-19 07:06:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674396364] [2024-11-19 07:06:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674396364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118187404] [2024-11-19 07:06:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,637 INFO L87 Difference]: Start difference. First operand 226 states and 336 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,651 INFO L93 Difference]: Finished difference Result 301 states and 430 transitions. [2024-11-19 07:06:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-19 07:06:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,653 INFO L225 Difference]: With dead ends: 301 [2024-11-19 07:06:05,653 INFO L226 Difference]: Without dead ends: 301 [2024-11-19 07:06:05,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,654 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 92 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-19 07:06:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2024-11-19 07:06:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4410774410774412) internal successors, (428), 297 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 428 transitions. [2024-11-19 07:06:05,665 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 428 transitions. Word has length 17 [2024-11-19 07:06:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,666 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 428 transitions. [2024-11-19 07:06:05,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 428 transitions. [2024-11-19 07:06:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 07:06:05,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,668 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:06:05,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:06:05,668 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash 743443026, now seen corresponding path program 1 times [2024-11-19 07:06:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666088070] [2024-11-19 07:06:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666088070] [2024-11-19 07:06:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666088070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005167099] [2024-11-19 07:06:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,698 INFO L87 Difference]: Start difference. First operand 298 states and 428 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:06:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,706 INFO L93 Difference]: Finished difference Result 313 states and 438 transitions. [2024-11-19 07:06:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,707 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:06:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,708 INFO L225 Difference]: With dead ends: 313 [2024-11-19 07:06:05,708 INFO L226 Difference]: Without dead ends: 313 [2024-11-19 07:06:05,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,709 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-19 07:06:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-11-19 07:06:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 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:06:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 436 transitions. [2024-11-19 07:06:05,715 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 436 transitions. Word has length 18 [2024-11-19 07:06:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,715 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 436 transitions. [2024-11-19 07:06:05,715 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:06:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 436 transitions. [2024-11-19 07:06:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 07:06:05,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,716 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:06:05,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:06:05,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1444507604, now seen corresponding path program 1 times [2024-11-19 07:06:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492186154] [2024-11-19 07:06:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,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:06:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492186154] [2024-11-19 07:06:05,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492186154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808052195] [2024-11-19 07:06:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,736 INFO L87 Difference]: Start difference. First operand 310 states and 436 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:06:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,744 INFO L93 Difference]: Finished difference Result 521 states and 718 transitions. [2024-11-19 07:06:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,745 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:06:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,746 INFO L225 Difference]: With dead ends: 521 [2024-11-19 07:06:05,746 INFO L226 Difference]: Without dead ends: 521 [2024-11-19 07:06:05,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,748 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-19 07:06:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 454. [2024-11-19 07:06:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 620 transitions. [2024-11-19 07:06:05,758 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 620 transitions. Word has length 18 [2024-11-19 07:06:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,758 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 620 transitions. [2024-11-19 07:06:05,759 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:06:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 620 transitions. [2024-11-19 07:06:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 07:06:05,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,759 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:06:05,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:06:05,760 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1051480594, now seen corresponding path program 1 times [2024-11-19 07:06:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498474833] [2024-11-19 07:06:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498474833] [2024-11-19 07:06:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498474833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898886790] [2024-11-19 07:06:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,783 INFO L87 Difference]: Start difference. First operand 454 states and 620 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:06:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,792 INFO L93 Difference]: Finished difference Result 585 states and 758 transitions. [2024-11-19 07:06:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,792 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:06:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,794 INFO L225 Difference]: With dead ends: 585 [2024-11-19 07:06:05,794 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 07:06:05,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,795 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 07:06:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2024-11-19 07:06:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 756 transitions. [2024-11-19 07:06:05,804 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 756 transitions. Word has length 18 [2024-11-19 07:06:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,804 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 756 transitions. [2024-11-19 07:06:05,804 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:06:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 756 transitions. [2024-11-19 07:06:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:06:05,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,805 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:06:05,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 07:06:05,806 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1836755262, now seen corresponding path program 1 times [2024-11-19 07:06:05,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63687773] [2024-11-19 07:06:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63687773] [2024-11-19 07:06:05,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63687773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773093877] [2024-11-19 07:06:05,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,828 INFO L87 Difference]: Start difference. First operand 582 states and 756 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:06:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,839 INFO L93 Difference]: Finished difference Result 601 states and 758 transitions. [2024-11-19 07:06:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,839 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:06:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,842 INFO L225 Difference]: With dead ends: 601 [2024-11-19 07:06:05,842 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 07:06:05,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,843 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 07:06:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2024-11-19 07:06:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 756 transitions. [2024-11-19 07:06:05,853 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 756 transitions. Word has length 19 [2024-11-19 07:06:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,853 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 756 transitions. [2024-11-19 07:06:05,854 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:06:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 756 transitions. [2024-11-19 07:06:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:06:05,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,856 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:06:05,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:06:05,856 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1757147456, now seen corresponding path program 1 times [2024-11-19 07:06:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084907530] [2024-11-19 07:06:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084907530] [2024-11-19 07:06:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084907530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616899162] [2024-11-19 07:06:05,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,884 INFO L87 Difference]: Start difference. First operand 598 states and 756 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:06:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,894 INFO L93 Difference]: Finished difference Result 966 states and 1172 transitions. [2024-11-19 07:06:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,894 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:06:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,897 INFO L225 Difference]: With dead ends: 966 [2024-11-19 07:06:05,897 INFO L226 Difference]: Without dead ends: 966 [2024-11-19 07:06:05,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,898 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-19 07:06:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 902. [2024-11-19 07:06:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1108 transitions. [2024-11-19 07:06:05,911 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1108 transitions. Word has length 19 [2024-11-19 07:06:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,911 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1108 transitions. [2024-11-19 07:06:05,912 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:06:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1108 transitions. [2024-11-19 07:06:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 07:06:05,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:05,913 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:06:05,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 07:06:05,913 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:05,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2144792830, now seen corresponding path program 1 times [2024-11-19 07:06:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897187176] [2024-11-19 07:06:05,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:05,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897187176] [2024-11-19 07:06:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897187176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:05,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:05,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:05,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120639808] [2024-11-19 07:06:05,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:05,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:05,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:05,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,933 INFO L87 Difference]: Start difference. First operand 902 states and 1108 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:06:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,943 INFO L93 Difference]: Finished difference Result 1123 states and 1282 transitions. [2024-11-19 07:06:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,944 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:06:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,944 INFO L225 Difference]: With dead ends: 1123 [2024-11-19 07:06:05,944 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 07:06:05,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,945 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 07:06:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 07:06:05,946 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:06:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 07:06:05,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-11-19 07:06:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:05,946 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 07:06:05,946 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:06:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 07:06:05,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 07:06:05,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-19 07:06:05,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-19 07:06:05,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:06:05,952 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:05,954 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 07:06:05,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:06:05 BoogieIcfgContainer [2024-11-19 07:06:05,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 07:06:05,957 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 07:06:05,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 07:06:05,958 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 07:06:05,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:04" (3/4) ... [2024-11-19 07:06:05,960 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 07:06:05,981 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 07:06:05,986 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 07:06:05,986 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 07:06:05,987 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 07:06:06,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 07:06:06,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 07:06:06,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 07:06:06,117 INFO L158 Benchmark]: Toolchain (without parser) took 2112.56ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 126.0MB in the beginning and 206.1MB in the end (delta: -80.1MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. [2024-11-19 07:06:06,117 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 07:06:06,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.91ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 113.3MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 07:06:06,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.30ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 111.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 07:06:06,117 INFO L158 Benchmark]: Boogie Preprocessor took 25.06ms. Allocated memory is still 184.5MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 07:06:06,118 INFO L158 Benchmark]: RCFGBuilder took 290.31ms. Allocated memory is still 184.5MB. Free memory was 109.7MB in the beginning and 97.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 07:06:06,118 INFO L158 Benchmark]: TraceAbstraction took 1412.29ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 96.1MB in the beginning and 67.9MB in the end (delta: 28.2MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2024-11-19 07:06:06,118 INFO L158 Benchmark]: Witness Printer took 159.71ms. Allocated memory is still 241.2MB. Free memory was 67.9MB in the beginning and 206.1MB in the end (delta: -138.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 07:06:06,120 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.91ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 113.3MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.30ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 111.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.06ms. Allocated memory is still 184.5MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 290.31ms. Allocated memory is still 184.5MB. Free memory was 109.7MB in the beginning and 97.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1412.29ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 96.1MB in the beginning and 67.9MB in the end (delta: 28.2MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Witness Printer took 159.71ms. Allocated memory is still 241.2MB. Free memory was 67.9MB in the beginning and 206.1MB in the end (delta: -138.2MB). Peak memory consumption was 2.1MB. 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, 31 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 1474 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 538 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 936 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=17, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 282 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:06:06,145 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