./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 19:05:20,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 19:05:20,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 19:05:20,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 19:05:20,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 19:05:20,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 19:05:20,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 19:05:20,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 19:05:20,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 19:05:20,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 19:05:20,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 19:05:20,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 19:05:20,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 19:05:20,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 19:05:20,486 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 19:05:20,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 19:05:20,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 19:05:20,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 19:05:20,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 19:05:20,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 19:05:20,489 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 19:05:20,491 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 19:05:20,491 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 19:05:20,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 19:05:20,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 19:05:20,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 19:05:20,492 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 19:05:20,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 19:05:20,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 19:05:20,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 19:05:20,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 19:05:20,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 19:05:20,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 19:05:20,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:05:20,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 19:05:20,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 19:05:20,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 19:05:20,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 19:05:20,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 19:05:20,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 19:05:20,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 19:05:20,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 19:05:20,496 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2024-11-22 19:05:20,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 19:05:20,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 19:05:20,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 19:05:20,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 19:05:20,728 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 19:05:20,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2024-11-22 19:05:22,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 19:05:22,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 19:05:22,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2024-11-22 19:05:22,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10f30098/b83e410defa74e4aabff6ea4e23330c0/FLAGd0e2247ce [2024-11-22 19:05:22,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10f30098/b83e410defa74e4aabff6ea4e23330c0 [2024-11-22 19:05:22,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 19:05:22,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 19:05:22,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 19:05:22,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 19:05:22,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 19:05:22,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa404ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22, skipping insertion in model container [2024-11-22 19:05:22,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 19:05:22,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:05:22,834 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 19:05:22,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:05:22,867 INFO L204 MainTranslator]: Completed translation [2024-11-22 19:05:22,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22 WrapperNode [2024-11-22 19:05:22,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 19:05:22,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 19:05:22,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 19:05:22,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 19:05:22,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,909 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 173 [2024-11-22 19:05:22,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 19:05:22,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 19:05:22,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 19:05:22,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 19:05:22,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,930 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-22 19:05:22,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 19:05:22,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 19:05:22,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 19:05:22,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 19:05:22,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (1/1) ... [2024-11-22 19:05:22,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:05:22,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:05:22,969 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-22 19:05:22,972 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-22 19:05:23,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 19:05:23,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 19:05:23,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 19:05:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 19:05:23,061 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 19:05:23,063 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 19:05:23,279 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-22 19:05:23,283 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 19:05:23,302 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 19:05:23,306 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 19:05:23,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:23 BoogieIcfgContainer [2024-11-22 19:05:23,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 19:05:23,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 19:05:23,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 19:05:23,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 19:05:23,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:05:22" (1/3) ... [2024-11-22 19:05:23,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2052f36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:05:23, skipping insertion in model container [2024-11-22 19:05:23,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:22" (2/3) ... [2024-11-22 19:05:23,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2052f36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:05:23, skipping insertion in model container [2024-11-22 19:05:23,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:23" (3/3) ... [2024-11-22 19:05:23,316 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2024-11-22 19:05:23,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 19:05:23,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 19:05:23,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 19:05:23,383 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;@71950109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 19:05:23,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 19:05:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 46 states have (on average 1.891304347826087) internal successors, (87), 48 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-22 19:05:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 19:05:23,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 19:05:23,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 28704558, now seen corresponding path program 1 times [2024-11-22 19:05:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543305152] [2024-11-22 19:05:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,542 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-22 19:05:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543305152] [2024-11-22 19:05:23,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543305152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:05:23,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566158678] [2024-11-22 19:05:23,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 19:05:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 19:05:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 19:05:23,580 INFO L87 Difference]: Start difference. First operand has 49 states, 46 states have (on average 1.891304347826087) internal successors, (87), 48 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) 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-22 19:05:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,592 INFO L93 Difference]: Finished difference Result 48 states and 83 transitions. [2024-11-22 19:05:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 19:05:23,593 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-22 19:05:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,599 INFO L225 Difference]: With dead ends: 48 [2024-11-22 19:05:23,599 INFO L226 Difference]: Without dead ends: 46 [2024-11-22 19:05:23,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 19:05:23,603 INFO L432 NwaCegarLoop]: 83 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, 83 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-22 19:05:23,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-22 19:05:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-22 19:05:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2024-11-22 19:05:23,630 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 5 [2024-11-22 19:05:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,630 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2024-11-22 19:05:23,630 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-22 19:05:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2024-11-22 19:05:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 19:05:23,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 19:05:23,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 889699054, now seen corresponding path program 1 times [2024-11-22 19:05:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652345363] [2024-11-22 19:05:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,697 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-22 19:05:23,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652345363] [2024-11-22 19:05:23,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652345363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:05:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327076866] [2024-11-22 19:05:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,703 INFO L87 Difference]: Start difference. First operand 46 states and 81 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-22 19:05:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,712 INFO L93 Difference]: Finished difference Result 45 states and 80 transitions. [2024-11-22 19:05:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,713 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-22 19:05:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,713 INFO L225 Difference]: With dead ends: 45 [2024-11-22 19:05:23,713 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 19:05:23,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,715 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 80 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-22 19:05:23,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 19:05:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-22 19:05:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2024-11-22 19:05:23,719 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 6 [2024-11-22 19:05:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,720 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2024-11-22 19:05:23,720 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-22 19:05:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2024-11-22 19:05:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 19:05:23,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 19:05:23,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1359893460, now seen corresponding path program 1 times [2024-11-22 19:05:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001505616] [2024-11-22 19:05:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,788 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-22 19:05:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001505616] [2024-11-22 19:05:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001505616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128343217] [2024-11-22 19:05:23,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,792 INFO L87 Difference]: Start difference. First operand 43 states and 78 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-22 19:05:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,818 INFO L93 Difference]: Finished difference Result 83 states and 151 transitions. [2024-11-22 19:05:23,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,819 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-22 19:05:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,820 INFO L225 Difference]: With dead ends: 83 [2024-11-22 19:05:23,821 INFO L226 Difference]: Without dead ends: 83 [2024-11-22 19:05:23,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,822 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 154 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-22 19:05:23,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-22 19:05:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2024-11-22 19:05:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 103 transitions. [2024-11-22 19:05:23,837 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 103 transitions. Word has length 20 [2024-11-22 19:05:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,838 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 103 transitions. [2024-11-22 19:05:23,838 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-22 19:05:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 103 transitions. [2024-11-22 19:05:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 19:05:23,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 19:05:23,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1914005482, now seen corresponding path program 1 times [2024-11-22 19:05:23,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178374232] [2024-11-22 19:05:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178374232] [2024-11-22 19:05:23,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178374232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768913897] [2024-11-22 19:05:23,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,893 INFO L87 Difference]: Start difference. First operand 56 states and 103 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-22 19:05:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,907 INFO L93 Difference]: Finished difference Result 83 states and 149 transitions. [2024-11-22 19:05:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,908 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-22 19:05:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,909 INFO L225 Difference]: With dead ends: 83 [2024-11-22 19:05:23,909 INFO L226 Difference]: Without dead ends: 83 [2024-11-22 19:05:23,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,910 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 173 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-22 19:05:23,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-22 19:05:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-22 19:05:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 147 transitions. [2024-11-22 19:05:23,919 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 147 transitions. Word has length 20 [2024-11-22 19:05:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,919 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 147 transitions. [2024-11-22 19:05:23,919 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-22 19:05:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 147 transitions. [2024-11-22 19:05:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:05:23,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 19:05:23,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash 799562590, now seen corresponding path program 1 times [2024-11-22 19:05:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777495147] [2024-11-22 19:05:23,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,993 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-22 19:05:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777495147] [2024-11-22 19:05:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777495147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520525176] [2024-11-22 19:05:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,996 INFO L87 Difference]: Start difference. First operand 80 states and 147 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-22 19:05:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,012 INFO L93 Difference]: Finished difference Result 86 states and 151 transitions. [2024-11-22 19:05:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 19:05:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,014 INFO L225 Difference]: With dead ends: 86 [2024-11-22 19:05:24,014 INFO L226 Difference]: Without dead ends: 86 [2024-11-22 19:05:24,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,015 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 195 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-22 19:05:24,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-22 19:05:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-22 19:05:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 149 transitions. [2024-11-22 19:05:24,040 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 149 transitions. Word has length 21 [2024-11-22 19:05:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,040 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 149 transitions. [2024-11-22 19:05:24,040 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-22 19:05:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 149 transitions. [2024-11-22 19:05:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:05:24,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 19:05:24,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash -788785312, now seen corresponding path program 1 times [2024-11-22 19:05:24,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709260770] [2024-11-22 19:05:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,164 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-22 19:05:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709260770] [2024-11-22 19:05:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709260770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151769038] [2024-11-22 19:05:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,166 INFO L87 Difference]: Start difference. First operand 83 states and 149 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-22 19:05:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,205 INFO L93 Difference]: Finished difference Result 157 states and 284 transitions. [2024-11-22 19:05:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,205 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-22 19:05:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,206 INFO L225 Difference]: With dead ends: 157 [2024-11-22 19:05:24,206 INFO L226 Difference]: Without dead ends: 157 [2024-11-22 19:05:24,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,207 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 56 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 152 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-22 19:05:24,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-22 19:05:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2024-11-22 19:05:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 198 transitions. [2024-11-22 19:05:24,217 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 198 transitions. Word has length 21 [2024-11-22 19:05:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,217 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 198 transitions. [2024-11-22 19:05:24,217 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-22 19:05:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 198 transitions. [2024-11-22 19:05:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:05:24,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 19:05:24,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1809853666, now seen corresponding path program 1 times [2024-11-22 19:05:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32207764] [2024-11-22 19:05:24,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,244 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-22 19:05:24,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32207764] [2024-11-22 19:05:24,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32207764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264992846] [2024-11-22 19:05:24,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,246 INFO L87 Difference]: Start difference. First operand 110 states and 198 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-22 19:05:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,258 INFO L93 Difference]: Finished difference Result 159 states and 282 transitions. [2024-11-22 19:05:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,259 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-22 19:05:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,260 INFO L225 Difference]: With dead ends: 159 [2024-11-22 19:05:24,260 INFO L226 Difference]: Without dead ends: 159 [2024-11-22 19:05:24,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,261 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 174 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-22 19:05:24,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-22 19:05:24,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-11-22 19:05:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 280 transitions. [2024-11-22 19:05:24,267 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 280 transitions. Word has length 21 [2024-11-22 19:05:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,268 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 280 transitions. [2024-11-22 19:05:24,268 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-22 19:05:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 280 transitions. [2024-11-22 19:05:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:05:24,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 19:05:24,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1324056565, now seen corresponding path program 1 times [2024-11-22 19:05:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611126150] [2024-11-22 19:05:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,305 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-22 19:05:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611126150] [2024-11-22 19:05:24,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611126150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015261638] [2024-11-22 19:05:24,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,309 INFO L87 Difference]: Start difference. First operand 156 states and 280 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,328 INFO L93 Difference]: Finished difference Result 161 states and 282 transitions. [2024-11-22 19:05:24,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 19:05:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,329 INFO L225 Difference]: With dead ends: 161 [2024-11-22 19:05:24,329 INFO L226 Difference]: Without dead ends: 161 [2024-11-22 19:05:24,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,330 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 191 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-22 19:05:24,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-22 19:05:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-11-22 19:05:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 280 transitions. [2024-11-22 19:05:24,344 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 280 transitions. Word has length 22 [2024-11-22 19:05:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,344 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 280 transitions. [2024-11-22 19:05:24,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 280 transitions. [2024-11-22 19:05:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:05:24,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 19:05:24,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,348 INFO L85 PathProgramCache]: Analyzing trace with hash -264291337, now seen corresponding path program 1 times [2024-11-22 19:05:24,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490720450] [2024-11-22 19:05:24,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,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-22 19:05:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490720450] [2024-11-22 19:05:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490720450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021929905] [2024-11-22 19:05:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,393 INFO L87 Difference]: Start difference. First operand 158 states and 280 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,417 INFO L93 Difference]: Finished difference Result 305 states and 534 transitions. [2024-11-22 19:05:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 19:05:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,419 INFO L225 Difference]: With dead ends: 305 [2024-11-22 19:05:24,419 INFO L226 Difference]: Without dead ends: 305 [2024-11-22 19:05:24,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,422 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 154 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-22 19:05:24,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-22 19:05:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2024-11-22 19:05:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.7674418604651163) internal successors, (532), 301 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-22 19:05:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 532 transitions. [2024-11-22 19:05:24,439 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 532 transitions. Word has length 22 [2024-11-22 19:05:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,440 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 532 transitions. [2024-11-22 19:05:24,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 532 transitions. [2024-11-22 19:05:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:05:24,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 19:05:24,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash 756777017, now seen corresponding path program 1 times [2024-11-22 19:05:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471426879] [2024-11-22 19:05:24,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,466 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-22 19:05:24,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471426879] [2024-11-22 19:05:24,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471426879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97347510] [2024-11-22 19:05:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,470 INFO L87 Difference]: Start difference. First operand 302 states and 532 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,481 INFO L93 Difference]: Finished difference Result 385 states and 682 transitions. [2024-11-22 19:05:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 19:05:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,483 INFO L225 Difference]: With dead ends: 385 [2024-11-22 19:05:24,483 INFO L226 Difference]: Without dead ends: 385 [2024-11-22 19:05:24,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,483 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 209 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-22 19:05:24,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 209 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-22 19:05:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 302. [2024-11-22 19:05:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 528 transitions. [2024-11-22 19:05:24,494 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 528 transitions. Word has length 22 [2024-11-22 19:05:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,495 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 528 transitions. [2024-11-22 19:05:24,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 528 transitions. [2024-11-22 19:05:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 19:05:24,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 19:05:24,497 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash 403511177, now seen corresponding path program 1 times [2024-11-22 19:05:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919270190] [2024-11-22 19:05:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,526 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-22 19:05:24,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919270190] [2024-11-22 19:05:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919270190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775395022] [2024-11-22 19:05:24,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,527 INFO L87 Difference]: Start difference. First operand 302 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,557 INFO L93 Difference]: Finished difference Result 565 states and 994 transitions. [2024-11-22 19:05:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 19:05:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,562 INFO L225 Difference]: With dead ends: 565 [2024-11-22 19:05:24,562 INFO L226 Difference]: Without dead ends: 565 [2024-11-22 19:05:24,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,563 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 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-22 19:05:24,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-22 19:05:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 418. [2024-11-22 19:05:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.7266187050359711) internal successors, (720), 417 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 720 transitions. [2024-11-22 19:05:24,570 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 720 transitions. Word has length 23 [2024-11-22 19:05:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,570 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 720 transitions. [2024-11-22 19:05:24,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 720 transitions. [2024-11-22 19:05:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 19:05:24,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 19:05:24,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash -617557177, now seen corresponding path program 1 times [2024-11-22 19:05:24,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497153179] [2024-11-22 19:05:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497153179] [2024-11-22 19:05:24,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497153179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411506607] [2024-11-22 19:05:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,616 INFO L87 Difference]: Start difference. First operand 418 states and 720 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,627 INFO L93 Difference]: Finished difference Result 589 states and 1006 transitions. [2024-11-22 19:05:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 19:05:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,630 INFO L225 Difference]: With dead ends: 589 [2024-11-22 19:05:24,630 INFO L226 Difference]: Without dead ends: 589 [2024-11-22 19:05:24,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,634 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 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-22 19:05:24,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-22 19:05:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 586. [2024-11-22 19:05:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.7162393162393161) internal successors, (1004), 585 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1004 transitions. [2024-11-22 19:05:24,648 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1004 transitions. Word has length 23 [2024-11-22 19:05:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,648 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 1004 transitions. [2024-11-22 19:05:24,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1004 transitions. [2024-11-22 19:05:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:24,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 19:05:24,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash -369436798, now seen corresponding path program 1 times [2024-11-22 19:05:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605963076] [2024-11-22 19:05:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,680 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-22 19:05:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605963076] [2024-11-22 19:05:24,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605963076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945494818] [2024-11-22 19:05:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,683 INFO L87 Difference]: Start difference. First operand 586 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,695 INFO L93 Difference]: Finished difference Result 601 states and 1014 transitions. [2024-11-22 19:05:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 19:05:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,697 INFO L225 Difference]: With dead ends: 601 [2024-11-22 19:05:24,697 INFO L226 Difference]: Without dead ends: 601 [2024-11-22 19:05:24,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,697 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 183 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-22 19:05:24,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-22 19:05:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2024-11-22 19:05:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1012 transitions. [2024-11-22 19:05:24,716 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1012 transitions. Word has length 24 [2024-11-22 19:05:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,716 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 1012 transitions. [2024-11-22 19:05:24,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1012 transitions. [2024-11-22 19:05:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:24,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 19:05:24,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1957784700, now seen corresponding path program 1 times [2024-11-22 19:05:24,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114826602] [2024-11-22 19:05:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,748 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-22 19:05:24,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114826602] [2024-11-22 19:05:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114826602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570261447] [2024-11-22 19:05:24,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,751 INFO L87 Difference]: Start difference. First operand 598 states and 1012 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,763 INFO L93 Difference]: Finished difference Result 1097 states and 1870 transitions. [2024-11-22 19:05:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 19:05:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,767 INFO L225 Difference]: With dead ends: 1097 [2024-11-22 19:05:24,767 INFO L226 Difference]: Without dead ends: 1097 [2024-11-22 19:05:24,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,768 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 146 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-22 19:05:24,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-22 19:05:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 838. [2024-11-22 19:05:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1388 transitions. [2024-11-22 19:05:24,787 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1388 transitions. Word has length 24 [2024-11-22 19:05:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,787 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1388 transitions. [2024-11-22 19:05:24,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1388 transitions. [2024-11-22 19:05:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:24,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 19:05:24,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1316114242, now seen corresponding path program 1 times [2024-11-22 19:05:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226357855] [2024-11-22 19:05:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,821 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-22 19:05:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226357855] [2024-11-22 19:05:24,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226357855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211827129] [2024-11-22 19:05:24,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,823 INFO L87 Difference]: Start difference. First operand 838 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,839 INFO L93 Difference]: Finished difference Result 1161 states and 1910 transitions. [2024-11-22 19:05:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 19:05:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,843 INFO L225 Difference]: With dead ends: 1161 [2024-11-22 19:05:24,844 INFO L226 Difference]: Without dead ends: 1161 [2024-11-22 19:05:24,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,845 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 177 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-22 19:05:24,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-22 19:05:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1158. [2024-11-22 19:05:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1908 transitions. [2024-11-22 19:05:24,866 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1908 transitions. Word has length 24 [2024-11-22 19:05:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,866 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1908 transitions. [2024-11-22 19:05:24,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1908 transitions. [2024-11-22 19:05:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:24,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 19:05:24,868 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash -555154382, now seen corresponding path program 1 times [2024-11-22 19:05:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840657331] [2024-11-22 19:05:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,888 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-22 19:05:24,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840657331] [2024-11-22 19:05:24,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840657331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069465163] [2024-11-22 19:05:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,890 INFO L87 Difference]: Start difference. First operand 1158 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,902 INFO L93 Difference]: Finished difference Result 1177 states and 1910 transitions. [2024-11-22 19:05:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 19:05:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,906 INFO L225 Difference]: With dead ends: 1177 [2024-11-22 19:05:24,906 INFO L226 Difference]: Without dead ends: 1177 [2024-11-22 19:05:24,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,907 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 179 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-22 19:05:24,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-11-22 19:05:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1174. [2024-11-22 19:05:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1908 transitions. [2024-11-22 19:05:24,923 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1908 transitions. Word has length 25 [2024-11-22 19:05:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,923 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1908 transitions. [2024-11-22 19:05:24,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1908 transitions. [2024-11-22 19:05:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:24,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 19:05:24,925 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2143502284, now seen corresponding path program 1 times [2024-11-22 19:05:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517184782] [2024-11-22 19:05:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,942 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-22 19:05:24,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517184782] [2024-11-22 19:05:24,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517184782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645209996] [2024-11-22 19:05:24,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,943 INFO L87 Difference]: Start difference. First operand 1174 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,967 INFO L93 Difference]: Finished difference Result 2121 states and 3478 transitions. [2024-11-22 19:05:24,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 19:05:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,973 INFO L225 Difference]: With dead ends: 2121 [2024-11-22 19:05:24,974 INFO L226 Difference]: Without dead ends: 2121 [2024-11-22 19:05:24,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,974 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 144 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-22 19:05:24,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2024-11-22 19:05:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1670. [2024-11-22 19:05:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2644 transitions. [2024-11-22 19:05:25,002 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2644 transitions. Word has length 25 [2024-11-22 19:05:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,002 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2644 transitions. [2024-11-22 19:05:25,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2644 transitions. [2024-11-22 19:05:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:25,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 19:05:25,006 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1130396658, now seen corresponding path program 1 times [2024-11-22 19:05:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605927534] [2024-11-22 19:05:25,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,024 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-22 19:05:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605927534] [2024-11-22 19:05:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605927534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855262994] [2024-11-22 19:05:25,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,026 INFO L87 Difference]: Start difference. First operand 1670 states and 2644 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,042 INFO L93 Difference]: Finished difference Result 2281 states and 3590 transitions. [2024-11-22 19:05:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 19:05:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,049 INFO L225 Difference]: With dead ends: 2281 [2024-11-22 19:05:25,049 INFO L226 Difference]: Without dead ends: 2281 [2024-11-22 19:05:25,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,050 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 178 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-22 19:05:25,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2024-11-22 19:05:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2278. [2024-11-22 19:05:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 3588 transitions. [2024-11-22 19:05:25,092 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 3588 transitions. Word has length 25 [2024-11-22 19:05:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,092 INFO L471 AbstractCegarLoop]: Abstraction has 2278 states and 3588 transitions. [2024-11-22 19:05:25,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 3588 transitions. [2024-11-22 19:05:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:25,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 19:05:25,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2017421619, now seen corresponding path program 1 times [2024-11-22 19:05:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952265133] [2024-11-22 19:05:25,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,130 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-22 19:05:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952265133] [2024-11-22 19:05:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952265133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097168183] [2024-11-22 19:05:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,133 INFO L87 Difference]: Start difference. First operand 2278 states and 3588 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,154 INFO L93 Difference]: Finished difference Result 2313 states and 3590 transitions. [2024-11-22 19:05:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-22 19:05:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,163 INFO L225 Difference]: With dead ends: 2313 [2024-11-22 19:05:25,167 INFO L226 Difference]: Without dead ends: 2313 [2024-11-22 19:05:25,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,168 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 175 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-22 19:05:25,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-11-22 19:05:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2310. [2024-11-22 19:05:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3588 transitions. [2024-11-22 19:05:25,204 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3588 transitions. Word has length 26 [2024-11-22 19:05:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,204 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 3588 transitions. [2024-11-22 19:05:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3588 transitions. [2024-11-22 19:05:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:25,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 19:05:25,207 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash 689197775, now seen corresponding path program 1 times [2024-11-22 19:05:25,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710968388] [2024-11-22 19:05:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,237 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-22 19:05:25,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710968388] [2024-11-22 19:05:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710968388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585431503] [2024-11-22 19:05:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,240 INFO L87 Difference]: Start difference. First operand 2310 states and 3588 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,259 INFO L93 Difference]: Finished difference Result 4105 states and 6438 transitions. [2024-11-22 19:05:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-22 19:05:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,268 INFO L225 Difference]: With dead ends: 4105 [2024-11-22 19:05:25,268 INFO L226 Difference]: Without dead ends: 4105 [2024-11-22 19:05:25,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,270 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 142 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-22 19:05:25,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2024-11-22 19:05:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 3334. [2024-11-22 19:05:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 5028 transitions. [2024-11-22 19:05:25,325 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 5028 transitions. Word has length 26 [2024-11-22 19:05:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,326 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 5028 transitions. [2024-11-22 19:05:25,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 5028 transitions. [2024-11-22 19:05:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:25,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 19:05:25,329 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,330 INFO L85 PathProgramCache]: Analyzing trace with hash -331870579, now seen corresponding path program 1 times [2024-11-22 19:05:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140872085] [2024-11-22 19:05:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,352 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-22 19:05:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140872085] [2024-11-22 19:05:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140872085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727544838] [2024-11-22 19:05:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,354 INFO L87 Difference]: Start difference. First operand 3334 states and 5028 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,372 INFO L93 Difference]: Finished difference Result 4489 states and 6726 transitions. [2024-11-22 19:05:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-22 19:05:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,382 INFO L225 Difference]: With dead ends: 4489 [2024-11-22 19:05:25,382 INFO L226 Difference]: Without dead ends: 4489 [2024-11-22 19:05:25,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,382 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 179 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-22 19:05:25,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2024-11-22 19:05:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4486. [2024-11-22 19:05:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4486 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 6724 transitions. [2024-11-22 19:05:25,461 INFO L78 Accepts]: Start accepts. Automaton has 4486 states and 6724 transitions. Word has length 26 [2024-11-22 19:05:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,461 INFO L471 AbstractCegarLoop]: Abstraction has 4486 states and 6724 transitions. [2024-11-22 19:05:25,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4486 states and 6724 transitions. [2024-11-22 19:05:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:25,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 19:05:25,468 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash -103055139, now seen corresponding path program 1 times [2024-11-22 19:05:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635123699] [2024-11-22 19:05:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,492 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-22 19:05:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635123699] [2024-11-22 19:05:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635123699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983756319] [2024-11-22 19:05:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,494 INFO L87 Difference]: Start difference. First operand 4486 states and 6724 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,537 INFO L93 Difference]: Finished difference Result 4553 states and 6726 transitions. [2024-11-22 19:05:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 19:05:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,553 INFO L225 Difference]: With dead ends: 4553 [2024-11-22 19:05:25,554 INFO L226 Difference]: Without dead ends: 4553 [2024-11-22 19:05:25,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,554 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 171 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-22 19:05:25,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2024-11-22 19:05:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 4550. [2024-11-22 19:05:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6724 transitions. [2024-11-22 19:05:25,611 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6724 transitions. Word has length 27 [2024-11-22 19:05:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,611 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 6724 transitions. [2024-11-22 19:05:25,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6724 transitions. [2024-11-22 19:05:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:25,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 19:05:25,614 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1691403041, now seen corresponding path program 1 times [2024-11-22 19:05:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775773155] [2024-11-22 19:05:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,631 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-22 19:05:25,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775773155] [2024-11-22 19:05:25,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775773155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788507625] [2024-11-22 19:05:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,633 INFO L87 Difference]: Start difference. First operand 4550 states and 6724 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,658 INFO L93 Difference]: Finished difference Result 7945 states and 11846 transitions. [2024-11-22 19:05:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 19:05:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,669 INFO L225 Difference]: With dead ends: 7945 [2024-11-22 19:05:25,669 INFO L226 Difference]: Without dead ends: 7945 [2024-11-22 19:05:25,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,670 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 140 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-22 19:05:25,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states. [2024-11-22 19:05:25,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 6662. [2024-11-22 19:05:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 9540 transitions. [2024-11-22 19:05:25,769 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 9540 transitions. Word has length 27 [2024-11-22 19:05:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,770 INFO L471 AbstractCegarLoop]: Abstraction has 6662 states and 9540 transitions. [2024-11-22 19:05:25,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 9540 transitions. [2024-11-22 19:05:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:25,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 19:05:25,776 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1582495901, now seen corresponding path program 1 times [2024-11-22 19:05:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484058670] [2024-11-22 19:05:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,797 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-22 19:05:25,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484058670] [2024-11-22 19:05:25,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484058670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353400152] [2024-11-22 19:05:25,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,798 INFO L87 Difference]: Start difference. First operand 6662 states and 9540 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,856 INFO L93 Difference]: Finished difference Result 8841 states and 12550 transitions. [2024-11-22 19:05:25,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 19:05:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,866 INFO L225 Difference]: With dead ends: 8841 [2024-11-22 19:05:25,866 INFO L226 Difference]: Without dead ends: 8841 [2024-11-22 19:05:25,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,867 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 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-22 19:05:25,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2024-11-22 19:05:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 8838. [2024-11-22 19:05:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 12548 transitions. [2024-11-22 19:05:25,957 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 12548 transitions. Word has length 27 [2024-11-22 19:05:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,957 INFO L471 AbstractCegarLoop]: Abstraction has 8838 states and 12548 transitions. [2024-11-22 19:05:25,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 12548 transitions. [2024-11-22 19:05:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:05:25,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 19:05:25,963 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash -887225832, now seen corresponding path program 1 times [2024-11-22 19:05:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491068636] [2024-11-22 19:05:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,982 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-22 19:05:25,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491068636] [2024-11-22 19:05:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491068636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456527622] [2024-11-22 19:05:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,983 INFO L87 Difference]: Start difference. First operand 8838 states and 12548 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:26,009 INFO L93 Difference]: Finished difference Result 8969 states and 12550 transitions. [2024-11-22 19:05:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:26,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-22 19:05:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:26,023 INFO L225 Difference]: With dead ends: 8969 [2024-11-22 19:05:26,023 INFO L226 Difference]: Without dead ends: 8969 [2024-11-22 19:05:26,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,024 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 167 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-22 19:05:26,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8969 states. [2024-11-22 19:05:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8969 to 8966. [2024-11-22 19:05:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8966 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 12548 transitions. [2024-11-22 19:05:26,189 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 12548 transitions. Word has length 28 [2024-11-22 19:05:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:26,189 INFO L471 AbstractCegarLoop]: Abstraction has 8966 states and 12548 transitions. [2024-11-22 19:05:26,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 12548 transitions. [2024-11-22 19:05:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:05:26,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:26,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:26,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 19:05:26,197 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:26,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1819393562, now seen corresponding path program 1 times [2024-11-22 19:05:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:26,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921139148] [2024-11-22 19:05:26,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:26,216 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-22 19:05:26,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:26,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921139148] [2024-11-22 19:05:26,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921139148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:26,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:26,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217125606] [2024-11-22 19:05:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:26,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:26,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,218 INFO L87 Difference]: Start difference. First operand 8966 states and 12548 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:26,256 INFO L93 Difference]: Finished difference Result 15369 states and 21638 transitions. [2024-11-22 19:05:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:26,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-22 19:05:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:26,276 INFO L225 Difference]: With dead ends: 15369 [2024-11-22 19:05:26,277 INFO L226 Difference]: Without dead ends: 15369 [2024-11-22 19:05:26,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,277 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 138 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-22 19:05:26,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15369 states. [2024-11-22 19:05:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15369 to 13318. [2024-11-22 19:05:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13318 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13318 states to 13318 states and 18052 transitions. [2024-11-22 19:05:26,502 INFO L78 Accepts]: Start accepts. Automaton has 13318 states and 18052 transitions. Word has length 28 [2024-11-22 19:05:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:26,502 INFO L471 AbstractCegarLoop]: Abstraction has 13318 states and 18052 transitions. [2024-11-22 19:05:26,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 13318 states and 18052 transitions. [2024-11-22 19:05:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:05:26,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:26,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:26,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 19:05:26,512 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:26,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash 798325208, now seen corresponding path program 1 times [2024-11-22 19:05:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:26,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029604569] [2024-11-22 19:05:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:26,537 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-22 19:05:26,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:26,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029604569] [2024-11-22 19:05:26,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029604569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:26,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:26,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496853523] [2024-11-22 19:05:26,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:26,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:26,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,539 INFO L87 Difference]: Start difference. First operand 13318 states and 18052 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:26,580 INFO L93 Difference]: Finished difference Result 17417 states and 23302 transitions. [2024-11-22 19:05:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:26,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-22 19:05:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:26,601 INFO L225 Difference]: With dead ends: 17417 [2024-11-22 19:05:26,601 INFO L226 Difference]: Without dead ends: 17417 [2024-11-22 19:05:26,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,602 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 181 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-22 19:05:26,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17417 states. [2024-11-22 19:05:26,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17417 to 17414. [2024-11-22 19:05:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 23300 transitions. [2024-11-22 19:05:26,854 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 23300 transitions. Word has length 28 [2024-11-22 19:05:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:26,854 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 23300 transitions. [2024-11-22 19:05:26,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 23300 transitions. [2024-11-22 19:05:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 19:05:26,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:26,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:26,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 19:05:26,865 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:26,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash 573297032, now seen corresponding path program 1 times [2024-11-22 19:05:26,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:26,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888134481] [2024-11-22 19:05:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:26,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:26,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888134481] [2024-11-22 19:05:26,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888134481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:26,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:26,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:26,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460592444] [2024-11-22 19:05:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:26,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:26,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:26,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,892 INFO L87 Difference]: Start difference. First operand 17414 states and 23300 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:26,928 INFO L93 Difference]: Finished difference Result 17673 states and 23302 transitions. [2024-11-22 19:05:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:26,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-22 19:05:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:26,949 INFO L225 Difference]: With dead ends: 17673 [2024-11-22 19:05:26,949 INFO L226 Difference]: Without dead ends: 17673 [2024-11-22 19:05:26,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,950 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:26,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17673 states. [2024-11-22 19:05:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17673 to 17670. [2024-11-22 19:05:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17670 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17670 states to 17670 states and 23300 transitions. [2024-11-22 19:05:27,211 INFO L78 Accepts]: Start accepts. Automaton has 17670 states and 23300 transitions. Word has length 29 [2024-11-22 19:05:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:27,211 INFO L471 AbstractCegarLoop]: Abstraction has 17670 states and 23300 transitions. [2024-11-22 19:05:27,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 17670 states and 23300 transitions. [2024-11-22 19:05:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 19:05:27,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:27,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:27,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-22 19:05:27,224 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1015050870, now seen corresponding path program 1 times [2024-11-22 19:05:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429455756] [2024-11-22 19:05:27,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:27,342 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-22 19:05:27,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:27,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429455756] [2024-11-22 19:05:27,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429455756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:27,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:27,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122850606] [2024-11-22 19:05:27,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:27,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:27,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:27,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:27,343 INFO L87 Difference]: Start difference. First operand 17670 states and 23300 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:27,451 INFO L93 Difference]: Finished difference Result 29705 states and 39174 transitions. [2024-11-22 19:05:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:27,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-22 19:05:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:27,500 INFO L225 Difference]: With dead ends: 29705 [2024-11-22 19:05:27,500 INFO L226 Difference]: Without dead ends: 29705 [2024-11-22 19:05:27,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:27,501 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 32 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 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-22 19:05:27,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29705 states. [2024-11-22 19:05:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29705 to 26630. [2024-11-22 19:05:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26630 states, 26629 states have (on average 1.2787562431935109) internal successors, (34052), 26629 states have internal predecessors, (34052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26630 states to 26630 states and 34052 transitions. [2024-11-22 19:05:27,985 INFO L78 Accepts]: Start accepts. Automaton has 26630 states and 34052 transitions. Word has length 29 [2024-11-22 19:05:27,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:27,986 INFO L471 AbstractCegarLoop]: Abstraction has 26630 states and 34052 transitions. [2024-11-22 19:05:27,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 26630 states and 34052 transitions. [2024-11-22 19:05:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 19:05:28,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:28,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:28,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-22 19:05:28,007 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2036119224, now seen corresponding path program 1 times [2024-11-22 19:05:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912695481] [2024-11-22 19:05:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:28,030 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-22 19:05:28,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:28,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912695481] [2024-11-22 19:05:28,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912695481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:28,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:28,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:28,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999737835] [2024-11-22 19:05:28,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:28,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:28,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:28,031 INFO L87 Difference]: Start difference. First operand 26630 states and 34052 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:28,207 INFO L93 Difference]: Finished difference Result 34313 states and 43014 transitions. [2024-11-22 19:05:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:28,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-22 19:05:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:28,244 INFO L225 Difference]: With dead ends: 34313 [2024-11-22 19:05:28,244 INFO L226 Difference]: Without dead ends: 34313 [2024-11-22 19:05:28,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:28,245 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 182 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-22 19:05:28,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34313 states. [2024-11-22 19:05:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34313 to 34310. [2024-11-22 19:05:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34310 states, 34309 states have (on average 1.2536652190387363) internal successors, (43012), 34309 states have internal predecessors, (43012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34310 states to 34310 states and 43012 transitions. [2024-11-22 19:05:28,595 INFO L78 Accepts]: Start accepts. Automaton has 34310 states and 43012 transitions. Word has length 29 [2024-11-22 19:05:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:28,595 INFO L471 AbstractCegarLoop]: Abstraction has 34310 states and 43012 transitions. [2024-11-22 19:05:28,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 34310 states and 43012 transitions. [2024-11-22 19:05:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 19:05:28,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:28,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:28,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-22 19:05:28,701 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:28,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:28,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1395123869, now seen corresponding path program 1 times [2024-11-22 19:05:28,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:28,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677556704] [2024-11-22 19:05:28,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:28,718 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-22 19:05:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677556704] [2024-11-22 19:05:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677556704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:28,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483530613] [2024-11-22 19:05:28,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:28,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:28,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:28,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:28,720 INFO L87 Difference]: Start difference. First operand 34310 states and 43012 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:28,809 INFO L93 Difference]: Finished difference Result 34825 states and 43014 transitions. [2024-11-22 19:05:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:28,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-22 19:05:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:28,852 INFO L225 Difference]: With dead ends: 34825 [2024-11-22 19:05:28,852 INFO L226 Difference]: Without dead ends: 34825 [2024-11-22 19:05:28,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:28,853 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:28,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34825 states. [2024-11-22 19:05:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34825 to 34822. [2024-11-22 19:05:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34822 states, 34821 states have (on average 1.235231613107033) internal successors, (43012), 34821 states have internal predecessors, (43012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34822 states to 34822 states and 43012 transitions. [2024-11-22 19:05:29,268 INFO L78 Accepts]: Start accepts. Automaton has 34822 states and 43012 transitions. Word has length 30 [2024-11-22 19:05:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:29,268 INFO L471 AbstractCegarLoop]: Abstraction has 34822 states and 43012 transitions. [2024-11-22 19:05:29,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 34822 states and 43012 transitions. [2024-11-22 19:05:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 19:05:29,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:29,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:29,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-22 19:05:29,290 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:29,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1311495525, now seen corresponding path program 1 times [2024-11-22 19:05:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899247711] [2024-11-22 19:05:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:29,316 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-22 19:05:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899247711] [2024-11-22 19:05:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899247711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:29,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:29,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870317129] [2024-11-22 19:05:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:29,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:29,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:29,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:29,318 INFO L87 Difference]: Start difference. First operand 34822 states and 43012 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:29,511 INFO L93 Difference]: Finished difference Result 67593 states and 79878 transitions. [2024-11-22 19:05:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:29,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-22 19:05:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:29,579 INFO L225 Difference]: With dead ends: 67593 [2024-11-22 19:05:29,579 INFO L226 Difference]: Without dead ends: 67593 [2024-11-22 19:05:29,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:29,580 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 154 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-22 19:05:29,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67593 states. [2024-11-22 19:05:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67593 to 67590. [2024-11-22 19:05:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67590 states, 67589 states have (on average 1.181789936232227) internal successors, (79876), 67589 states have internal predecessors, (79876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67590 states to 67590 states and 79876 transitions. [2024-11-22 19:05:30,444 INFO L78 Accepts]: Start accepts. Automaton has 67590 states and 79876 transitions. Word has length 30 [2024-11-22 19:05:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:30,444 INFO L471 AbstractCegarLoop]: Abstraction has 67590 states and 79876 transitions. [2024-11-22 19:05:30,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 67590 states and 79876 transitions. [2024-11-22 19:05:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 19:05:30,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:30,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:30,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-22 19:05:30,488 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:30,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1962403417, now seen corresponding path program 1 times [2024-11-22 19:05:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484718581] [2024-11-22 19:05:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:30,506 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-22 19:05:30,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484718581] [2024-11-22 19:05:30,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484718581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:30,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:30,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537839751] [2024-11-22 19:05:30,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:30,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:30,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:30,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:30,508 INFO L87 Difference]: Start difference. First operand 67590 states and 79876 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:30,891 INFO L93 Difference]: Finished difference Result 71689 states and 84998 transitions. [2024-11-22 19:05:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-22 19:05:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:30,944 INFO L225 Difference]: With dead ends: 71689 [2024-11-22 19:05:30,945 INFO L226 Difference]: Without dead ends: 71689 [2024-11-22 19:05:30,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:30,945 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 29 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 169 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-22 19:05:30,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 169 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71689 states. [2024-11-22 19:05:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71689 to 67590. [2024-11-22 19:05:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67590 states, 67589 states have (on average 1.1666395419372975) internal successors, (78852), 67589 states have internal predecessors, (78852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67590 states to 67590 states and 78852 transitions. [2024-11-22 19:05:31,768 INFO L78 Accepts]: Start accepts. Automaton has 67590 states and 78852 transitions. Word has length 30 [2024-11-22 19:05:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:31,768 INFO L471 AbstractCegarLoop]: Abstraction has 67590 states and 78852 transitions. [2024-11-22 19:05:31,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 67590 states and 78852 transitions. [2024-11-22 19:05:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 19:05:31,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:31,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-22 19:05:31,798 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:31,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2008348211, now seen corresponding path program 1 times [2024-11-22 19:05:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84354830] [2024-11-22 19:05:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:31,829 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-22 19:05:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:31,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84354830] [2024-11-22 19:05:31,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84354830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:31,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:31,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847832893] [2024-11-22 19:05:31,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:31,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:31,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:31,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:31,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:31,831 INFO L87 Difference]: Start difference. First operand 67590 states and 78852 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:32,036 INFO L93 Difference]: Finished difference Result 109574 states and 124932 transitions. [2024-11-22 19:05:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:32,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-22 19:05:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:32,153 INFO L225 Difference]: With dead ends: 109574 [2024-11-22 19:05:32,154 INFO L226 Difference]: Without dead ends: 109574 [2024-11-22 19:05:32,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:32,154 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:32,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109574 states. [2024-11-22 19:05:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109574 to 105478. [2024-11-22 19:05:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105478 states, 105477 states have (on average 1.1456146837699215) internal successors, (120836), 105477 states have internal predecessors, (120836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105478 states to 105478 states and 120836 transitions. [2024-11-22 19:05:33,769 INFO L78 Accepts]: Start accepts. Automaton has 105478 states and 120836 transitions. Word has length 31 [2024-11-22 19:05:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:33,770 INFO L471 AbstractCegarLoop]: Abstraction has 105478 states and 120836 transitions. [2024-11-22 19:05:33,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 105478 states and 120836 transitions. [2024-11-22 19:05:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 19:05:33,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:33,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:33,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-22 19:05:33,850 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:33,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:33,854 INFO L85 PathProgramCache]: Analyzing trace with hash 987279857, now seen corresponding path program 1 times [2024-11-22 19:05:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:33,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543758117] [2024-11-22 19:05:33,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:33,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:33,888 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-22 19:05:33,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:33,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543758117] [2024-11-22 19:05:33,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543758117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:33,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:33,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687842117] [2024-11-22 19:05:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:33,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:33,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:33,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:33,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:33,889 INFO L87 Difference]: Start difference. First operand 105478 states and 120836 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:34,137 INFO L93 Difference]: Finished difference Result 132099 states and 145410 transitions. [2024-11-22 19:05:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:34,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-22 19:05:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:34,138 INFO L225 Difference]: With dead ends: 132099 [2024-11-22 19:05:34,138 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 19:05:34,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:34,139 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 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-22 19:05:34,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 19:05:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 19:05:34,139 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-22 19:05:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 19:05:34,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2024-11-22 19:05:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:34,140 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 19:05:34,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 19:05:34,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 19:05:34,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-22 19:05:34,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-22 19:05:34,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-22 19:05:34,145 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:34,147 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 19:05:34,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:05:34 BoogieIcfgContainer [2024-11-22 19:05:34,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 19:05:34,149 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 19:05:34,149 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 19:05:34,149 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 19:05:34,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:23" (3/4) ... [2024-11-22 19:05:34,151 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 19:05:34,161 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-22 19:05:34,161 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-22 19:05:34,161 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 19:05:34,161 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 19:05:34,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 19:05:34,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 19:05:34,233 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 19:05:34,234 INFO L158 Benchmark]: Toolchain (without parser) took 11576.56ms. Allocated memory was 142.6MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 71.5MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-22 19:05:34,237 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 19:05:34,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.22ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 57.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 19:05:34,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 56.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 19:05:34,238 INFO L158 Benchmark]: Boogie Preprocessor took 28.64ms. Allocated memory is still 142.6MB. Free memory was 56.1MB in the beginning and 54.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 19:05:34,238 INFO L158 Benchmark]: RCFGBuilder took 366.06ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 54.1MB in the beginning and 157.6MB in the end (delta: -103.5MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-22 19:05:34,238 INFO L158 Benchmark]: TraceAbstraction took 10839.76ms. Allocated memory was 197.1MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 156.5MB in the beginning and 8.8GB in the end (delta: -8.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-22 19:05:34,238 INFO L158 Benchmark]: Witness Printer took 84.49ms. Allocated memory is still 10.0GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 19:05:34,239 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.16ms. Allocated memory is still 142.6MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.22ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 57.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 56.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.64ms. Allocated memory is still 142.6MB. Free memory was 56.1MB in the beginning and 54.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.06ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 54.1MB in the beginning and 157.6MB in the end (delta: -103.5MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10839.76ms. Allocated memory was 197.1MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 156.5MB in the beginning and 8.8GB in the end (delta: -8.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 84.49ms. Allocated memory is still 10.0GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1731 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1731 mSDsluCounter, 5642 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2202 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3440 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105478occurred in iteration=34, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 16449 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 820 ConstructedInterpolants, 0 QuantifiedInterpolants, 1752 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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-22 19:05:34,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE