./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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_7.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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:46:04,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:46:04,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:46:04,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:46:04,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:46:04,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:46:04,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:46:04,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:46:04,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:46:04,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:46:04,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:46:04,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:46:04,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:46:04,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:46:04,249 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:46:04,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:46:04,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:46:04,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:46:04,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:46:04,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:46:04,251 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:46:04,254 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:46:04,255 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:46:04,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:46:04,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:46:04,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:46:04,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:46:04,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:46:04,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:46:04,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:46:04,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:46:04,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:46:04,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:46:04,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:46:04,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:46:04,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:46:04,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:46:04,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:46:04,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:46:04,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:46:04,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:46:04,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:46:04,260 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2024-11-12 13:46:04,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:46:04,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:46:04,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:46:04,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:46:04,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:46:04,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2024-11-12 13:46:06,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:46:06,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:46:06,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-11-12 13:46:06,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3d3cabc/c344b64ec96545ffb03069e7c15e7bad/FLAGaec280f17 [2024-11-12 13:46:06,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3d3cabc/c344b64ec96545ffb03069e7c15e7bad [2024-11-12 13:46:06,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:46:06,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:46:06,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:46:06,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:46:06,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:46:06,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7655ce9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06, skipping insertion in model container [2024-11-12 13:46:06,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:46:06,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:46:06,426 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:46:06,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:46:06,462 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:46:06,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06 WrapperNode [2024-11-12 13:46:06,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:46:06,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:46:06,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:46:06,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:46:06,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,496 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2024-11-12 13:46:06,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:46:06,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:46:06,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:46:06,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:46:06,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,521 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-12 13:46:06,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:46:06,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:46:06,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:46:06,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:46:06,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (1/1) ... [2024-11-12 13:46:06,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:46:06,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:46:06,572 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-12 13:46:06,574 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-12 13:46:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:46:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:46:06,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:46:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:46:06,680 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:46:06,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:46:06,860 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 13:46:06,861 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:46:06,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:46:06,874 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 13:46:06,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:46:06 BoogieIcfgContainer [2024-11-12 13:46:06,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:46:06,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:46:06,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:46:06,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:46:06,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:46:06" (1/3) ... [2024-11-12 13:46:06,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d195b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:46:06, skipping insertion in model container [2024-11-12 13:46:06,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:06" (2/3) ... [2024-11-12 13:46:06,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d195b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:46:06, skipping insertion in model container [2024-11-12 13:46:06,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:46:06" (3/3) ... [2024-11-12 13:46:06,883 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2024-11-12 13:46:06,902 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:46:06,903 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 13:46:06,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:46:06,989 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;@5175ad9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:46:06,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 13:46:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:46:07,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:46:07,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash 28701838, now seen corresponding path program 1 times [2024-11-12 13:46:07,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472944335] [2024-11-12 13:46:07,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,219 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-12 13:46:07,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472944335] [2024-11-12 13:46:07,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472944335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:46:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636214845] [2024-11-12 13:46:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:46:07,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:46:07,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:46:07,263 INFO L87 Difference]: Start difference. First operand has 34 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,278 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2024-11-12 13:46:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:46:07,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:46:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,288 INFO L225 Difference]: With dead ends: 33 [2024-11-12 13:46:07,288 INFO L226 Difference]: Without dead ends: 31 [2024-11-12 13:46:07,290 INFO L434 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-12 13:46:07,293 INFO L435 NwaCegarLoop]: 53 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, 53 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-12 13:46:07,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-12 13:46:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-12 13:46:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2024-11-12 13:46:07,331 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 5 [2024-11-12 13:46:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,332 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2024-11-12 13:46:07,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2024-11-12 13:46:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:46:07,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:46:07,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,335 INFO L85 PathProgramCache]: Analyzing trace with hash 889696334, now seen corresponding path program 1 times [2024-11-12 13:46:07,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547852416] [2024-11-12 13:46:07,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,400 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-12 13:46:07,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547852416] [2024-11-12 13:46:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547852416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:46:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118662607] [2024-11-12 13:46:07,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,404 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,418 INFO L93 Difference]: Finished difference Result 30 states and 50 transitions. [2024-11-12 13:46:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:46:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,419 INFO L225 Difference]: With dead ends: 30 [2024-11-12 13:46:07,419 INFO L226 Difference]: Without dead ends: 28 [2024-11-12 13:46:07,420 INFO L434 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-12 13:46:07,421 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 50 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-12 13:46:07,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-12 13:46:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-12 13:46:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 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-12 13:46:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2024-11-12 13:46:07,426 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 6 [2024-11-12 13:46:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,426 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 48 transitions. [2024-11-12 13:46:07,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-12 13:46:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:46:07,428 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:46:07,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1577493021, now seen corresponding path program 1 times [2024-11-12 13:46:07,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110990210] [2024-11-12 13:46:07,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,516 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-12 13:46:07,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110990210] [2024-11-12 13:46:07,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110990210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095036557] [2024-11-12 13:46:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,522 INFO L87 Difference]: Start difference. First operand 28 states and 48 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-12 13:46:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,557 INFO L93 Difference]: Finished difference Result 53 states and 91 transitions. [2024-11-12 13:46:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,558 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-12 13:46:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,559 INFO L225 Difference]: With dead ends: 53 [2024-11-12 13:46:07,559 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 13:46:07,560 INFO L434 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-12 13:46:07,562 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 94 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-12 13:46:07,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 94 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 13:46:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2024-11-12 13:46:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2024-11-12 13:46:07,575 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 63 transitions. Word has length 15 [2024-11-12 13:46:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,575 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 63 transitions. [2024-11-12 13:46:07,576 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-12 13:46:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 63 transitions. [2024-11-12 13:46:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:46:07,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:46:07,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash -876428443, now seen corresponding path program 1 times [2024-11-12 13:46:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635023587] [2024-11-12 13:46:07,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,651 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-12 13:46:07,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635023587] [2024-11-12 13:46:07,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635023587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504736849] [2024-11-12 13:46:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,654 INFO L87 Difference]: Start difference. First operand 36 states and 63 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-12 13:46:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,677 INFO L93 Difference]: Finished difference Result 53 states and 89 transitions. [2024-11-12 13:46:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,678 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-12 13:46:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,679 INFO L225 Difference]: With dead ends: 53 [2024-11-12 13:46:07,679 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 13:46:07,679 INFO L434 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-12 13:46:07,680 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 103 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-12 13:46:07,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 13:46:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-12 13:46:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 87 transitions. [2024-11-12 13:46:07,688 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 87 transitions. Word has length 15 [2024-11-12 13:46:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,689 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 87 transitions. [2024-11-12 13:46:07,689 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-12 13:46:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 87 transitions. [2024-11-12 13:46:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:46:07,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:46:07,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1651003735, now seen corresponding path program 1 times [2024-11-12 13:46:07,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953012372] [2024-11-12 13:46:07,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:07,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953012372] [2024-11-12 13:46:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953012372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778449148] [2024-11-12 13:46:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,766 INFO L87 Difference]: Start difference. First operand 50 states and 87 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-12 13:46:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,786 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2024-11-12 13:46:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,787 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-12 13:46:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,787 INFO L225 Difference]: With dead ends: 56 [2024-11-12 13:46:07,788 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 13:46:07,788 INFO L434 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-12 13:46:07,789 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 115 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-12 13:46:07,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 13:46:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-12 13:46:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 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-12 13:46:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 89 transitions. [2024-11-12 13:46:07,796 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 89 transitions. Word has length 16 [2024-11-12 13:46:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,797 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 89 transitions. [2024-11-12 13:46:07,797 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-12 13:46:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 89 transitions. [2024-11-12 13:46:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:46:07,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:46:07,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1392838297, now seen corresponding path program 1 times [2024-11-12 13:46:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747241676] [2024-11-12 13:46:07,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747241676] [2024-11-12 13:46:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747241676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966023259] [2024-11-12 13:46:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,847 INFO L87 Difference]: Start difference. First operand 53 states and 89 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-12 13:46:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,860 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-11-12 13:46:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,861 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-12 13:46:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,862 INFO L225 Difference]: With dead ends: 97 [2024-11-12 13:46:07,862 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 13:46:07,863 INFO L434 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-12 13:46:07,863 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 92 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-12 13:46:07,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 92 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 13:46:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 70. [2024-11-12 13:46:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2024-11-12 13:46:07,872 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 16 [2024-11-12 13:46:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,873 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2024-11-12 13:46:07,873 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-12 13:46:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2024-11-12 13:46:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:46:07,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:46:07,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash -691773719, now seen corresponding path program 1 times [2024-11-12 13:46:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634117067] [2024-11-12 13:46:07,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,921 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-12 13:46:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634117067] [2024-11-12 13:46:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634117067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159444068] [2024-11-12 13:46:07,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,923 INFO L87 Difference]: Start difference. First operand 70 states and 118 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-12 13:46:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,945 INFO L93 Difference]: Finished difference Result 99 states and 162 transitions. [2024-11-12 13:46:07,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,945 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-12 13:46:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,946 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:46:07,946 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 13:46:07,947 INFO L434 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-12 13:46:07,950 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 104 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-12 13:46:07,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 13:46:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-12 13:46:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 160 transitions. [2024-11-12 13:46:07,963 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 160 transitions. Word has length 16 [2024-11-12 13:46:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,963 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 160 transitions. [2024-11-12 13:46:07,963 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-12 13:46:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 160 transitions. [2024-11-12 13:46:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:46:07,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:07,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:46:07,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,965 INFO L85 PathProgramCache]: Analyzing trace with hash -221664016, now seen corresponding path program 1 times [2024-11-12 13:46:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992412865] [2024-11-12 13:46:07,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992412865] [2024-11-12 13:46:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992412865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518731587] [2024-11-12 13:46:08,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,018 INFO L87 Difference]: Start difference. First operand 96 states and 160 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-12 13:46:08,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,036 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2024-11-12 13:46:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,037 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-12 13:46:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,038 INFO L225 Difference]: With dead ends: 101 [2024-11-12 13:46:08,038 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 13:46:08,038 INFO L434 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-12 13:46:08,039 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 111 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-12 13:46:08,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 13:46:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-12 13:46:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 160 transitions. [2024-11-12 13:46:08,051 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 160 transitions. Word has length 17 [2024-11-12 13:46:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,052 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 160 transitions. [2024-11-12 13:46:08,052 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-12 13:46:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 160 transitions. [2024-11-12 13:46:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:46:08,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:46:08,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 36501422, now seen corresponding path program 1 times [2024-11-12 13:46:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013637668] [2024-11-12 13:46:08,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,101 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-12 13:46:08,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013637668] [2024-11-12 13:46:08,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013637668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858766763] [2024-11-12 13:46:08,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,103 INFO L87 Difference]: Start difference. First operand 98 states and 160 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-12 13:46:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,124 INFO L93 Difference]: Finished difference Result 185 states and 294 transitions. [2024-11-12 13:46:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,125 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-12 13:46:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,125 INFO L225 Difference]: With dead ends: 185 [2024-11-12 13:46:08,126 INFO L226 Difference]: Without dead ends: 185 [2024-11-12 13:46:08,126 INFO L434 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-12 13:46:08,126 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 94 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-12 13:46:08,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 94 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-12 13:46:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-12 13:46:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.6132596685082874) internal successors, (292), 181 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 292 transitions. [2024-11-12 13:46:08,139 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 292 transitions. Word has length 17 [2024-11-12 13:46:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,139 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 292 transitions. [2024-11-12 13:46:08,139 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-12 13:46:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 292 transitions. [2024-11-12 13:46:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:46:08,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:46:08,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash -664563156, now seen corresponding path program 1 times [2024-11-12 13:46:08,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449659449] [2024-11-12 13:46:08,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:08,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449659449] [2024-11-12 13:46:08,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449659449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209115139] [2024-11-12 13:46:08,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,170 INFO L87 Difference]: Start difference. First operand 182 states and 292 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-12 13:46:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,182 INFO L93 Difference]: Finished difference Result 225 states and 362 transitions. [2024-11-12 13:46:08,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,183 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-12 13:46:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,184 INFO L225 Difference]: With dead ends: 225 [2024-11-12 13:46:08,184 INFO L226 Difference]: Without dead ends: 225 [2024-11-12 13:46:08,184 INFO L434 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-12 13:46:08,185 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:08,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-12 13:46:08,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 182. [2024-11-12 13:46:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 288 transitions. [2024-11-12 13:46:08,198 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 288 transitions. Word has length 17 [2024-11-12 13:46:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,198 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 288 transitions. [2024-11-12 13:46:08,202 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-12 13:46:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 288 transitions. [2024-11-12 13:46:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:46:08,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:46:08,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1138204884, now seen corresponding path program 1 times [2024-11-12 13:46:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554238996] [2024-11-12 13:46:08,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,243 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-12 13:46:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554238996] [2024-11-12 13:46:08,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554238996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386488897] [2024-11-12 13:46:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,248 INFO L87 Difference]: Start difference. First operand 182 states and 288 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-12 13:46:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,262 INFO L93 Difference]: Finished difference Result 325 states and 514 transitions. [2024-11-12 13:46:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,262 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-12 13:46:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,264 INFO L225 Difference]: With dead ends: 325 [2024-11-12 13:46:08,264 INFO L226 Difference]: Without dead ends: 325 [2024-11-12 13:46:08,264 INFO L434 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-12 13:46:08,265 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 88 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-12 13:46:08,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-12 13:46:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 258. [2024-11-12 13:46:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.556420233463035) internal successors, (400), 257 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 400 transitions. [2024-11-12 13:46:08,274 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 400 transitions. Word has length 18 [2024-11-12 13:46:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,274 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 400 transitions. [2024-11-12 13:46:08,274 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-12 13:46:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 400 transitions. [2024-11-12 13:46:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:46:08,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:46:08,277 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1839269462, now seen corresponding path program 1 times [2024-11-12 13:46:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311928438] [2024-11-12 13:46:08,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,302 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-12 13:46:08,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311928438] [2024-11-12 13:46:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311928438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516132212] [2024-11-12 13:46:08,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,330 INFO L87 Difference]: Start difference. First operand 258 states and 400 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-12 13:46:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,345 INFO L93 Difference]: Finished difference Result 349 states and 526 transitions. [2024-11-12 13:46:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,345 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-12 13:46:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,347 INFO L225 Difference]: With dead ends: 349 [2024-11-12 13:46:08,348 INFO L226 Difference]: Without dead ends: 349 [2024-11-12 13:46:08,348 INFO L434 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-12 13:46:08,351 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 106 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-12 13:46:08,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-12 13:46:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2024-11-12 13:46:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.518840579710145) internal successors, (524), 345 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 524 transitions. [2024-11-12 13:46:08,358 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 524 transitions. Word has length 18 [2024-11-12 13:46:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,358 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 524 transitions. [2024-11-12 13:46:08,358 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-12 13:46:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 524 transitions. [2024-11-12 13:46:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:46:08,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:46:08,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash 931284409, now seen corresponding path program 1 times [2024-11-12 13:46:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110561129] [2024-11-12 13:46:08,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,392 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-12 13:46:08,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110561129] [2024-11-12 13:46:08,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110561129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967178250] [2024-11-12 13:46:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,393 INFO L87 Difference]: Start difference. First operand 346 states and 524 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,407 INFO L93 Difference]: Finished difference Result 361 states and 534 transitions. [2024-11-12 13:46:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 13:46:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,409 INFO L225 Difference]: With dead ends: 361 [2024-11-12 13:46:08,409 INFO L226 Difference]: Without dead ends: 361 [2024-11-12 13:46:08,410 INFO L434 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-12 13:46:08,411 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 33 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 103 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-12 13:46:08,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-12 13:46:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 358. [2024-11-12 13:46:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 532 transitions. [2024-11-12 13:46:08,417 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 532 transitions. Word has length 19 [2024-11-12 13:46:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,418 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 532 transitions. [2024-11-12 13:46:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 532 transitions. [2024-11-12 13:46:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:46:08,418 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:46:08,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1189449847, now seen corresponding path program 1 times [2024-11-12 13:46:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795522890] [2024-11-12 13:46:08,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,447 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-12 13:46:08,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795522890] [2024-11-12 13:46:08,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795522890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958655588] [2024-11-12 13:46:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,450 INFO L87 Difference]: Start difference. First operand 358 states and 532 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,461 INFO L93 Difference]: Finished difference Result 617 states and 910 transitions. [2024-11-12 13:46:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 13:46:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,464 INFO L225 Difference]: With dead ends: 617 [2024-11-12 13:46:08,464 INFO L226 Difference]: Without dead ends: 617 [2024-11-12 13:46:08,464 INFO L434 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-12 13:46:08,465 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 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-12 13:46:08,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-12 13:46:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 518. [2024-11-12 13:46:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 748 transitions. [2024-11-12 13:46:08,477 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 748 transitions. Word has length 19 [2024-11-12 13:46:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,477 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 748 transitions. [2024-11-12 13:46:08,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 748 transitions. [2024-11-12 13:46:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:46:08,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:46:08,479 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1890514425, now seen corresponding path program 1 times [2024-11-12 13:46:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65334877] [2024-11-12 13:46:08,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,502 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-12 13:46:08,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65334877] [2024-11-12 13:46:08,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65334877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227683694] [2024-11-12 13:46:08,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,505 INFO L87 Difference]: Start difference. First operand 518 states and 748 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,522 INFO L93 Difference]: Finished difference Result 681 states and 950 transitions. [2024-11-12 13:46:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 13:46:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,525 INFO L225 Difference]: With dead ends: 681 [2024-11-12 13:46:08,525 INFO L226 Difference]: Without dead ends: 681 [2024-11-12 13:46:08,527 INFO L434 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-12 13:46:08,527 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 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-12 13:46:08,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-12 13:46:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 678. [2024-11-12 13:46:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 948 transitions. [2024-11-12 13:46:08,540 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 948 transitions. Word has length 19 [2024-11-12 13:46:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,541 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 948 transitions. [2024-11-12 13:46:08,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 948 transitions. [2024-11-12 13:46:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:46:08,543 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:46:08,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1775078463, now seen corresponding path program 1 times [2024-11-12 13:46:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256523518] [2024-11-12 13:46:08,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,568 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-12 13:46:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256523518] [2024-11-12 13:46:08,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256523518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553039981] [2024-11-12 13:46:08,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,570 INFO L87 Difference]: Start difference. First operand 678 states and 948 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,582 INFO L93 Difference]: Finished difference Result 697 states and 950 transitions. [2024-11-12 13:46:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-12 13:46:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,585 INFO L225 Difference]: With dead ends: 697 [2024-11-12 13:46:08,585 INFO L226 Difference]: Without dead ends: 697 [2024-11-12 13:46:08,585 INFO L434 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-12 13:46:08,586 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:08,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-12 13:46:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2024-11-12 13:46:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 948 transitions. [2024-11-12 13:46:08,597 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 948 transitions. Word has length 20 [2024-11-12 13:46:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,598 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 948 transitions. [2024-11-12 13:46:08,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 948 transitions. [2024-11-12 13:46:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:46:08,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:46:08,600 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1516913025, now seen corresponding path program 1 times [2024-11-12 13:46:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853397296] [2024-11-12 13:46:08,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,634 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-12 13:46:08,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853397296] [2024-11-12 13:46:08,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853397296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742030556] [2024-11-12 13:46:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,635 INFO L87 Difference]: Start difference. First operand 694 states and 948 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,649 INFO L93 Difference]: Finished difference Result 1161 states and 1558 transitions. [2024-11-12 13:46:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-12 13:46:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,653 INFO L225 Difference]: With dead ends: 1161 [2024-11-12 13:46:08,653 INFO L226 Difference]: Without dead ends: 1161 [2024-11-12 13:46:08,653 INFO L434 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-12 13:46:08,653 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 84 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-12 13:46:08,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 84 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-12 13:46:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1030. [2024-11-12 13:46:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1364 transitions. [2024-11-12 13:46:08,670 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1364 transitions. Word has length 20 [2024-11-12 13:46:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,670 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1364 transitions. [2024-11-12 13:46:08,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1364 transitions. [2024-11-12 13:46:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:46:08,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:46:08,672 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash -815848447, now seen corresponding path program 1 times [2024-11-12 13:46:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209517814] [2024-11-12 13:46:08,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,705 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-12 13:46:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209517814] [2024-11-12 13:46:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209517814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507531590] [2024-11-12 13:46:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,707 INFO L87 Difference]: Start difference. First operand 1030 states and 1364 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,727 INFO L93 Difference]: Finished difference Result 1321 states and 1670 transitions. [2024-11-12 13:46:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-12 13:46:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,732 INFO L225 Difference]: With dead ends: 1321 [2024-11-12 13:46:08,733 INFO L226 Difference]: Without dead ends: 1321 [2024-11-12 13:46:08,733 INFO L434 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-12 13:46:08,734 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 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-12 13:46:08,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2024-11-12 13:46:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1318. [2024-11-12 13:46:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1668 transitions. [2024-11-12 13:46:08,758 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1668 transitions. Word has length 20 [2024-11-12 13:46:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,758 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1668 transitions. [2024-11-12 13:46:08,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1668 transitions. [2024-11-12 13:46:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:46:08,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:46:08,760 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash 227028996, now seen corresponding path program 1 times [2024-11-12 13:46:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553663369] [2024-11-12 13:46:08,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,783 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-12 13:46:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553663369] [2024-11-12 13:46:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553663369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146461513] [2024-11-12 13:46:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,785 INFO L87 Difference]: Start difference. First operand 1318 states and 1668 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,798 INFO L93 Difference]: Finished difference Result 1353 states and 1670 transitions. [2024-11-12 13:46:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-12 13:46:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,802 INFO L225 Difference]: With dead ends: 1353 [2024-11-12 13:46:08,821 INFO L226 Difference]: Without dead ends: 1353 [2024-11-12 13:46:08,821 INFO L434 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-12 13:46:08,822 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:08,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-12 13:46:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1350. [2024-11-12 13:46:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1668 transitions. [2024-11-12 13:46:08,843 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1668 transitions. Word has length 21 [2024-11-12 13:46:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,844 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1668 transitions. [2024-11-12 13:46:08,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1668 transitions. [2024-11-12 13:46:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:46:08,846 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:46:08,847 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 485194434, now seen corresponding path program 1 times [2024-11-12 13:46:08,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437291636] [2024-11-12 13:46:08,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,868 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-12 13:46:08,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437291636] [2024-11-12 13:46:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437291636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892729857] [2024-11-12 13:46:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,869 INFO L87 Difference]: Start difference. First operand 1350 states and 1668 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,889 INFO L93 Difference]: Finished difference Result 2182 states and 2596 transitions. [2024-11-12 13:46:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-12 13:46:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,896 INFO L225 Difference]: With dead ends: 2182 [2024-11-12 13:46:08,896 INFO L226 Difference]: Without dead ends: 2182 [2024-11-12 13:46:08,897 INFO L434 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-12 13:46:08,897 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:08,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-11-12 13:46:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2054. [2024-11-12 13:46:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2468 transitions. [2024-11-12 13:46:08,931 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2468 transitions. Word has length 21 [2024-11-12 13:46:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,931 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2468 transitions. [2024-11-12 13:46:08,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2468 transitions. [2024-11-12 13:46:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:46:08,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:46:08,934 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1186259012, now seen corresponding path program 1 times [2024-11-12 13:46:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203559393] [2024-11-12 13:46:08,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,952 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-12 13:46:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203559393] [2024-11-12 13:46:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203559393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049202796] [2024-11-12 13:46:08,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,954 INFO L87 Difference]: Start difference. First operand 2054 states and 2468 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,976 INFO L93 Difference]: Finished difference Result 2563 states and 2882 transitions. [2024-11-12 13:46:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-12 13:46:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:08,977 INFO L225 Difference]: With dead ends: 2563 [2024-11-12 13:46:08,977 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 13:46:08,977 INFO L434 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-12 13:46:08,978 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 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-12 13:46:08,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 13:46:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 13:46:08,980 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-12 13:46:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 13:46:08,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2024-11-12 13:46:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,982 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 13:46:08,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 13:46:08,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 13:46:08,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-12 13:46:08,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-12 13:46:08,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:46:08,989 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:08,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 13:46:08,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:46:08 BoogieIcfgContainer [2024-11-12 13:46:08,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 13:46:08,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 13:46:08,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 13:46:08,996 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 13:46:08,997 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:46:06" (3/4) ... [2024-11-12 13:46:08,999 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 13:46:09,009 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-12 13:46:09,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-12 13:46:09,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 13:46:09,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 13:46:09,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 13:46:09,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 13:46:09,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 13:46:09,098 INFO L158 Benchmark]: Toolchain (without parser) took 2879.02ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 89.9MB in the end (delta: 15.9MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,098 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:46:09,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.38ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 93.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.97ms. Allocated memory is still 176.2MB. Free memory was 93.0MB in the beginning and 91.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,099 INFO L158 Benchmark]: Boogie Preprocessor took 35.55ms. Allocated memory is still 176.2MB. Free memory was 91.2MB in the beginning and 89.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,100 INFO L158 Benchmark]: RCFGBuilder took 341.27ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 75.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,100 INFO L158 Benchmark]: TraceAbstraction took 2118.28ms. Allocated memory is still 176.2MB. Free memory was 74.7MB in the beginning and 95.2MB in the end (delta: -20.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:46:09,100 INFO L158 Benchmark]: Witness Printer took 102.20ms. Allocated memory is still 176.2MB. Free memory was 95.2MB in the beginning and 89.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 13:46:09,101 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.18ms. Allocated memory is still 117.4MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.38ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 93.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.97ms. Allocated memory is still 176.2MB. Free memory was 93.0MB in the beginning and 91.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.55ms. Allocated memory is still 176.2MB. Free memory was 91.2MB in the beginning and 89.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.27ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 75.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2118.28ms. Allocated memory is still 176.2MB. Free memory was 74.7MB in the beginning and 95.2MB in the end (delta: -20.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 102.20ms. Allocated memory is still 176.2MB. Free memory was 95.2MB in the beginning and 89.9MB in the end (delta: 5.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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 1996 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 743 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1253 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2054occurred in iteration=20, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 545 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-12 13:46:09,127 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