./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_5.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 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:51:58,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:51:58,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:51:58,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:51:58,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:51:58,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:51:58,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:51:58,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:51:58,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:51:58,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:51:58,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:51:58,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:51:58,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:51:58,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:51:58,724 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:51:58,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:51:58,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:51:58,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:51:58,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:51:58,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:51:58,729 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:51:58,729 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:51:58,729 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:51:58,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:51:58,730 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:51:58,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:51:58,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:51:58,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:51:58,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:51:58,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:51:58,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:51:58,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:51:58,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:51:58,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:51:58,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:51:58,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:51:58,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:51:58,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:51:58,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:51:58,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:51:58,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:51:58,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:51:58,733 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 -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 [2024-11-17 00:51:58,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:51:58,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:51:58,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:51:58,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:51:58,956 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:51:58,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2024-11-17 00:52:00,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:52:00,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:52:00,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2024-11-17 00:52:00,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f171615/d0b64869ecb743f1af486204dc5ee8ae/FLAG340cba98c [2024-11-17 00:52:00,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f171615/d0b64869ecb743f1af486204dc5ee8ae [2024-11-17 00:52:00,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:52:00,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:52:00,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:52:00,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:52:00,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:52:00,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362fb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00, skipping insertion in model container [2024-11-17 00:52:00,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:52:00,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:52:00,849 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:52:00,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:52:00,883 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:52:00,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00 WrapperNode [2024-11-17 00:52:00,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:52:00,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:52:00,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:52:00,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:52:00,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,912 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-17 00:52:00,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:52:00,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:52:00,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:52:00,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:52:00,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 00:52:00,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:52:00,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:52:00,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:52:00,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:52:00,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (1/1) ... [2024-11-17 00:52:00,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:52:00,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:52:01,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:52:01,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:52:01,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:52:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:52:01,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:52:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:52:01,138 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:52:01,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:52:01,250 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-17 00:52:01,250 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:52:01,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:52:01,262 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:52:01,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:01 BoogieIcfgContainer [2024-11-17 00:52:01,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:52:01,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:52:01,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:52:01,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:52:01,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:52:00" (1/3) ... [2024-11-17 00:52:01,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c509ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:01, skipping insertion in model container [2024-11-17 00:52:01,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:00" (2/3) ... [2024-11-17 00:52:01,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c509ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:01, skipping insertion in model container [2024-11-17 00:52:01,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:01" (3/3) ... [2024-11-17 00:52:01,269 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2024-11-17 00:52:01,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:52:01,284 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:52:01,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:52:01,318 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;@414387ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:52:01,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:52:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:52:01,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1396829529, now seen corresponding path program 1 times [2024-11-17 00:52:01,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984650033] [2024-11-17 00:52:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,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-17 00:52:01,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984650033] [2024-11-17 00:52:01,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984650033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:01,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097629857] [2024-11-17 00:52:01,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:52:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:52:01,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:52:01,466 INFO L87 Difference]: Start difference. First operand has 31 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,475 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2024-11-17 00:52:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:52:01,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:52:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,482 INFO L225 Difference]: With dead ends: 30 [2024-11-17 00:52:01,482 INFO L226 Difference]: Without dead ends: 27 [2024-11-17 00:52:01,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:52:01,485 INFO L432 NwaCegarLoop]: 44 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, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-17 00:52:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-17 00:52:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.64) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2024-11-17 00:52:01,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 6 [2024-11-17 00:52:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,508 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2024-11-17 00:52:01,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2024-11-17 00:52:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:52:01,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:52:01,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1994473550, now seen corresponding path program 1 times [2024-11-17 00:52:01,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959412724] [2024-11-17 00:52:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959412724] [2024-11-17 00:52:01,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959412724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336382850] [2024-11-17 00:52:01,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,556 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,562 INFO L93 Difference]: Finished difference Result 26 states and 40 transitions. [2024-11-17 00:52:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:52:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,563 INFO L225 Difference]: With dead ends: 26 [2024-11-17 00:52:01,563 INFO L226 Difference]: Without dead ends: 23 [2024-11-17 00:52:01,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,564 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-17 00:52:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-17 00:52:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 22 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2024-11-17 00:52:01,567 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 8 [2024-11-17 00:52:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,568 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. [2024-11-17 00:52:01,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. [2024-11-17 00:52:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:52:01,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:52:01,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1027041617, now seen corresponding path program 1 times [2024-11-17 00:52:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441448294] [2024-11-17 00:52:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441448294] [2024-11-17 00:52:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441448294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967700747] [2024-11-17 00:52:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,615 INFO L87 Difference]: Start difference. First operand 23 states and 37 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-17 00:52:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,631 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2024-11-17 00:52:01,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,634 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-17 00:52:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,635 INFO L225 Difference]: With dead ends: 43 [2024-11-17 00:52:01,635 INFO L226 Difference]: Without dead ends: 43 [2024-11-17 00:52:01,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,636 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-17 00:52:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2024-11-17 00:52:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2024-11-17 00:52:01,641 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 14 [2024-11-17 00:52:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,641 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 48 transitions. [2024-11-17 00:52:01,641 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-17 00:52:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 48 transitions. [2024-11-17 00:52:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:52:01,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:52:01,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash -780412846, now seen corresponding path program 1 times [2024-11-17 00:52:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339801064] [2024-11-17 00:52:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339801064] [2024-11-17 00:52:01,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339801064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353532390] [2024-11-17 00:52:01,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,693 INFO L87 Difference]: Start difference. First operand 29 states and 48 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-17 00:52:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,705 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2024-11-17 00:52:01,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,705 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-17 00:52:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,706 INFO L225 Difference]: With dead ends: 43 [2024-11-17 00:52:01,706 INFO L226 Difference]: Without dead ends: 43 [2024-11-17 00:52:01,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,707 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-17 00:52:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-17 00:52:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2024-11-17 00:52:01,711 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 14 [2024-11-17 00:52:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,711 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2024-11-17 00:52:01,711 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-17 00:52:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2024-11-17 00:52:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:52:01,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:52:01,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1774348436, now seen corresponding path program 1 times [2024-11-17 00:52:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201228079] [2024-11-17 00:52:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201228079] [2024-11-17 00:52:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201228079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332813408] [2024-11-17 00:52:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,752 INFO L87 Difference]: Start difference. First operand 40 states and 65 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-17 00:52:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,763 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2024-11-17 00:52:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,763 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-17 00:52:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,764 INFO L225 Difference]: With dead ends: 47 [2024-11-17 00:52:01,764 INFO L226 Difference]: Without dead ends: 47 [2024-11-17 00:52:01,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,765 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-17 00:52:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-17 00:52:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 43 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2024-11-17 00:52:01,769 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 15 [2024-11-17 00:52:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,769 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2024-11-17 00:52:01,769 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-17 00:52:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2024-11-17 00:52:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:52:01,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:52:01,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1577834931, now seen corresponding path program 1 times [2024-11-17 00:52:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742418583] [2024-11-17 00:52:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742418583] [2024-11-17 00:52:01,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742418583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652964646] [2024-11-17 00:52:01,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,803 INFO L87 Difference]: Start difference. First operand 44 states and 68 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-17 00:52:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,818 INFO L93 Difference]: Finished difference Result 78 states and 121 transitions. [2024-11-17 00:52:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,819 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-17 00:52:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,819 INFO L225 Difference]: With dead ends: 78 [2024-11-17 00:52:01,819 INFO L226 Difference]: Without dead ends: 78 [2024-11-17 00:52:01,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,820 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-17 00:52:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2024-11-17 00:52:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 56 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 89 transitions. [2024-11-17 00:52:01,831 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 89 transitions. Word has length 15 [2024-11-17 00:52:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,831 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 89 transitions. [2024-11-17 00:52:01,831 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-17 00:52:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 89 transitions. [2024-11-17 00:52:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:52:01,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:52:01,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -229619532, now seen corresponding path program 1 times [2024-11-17 00:52:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140911779] [2024-11-17 00:52:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140911779] [2024-11-17 00:52:01,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140911779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464776422] [2024-11-17 00:52:01,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,872 INFO L87 Difference]: Start difference. First operand 57 states and 89 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-17 00:52:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,883 INFO L93 Difference]: Finished difference Result 80 states and 119 transitions. [2024-11-17 00:52:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,884 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-17 00:52:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,884 INFO L225 Difference]: With dead ends: 80 [2024-11-17 00:52:01,885 INFO L226 Difference]: Without dead ends: 80 [2024-11-17 00:52:01,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,886 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-17 00:52:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-17 00:52:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 76 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-17 00:52:01,896 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 15 [2024-11-17 00:52:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,896 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-17 00:52:01,896 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-17 00:52:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-17 00:52:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:52:01,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:52:01,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1669065259, now seen corresponding path program 1 times [2024-11-17 00:52:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214883054] [2024-11-17 00:52:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:01,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214883054] [2024-11-17 00:52:01,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214883054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:01,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:01,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272724223] [2024-11-17 00:52:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:01,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:01,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:01,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,944 INFO L87 Difference]: Start difference. First operand 77 states and 117 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-17 00:52:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:01,961 INFO L93 Difference]: Finished difference Result 82 states and 119 transitions. [2024-11-17 00:52:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:01,962 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-17 00:52:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:01,962 INFO L225 Difference]: With dead ends: 82 [2024-11-17 00:52:01,962 INFO L226 Difference]: Without dead ends: 82 [2024-11-17 00:52:01,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:01,963 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:01,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 82 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-17 00:52:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-17 00:52:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.5) internal successors, (117), 78 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2024-11-17 00:52:01,971 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 16 [2024-11-17 00:52:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:01,971 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 117 transitions. [2024-11-17 00:52:01,972 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-17 00:52:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 117 transitions. [2024-11-17 00:52:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:52:01,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:01,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:01,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:52:01,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:01,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1472551754, now seen corresponding path program 1 times [2024-11-17 00:52:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615252166] [2024-11-17 00:52:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615252166] [2024-11-17 00:52:02,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615252166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87333424] [2024-11-17 00:52:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,008 INFO L87 Difference]: Start difference. First operand 79 states and 117 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-17 00:52:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,023 INFO L93 Difference]: Finished difference Result 138 states and 203 transitions. [2024-11-17 00:52:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,023 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-17 00:52:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,024 INFO L225 Difference]: With dead ends: 138 [2024-11-17 00:52:02,024 INFO L226 Difference]: Without dead ends: 138 [2024-11-17 00:52:02,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,028 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-17 00:52:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2024-11-17 00:52:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.4811320754716981) internal successors, (157), 106 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2024-11-17 00:52:02,038 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 16 [2024-11-17 00:52:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,038 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2024-11-17 00:52:02,039 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-17 00:52:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2024-11-17 00:52:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:52:02,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:02,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:52:02,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,041 INFO L85 PathProgramCache]: Analyzing trace with hash -334902709, now seen corresponding path program 1 times [2024-11-17 00:52:02,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472539194] [2024-11-17 00:52:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472539194] [2024-11-17 00:52:02,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472539194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625650520] [2024-11-17 00:52:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,070 INFO L87 Difference]: Start difference. First operand 107 states and 157 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-17 00:52:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,086 INFO L93 Difference]: Finished difference Result 146 states and 203 transitions. [2024-11-17 00:52:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,086 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-17 00:52:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,087 INFO L225 Difference]: With dead ends: 146 [2024-11-17 00:52:02,087 INFO L226 Difference]: Without dead ends: 146 [2024-11-17 00:52:02,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,088 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-17 00:52:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-17 00:52:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2024-11-17 00:52:02,096 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 16 [2024-11-17 00:52:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,096 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2024-11-17 00:52:02,096 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-17 00:52:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2024-11-17 00:52:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:52:02,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:02,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:52:02,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1594719955, now seen corresponding path program 1 times [2024-11-17 00:52:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728991140] [2024-11-17 00:52:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728991140] [2024-11-17 00:52:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728991140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544755923] [2024-11-17 00:52:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,122 INFO L87 Difference]: Start difference. First operand 143 states and 201 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-17 00:52:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,136 INFO L93 Difference]: Finished difference Result 150 states and 203 transitions. [2024-11-17 00:52:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,136 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-17 00:52:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,138 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:52:02,138 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:52:02,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,139 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:52:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-11-17 00:52:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 146 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 201 transitions. [2024-11-17 00:52:02,150 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 201 transitions. Word has length 17 [2024-11-17 00:52:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,150 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 201 transitions. [2024-11-17 00:52:02,151 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-17 00:52:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 201 transitions. [2024-11-17 00:52:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:52:02,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:02,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:52:02,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1791233460, now seen corresponding path program 1 times [2024-11-17 00:52:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904535916] [2024-11-17 00:52:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904535916] [2024-11-17 00:52:02,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904535916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816895697] [2024-11-17 00:52:02,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,193 INFO L87 Difference]: Start difference. First operand 147 states and 201 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-17 00:52:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,204 INFO L93 Difference]: Finished difference Result 250 states and 335 transitions. [2024-11-17 00:52:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,204 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-17 00:52:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,206 INFO L225 Difference]: With dead ends: 250 [2024-11-17 00:52:02,206 INFO L226 Difference]: Without dead ends: 250 [2024-11-17 00:52:02,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,207 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-17 00:52:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2024-11-17 00:52:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.3446601941747574) internal successors, (277), 206 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 277 transitions. [2024-11-17 00:52:02,220 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 277 transitions. Word has length 17 [2024-11-17 00:52:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,223 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 277 transitions. [2024-11-17 00:52:02,223 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-17 00:52:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 277 transitions. [2024-11-17 00:52:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:52:02,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:02,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:52:02,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash 696279373, now seen corresponding path program 1 times [2024-11-17 00:52:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171436290] [2024-11-17 00:52:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171436290] [2024-11-17 00:52:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171436290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638837311] [2024-11-17 00:52:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,254 INFO L87 Difference]: Start difference. First operand 207 states and 277 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-17 00:52:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,263 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2024-11-17 00:52:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,263 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-17 00:52:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,264 INFO L225 Difference]: With dead ends: 274 [2024-11-17 00:52:02,264 INFO L226 Difference]: Without dead ends: 274 [2024-11-17 00:52:02,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,266 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-17 00:52:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2024-11-17 00:52:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.262962962962963) internal successors, (341), 270 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 341 transitions. [2024-11-17 00:52:02,272 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 341 transitions. Word has length 17 [2024-11-17 00:52:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,272 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 341 transitions. [2024-11-17 00:52:02,272 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-17 00:52:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 341 transitions. [2024-11-17 00:52:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:52:02,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,273 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-17 00:52:02,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:52:02,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,274 INFO L85 PathProgramCache]: Analyzing trace with hash 307146788, now seen corresponding path program 1 times [2024-11-17 00:52:02,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855101284] [2024-11-17 00:52:02,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855101284] [2024-11-17 00:52:02,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855101284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399217617] [2024-11-17 00:52:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,297 INFO L87 Difference]: Start difference. First operand 271 states and 341 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-17 00:52:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,307 INFO L93 Difference]: Finished difference Result 282 states and 343 transitions. [2024-11-17 00:52:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,308 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-17 00:52:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,309 INFO L225 Difference]: With dead ends: 282 [2024-11-17 00:52:02,309 INFO L226 Difference]: Without dead ends: 282 [2024-11-17 00:52:02,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,309 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-17 00:52:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2024-11-17 00:52:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.2266187050359711) internal successors, (341), 278 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 341 transitions. [2024-11-17 00:52:02,314 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 341 transitions. Word has length 18 [2024-11-17 00:52:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,315 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 341 transitions. [2024-11-17 00:52:02,315 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-17 00:52:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 341 transitions. [2024-11-17 00:52:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:52:02,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,316 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-17 00:52:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:52:02,316 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 110633283, now seen corresponding path program 1 times [2024-11-17 00:52:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552295593] [2024-11-17 00:52:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552295593] [2024-11-17 00:52:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552295593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141707753] [2024-11-17 00:52:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,334 INFO L87 Difference]: Start difference. First operand 279 states and 341 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-17 00:52:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,342 INFO L93 Difference]: Finished difference Result 455 states and 533 transitions. [2024-11-17 00:52:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,342 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-17 00:52:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,344 INFO L225 Difference]: With dead ends: 455 [2024-11-17 00:52:02,344 INFO L226 Difference]: Without dead ends: 455 [2024-11-17 00:52:02,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,344 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-17 00:52:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 407. [2024-11-17 00:52:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.1945812807881773) internal successors, (485), 406 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 485 transitions. [2024-11-17 00:52:02,353 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 485 transitions. Word has length 18 [2024-11-17 00:52:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,353 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 485 transitions. [2024-11-17 00:52:02,353 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-17 00:52:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 485 transitions. [2024-11-17 00:52:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:52:02,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:02,355 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-17 00:52:02,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:52:02,355 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:02,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1696821180, now seen corresponding path program 1 times [2024-11-17 00:52:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:02,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824629146] [2024-11-17 00:52:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:02,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824629146] [2024-11-17 00:52:02,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824629146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:02,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622446431] [2024-11-17 00:52:02,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:02,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:02,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,380 INFO L87 Difference]: Start difference. First operand 407 states and 485 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-17 00:52:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:02,390 INFO L93 Difference]: Finished difference Result 516 states and 563 transitions. [2024-11-17 00:52:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:02,390 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-17 00:52:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:02,390 INFO L225 Difference]: With dead ends: 516 [2024-11-17 00:52:02,390 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 00:52:02,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:02,391 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:02,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 78 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 00:52:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 00:52:02,393 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-17 00:52:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 00:52:02,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-11-17 00:52:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:02,393 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 00:52:02,393 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-17 00:52:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 00:52:02,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 00:52:02,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-17 00:52:02,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-17 00:52:02,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:52:02,399 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:02,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:52:02,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:52:02 BoogieIcfgContainer [2024-11-17 00:52:02,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:52:02,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:52:02,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:52:02,406 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:52:02,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:01" (3/4) ... [2024-11-17 00:52:02,408 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 00:52:02,414 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-17 00:52:02,416 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-17 00:52:02,416 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 00:52:02,417 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 00:52:02,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:52:02,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 00:52:02,491 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:52:02,491 INFO L158 Benchmark]: Toolchain (without parser) took 1824.55ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 104.2MB in the beginning and 144.8MB in the end (delta: -40.6MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,491 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:52:02,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.41ms. Allocated memory is still 176.2MB. Free memory was 104.1MB in the beginning and 91.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.22ms. Allocated memory is still 176.2MB. Free memory was 91.6MB in the beginning and 90.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,492 INFO L158 Benchmark]: Boogie Preprocessor took 34.50ms. Allocated memory is still 176.2MB. Free memory was 90.0MB in the beginning and 88.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:52:02,492 INFO L158 Benchmark]: IcfgBuilder took 313.45ms. Allocated memory is still 176.2MB. Free memory was 88.5MB in the beginning and 133.7MB in the end (delta: -45.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,492 INFO L158 Benchmark]: TraceAbstraction took 1140.93ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 133.7MB in the beginning and 149.0MB in the end (delta: -15.3MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,492 INFO L158 Benchmark]: Witness Printer took 85.75ms. Allocated memory is still 218.1MB. Free memory was 149.0MB in the beginning and 144.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 00:52:02,493 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.14ms. Allocated memory is still 176.2MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.41ms. Allocated memory is still 176.2MB. Free memory was 104.1MB in the beginning and 91.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.22ms. Allocated memory is still 176.2MB. Free memory was 91.6MB in the beginning and 90.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.50ms. Allocated memory is still 176.2MB. Free memory was 90.0MB in the beginning and 88.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 313.45ms. Allocated memory is still 176.2MB. Free memory was 88.5MB in the beginning and 133.7MB in the end (delta: -45.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1140.93ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 133.7MB in the beginning and 149.0MB in the end (delta: -15.3MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Witness Printer took 85.75ms. Allocated memory is still 218.1MB. Free memory was 149.0MB in the beginning and 144.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: 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.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 1143 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 407 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 736 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=15, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 181 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-17 00:52:02,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE