./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_14-1.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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:05:49,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:05:50,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:05:50,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:05:50,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:05:50,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:05:50,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:05:50,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:05:50,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:05:50,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:05:50,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:05:50,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:05:50,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:05:50,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:05:50,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:05:50,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:05:50,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:05:50,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:05:50,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:05:50,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:05:50,048 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:05:50,052 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:05:50,053 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:05:50,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:05:50,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:05:50,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:05:50,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:05:50,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:05:50,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:05:50,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:05:50,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:05:50,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:05:50,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:05:50,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:05:50,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:05:50,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:05:50,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:05:50,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:05:50,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:05:50,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:05:50,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:05:50,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:05:50,060 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2024-11-19 07:05:50,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:05:50,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:05:50,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:05:50,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:05:50,306 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:05:50,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-19 07:05:51,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:05:51,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:05:51,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-19 07:05:51,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d8d872f/0d8a6581e3784ad9ba66ccd42b829bc4/FLAGc66f152e7 [2024-11-19 07:05:51,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d8d872f/0d8a6581e3784ad9ba66ccd42b829bc4 [2024-11-19 07:05:51,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:05:51,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:05:51,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:05:51,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:05:51,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:05:51,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:05:51" (1/1) ... [2024-11-19 07:05:51,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583579c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:51, skipping insertion in model container [2024-11-19 07:05:51,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:05:51" (1/1) ... [2024-11-19 07:05:52,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:05:52,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:05:52,211 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:05:52,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:05:52,248 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:05:52,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52 WrapperNode [2024-11-19 07:05:52,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:05:52,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:05:52,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:05:52,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:05:52,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,292 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2024-11-19 07:05:52,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:05:52,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:05:52,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:05:52,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:05:52,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,340 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 07:05:52,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:05:52,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:05:52,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:05:52,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:05:52,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (1/1) ... [2024-11-19 07:05:52,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:05:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:05:52,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 07:05:52,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 07:05:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:05:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:05:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:05:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:05:52,546 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:05:52,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:05:52,867 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 07:05:52,868 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:05:52,883 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:05:52,884 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 07:05:52,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:05:52 BoogieIcfgContainer [2024-11-19 07:05:52,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:05:52,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:05:52,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:05:52,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:05:52,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:05:51" (1/3) ... [2024-11-19 07:05:52,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235a7a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:05:52, skipping insertion in model container [2024-11-19 07:05:52,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:05:52" (2/3) ... [2024-11-19 07:05:52,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235a7a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:05:52, skipping insertion in model container [2024-11-19 07:05:52,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:05:52" (3/3) ... [2024-11-19 07:05:52,893 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2024-11-19 07:05:52,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:05:52,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 07:05:52,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:05:52,947 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;@703e9afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:05:52,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 07:05:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:05:52,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:52,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:05:52,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:52,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash 28943013, now seen corresponding path program 1 times [2024-11-19 07:05:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:52,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593193848] [2024-11-19 07:05:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:53,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593193848] [2024-11-19 07:05:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593193848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:53,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:05:53,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887368581] [2024-11-19 07:05:53,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:53,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 07:05:53,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:53,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 07:05:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 07:05:53,174 INFO L87 Difference]: Start difference. First operand has 55 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:53,187 INFO L93 Difference]: Finished difference Result 54 states and 95 transitions. [2024-11-19 07:05:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 07:05:53,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 07:05:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:53,194 INFO L225 Difference]: With dead ends: 54 [2024-11-19 07:05:53,195 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 07:05:53,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 07:05:53,199 INFO L432 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:53,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 07:05:53,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-19 07:05:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.86) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 93 transitions. [2024-11-19 07:05:53,238 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 93 transitions. Word has length 5 [2024-11-19 07:05:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:53,239 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 93 transitions. [2024-11-19 07:05:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 93 transitions. [2024-11-19 07:05:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:05:53,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:53,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:05:53,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:05:53,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:53,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash 889700142, now seen corresponding path program 1 times [2024-11-19 07:05:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539718954] [2024-11-19 07:05:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:53,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539718954] [2024-11-19 07:05:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539718954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:53,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:53,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:05:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706629751] [2024-11-19 07:05:53,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:53,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:53,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:53,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,343 INFO L87 Difference]: Start difference. First operand 52 states and 93 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:53,355 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2024-11-19 07:05:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:53,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:05:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:53,357 INFO L225 Difference]: With dead ends: 51 [2024-11-19 07:05:53,357 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 07:05:53,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,359 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:53,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 07:05:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-19 07:05:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. [2024-11-19 07:05:53,368 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 90 transitions. Word has length 6 [2024-11-19 07:05:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:53,368 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 90 transitions. [2024-11-19 07:05:53,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 90 transitions. [2024-11-19 07:05:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:05:53,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:53,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:53,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:05:53,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:53,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:53,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1188558766, now seen corresponding path program 1 times [2024-11-19 07:05:53,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:53,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664503732] [2024-11-19 07:05:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664503732] [2024-11-19 07:05:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664503732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:53,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208633253] [2024-11-19 07:05:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,472 INFO L87 Difference]: Start difference. First operand 49 states and 90 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:53,501 INFO L93 Difference]: Finished difference Result 95 states and 175 transitions. [2024-11-19 07:05:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:53,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:05:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:53,504 INFO L225 Difference]: With dead ends: 95 [2024-11-19 07:05:53,504 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 07:05:53,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,505 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:53,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 07:05:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2024-11-19 07:05:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 119 transitions. [2024-11-19 07:05:53,523 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 119 transitions. Word has length 22 [2024-11-19 07:05:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:53,523 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 119 transitions. [2024-11-19 07:05:53,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 119 transitions. [2024-11-19 07:05:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:05:53,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:53,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:53,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:05:53,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:53,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1112263824, now seen corresponding path program 1 times [2024-11-19 07:05:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563744682] [2024-11-19 07:05:53,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:53,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563744682] [2024-11-19 07:05:53,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563744682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:53,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:53,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592602913] [2024-11-19 07:05:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:53,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:53,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:53,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,590 INFO L87 Difference]: Start difference. First operand 64 states and 119 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:53,613 INFO L93 Difference]: Finished difference Result 95 states and 173 transitions. [2024-11-19 07:05:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:53,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:05:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:53,615 INFO L225 Difference]: With dead ends: 95 [2024-11-19 07:05:53,615 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 07:05:53,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,617 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 69 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:53,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 07:05:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-19 07:05:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 171 transitions. [2024-11-19 07:05:53,626 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 171 transitions. Word has length 22 [2024-11-19 07:05:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:53,627 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 171 transitions. [2024-11-19 07:05:53,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2024-11-19 07:05:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:05:53,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:53,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:53,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:05:53,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:53,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1815949700, now seen corresponding path program 1 times [2024-11-19 07:05:53,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:53,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452246793] [2024-11-19 07:05:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:53,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452246793] [2024-11-19 07:05:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452246793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:53,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:53,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:53,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504482015] [2024-11-19 07:05:53,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:53,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:53,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:53,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,714 INFO L87 Difference]: Start difference. First operand 92 states and 171 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:53,735 INFO L93 Difference]: Finished difference Result 98 states and 175 transitions. [2024-11-19 07:05:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:53,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 07:05:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:53,736 INFO L225 Difference]: With dead ends: 98 [2024-11-19 07:05:53,736 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 07:05:53,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,737 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 71 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:53,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 07:05:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-19 07:05:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 173 transitions. [2024-11-19 07:05:53,744 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 173 transitions. Word has length 23 [2024-11-19 07:05:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:53,745 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 173 transitions. [2024-11-19 07:05:53,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 173 transitions. [2024-11-19 07:05:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:05:53,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:53,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:53,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:05:53,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:53,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash 127005958, now seen corresponding path program 1 times [2024-11-19 07:05:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:53,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423653108] [2024-11-19 07:05:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:53,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423653108] [2024-11-19 07:05:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423653108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:53,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:53,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935759268] [2024-11-19 07:05:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:53,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:53,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:53,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,818 INFO L87 Difference]: Start difference. First operand 95 states and 173 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:53,838 INFO L93 Difference]: Finished difference Result 181 states and 332 transitions. [2024-11-19 07:05:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:53,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 07:05:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:53,840 INFO L225 Difference]: With dead ends: 181 [2024-11-19 07:05:53,840 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 07:05:53,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,842 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 66 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:53,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 07:05:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 126. [2024-11-19 07:05:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.84) internal successors, (230), 125 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 230 transitions. [2024-11-19 07:05:53,850 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 230 transitions. Word has length 23 [2024-11-19 07:05:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:53,851 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 230 transitions. [2024-11-19 07:05:53,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 230 transitions. [2024-11-19 07:05:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:05:53,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:53,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:53,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 07:05:53,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1867138748, now seen corresponding path program 1 times [2024-11-19 07:05:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782740521] [2024-11-19 07:05:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782740521] [2024-11-19 07:05:53,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782740521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:53,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:53,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811161105] [2024-11-19 07:05:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:53,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,904 INFO L87 Difference]: Start difference. First operand 126 states and 230 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:53,930 INFO L93 Difference]: Finished difference Result 183 states and 330 transitions. [2024-11-19 07:05:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:53,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 07:05:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:53,932 INFO L225 Difference]: With dead ends: 183 [2024-11-19 07:05:53,932 INFO L226 Difference]: Without dead ends: 183 [2024-11-19 07:05:53,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,933 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:53,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-19 07:05:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-19 07:05:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 328 transitions. [2024-11-19 07:05:53,949 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 328 transitions. Word has length 23 [2024-11-19 07:05:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:53,949 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 328 transitions. [2024-11-19 07:05:53,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 328 transitions. [2024-11-19 07:05:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:05:53,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:53,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:53,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 07:05:53,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:53,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -351206245, now seen corresponding path program 1 times [2024-11-19 07:05:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:53,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438436413] [2024-11-19 07:05:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:53,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-19 07:05:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438436413] [2024-11-19 07:05:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438436413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:53,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504884891] [2024-11-19 07:05:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:53,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:53,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:53,998 INFO L87 Difference]: Start difference. First operand 180 states and 328 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,019 INFO L93 Difference]: Finished difference Result 185 states and 330 transitions. [2024-11-19 07:05:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-19 07:05:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,020 INFO L225 Difference]: With dead ends: 185 [2024-11-19 07:05:54,021 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 07:05:54,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,022 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 07:05:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-19 07:05:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.8121546961325967) internal successors, (328), 181 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 328 transitions. [2024-11-19 07:05:54,053 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 328 transitions. Word has length 24 [2024-11-19 07:05:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,053 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 328 transitions. [2024-11-19 07:05:54,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 328 transitions. [2024-11-19 07:05:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:05:54,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:05:54,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2040149987, now seen corresponding path program 1 times [2024-11-19 07:05:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315103644] [2024-11-19 07:05:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315103644] [2024-11-19 07:05:54,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315103644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282316199] [2024-11-19 07:05:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,096 INFO L87 Difference]: Start difference. First operand 182 states and 328 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,113 INFO L93 Difference]: Finished difference Result 353 states and 630 transitions. [2024-11-19 07:05:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-19 07:05:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,115 INFO L225 Difference]: With dead ends: 353 [2024-11-19 07:05:54,115 INFO L226 Difference]: Without dead ends: 353 [2024-11-19 07:05:54,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,116 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 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-19 07:05:54,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-19 07:05:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2024-11-19 07:05:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.7994269340974212) internal successors, (628), 349 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 628 transitions. [2024-11-19 07:05:54,138 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 628 transitions. Word has length 24 [2024-11-19 07:05:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,138 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 628 transitions. [2024-11-19 07:05:54,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 628 transitions. [2024-11-19 07:05:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 07:05:54,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 07:05:54,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash -46005281, now seen corresponding path program 1 times [2024-11-19 07:05:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931958779] [2024-11-19 07:05:54,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931958779] [2024-11-19 07:05:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931958779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635273830] [2024-11-19 07:05:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,185 INFO L87 Difference]: Start difference. First operand 350 states and 628 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,198 INFO L93 Difference]: Finished difference Result 449 states and 810 transitions. [2024-11-19 07:05:54,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-19 07:05:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,200 INFO L225 Difference]: With dead ends: 449 [2024-11-19 07:05:54,200 INFO L226 Difference]: Without dead ends: 449 [2024-11-19 07:05:54,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,201 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 63 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 245 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-19 07:05:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 350. [2024-11-19 07:05:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.7879656160458453) internal successors, (624), 349 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 624 transitions. [2024-11-19 07:05:54,215 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 624 transitions. Word has length 24 [2024-11-19 07:05:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,215 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 624 transitions. [2024-11-19 07:05:54,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 624 transitions. [2024-11-19 07:05:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:05:54,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,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, 1, 1, 1, 1] [2024-11-19 07:05:54,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:05:54,220 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1186446767, now seen corresponding path program 1 times [2024-11-19 07:05:54,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885505960] [2024-11-19 07:05:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885505960] [2024-11-19 07:05:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885505960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703418640] [2024-11-19 07:05:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,262 INFO L87 Difference]: Start difference. First operand 350 states and 624 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,276 INFO L93 Difference]: Finished difference Result 661 states and 1186 transitions. [2024-11-19 07:05:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 07:05:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,279 INFO L225 Difference]: With dead ends: 661 [2024-11-19 07:05:54,279 INFO L226 Difference]: Without dead ends: 661 [2024-11-19 07:05:54,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,280 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 60 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-19 07:05:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 482. [2024-11-19 07:05:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.762993762993763) internal successors, (848), 481 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 848 transitions. [2024-11-19 07:05:54,293 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 848 transitions. Word has length 25 [2024-11-19 07:05:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,293 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 848 transitions. [2024-11-19 07:05:54,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 848 transitions. [2024-11-19 07:05:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:05:54,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:05:54,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash -807697939, now seen corresponding path program 1 times [2024-11-19 07:05:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315523691] [2024-11-19 07:05:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315523691] [2024-11-19 07:05:54,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315523691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271985267] [2024-11-19 07:05:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,327 INFO L87 Difference]: Start difference. First operand 482 states and 848 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,345 INFO L93 Difference]: Finished difference Result 685 states and 1198 transitions. [2024-11-19 07:05:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 07:05:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,348 INFO L225 Difference]: With dead ends: 685 [2024-11-19 07:05:54,348 INFO L226 Difference]: Without dead ends: 685 [2024-11-19 07:05:54,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,350 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-19 07:05:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2024-11-19 07:05:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.7562408223201176) internal successors, (1196), 681 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1196 transitions. [2024-11-19 07:05:54,365 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1196 transitions. Word has length 25 [2024-11-19 07:05:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,365 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1196 transitions. [2024-11-19 07:05:54,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1196 transitions. [2024-11-19 07:05:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:05:54,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:05:54,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1868258392, now seen corresponding path program 1 times [2024-11-19 07:05:54,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303339534] [2024-11-19 07:05:54,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303339534] [2024-11-19 07:05:54,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303339534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964476588] [2024-11-19 07:05:54,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,401 INFO L87 Difference]: Start difference. First operand 682 states and 1196 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,418 INFO L93 Difference]: Finished difference Result 697 states and 1206 transitions. [2024-11-19 07:05:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 07:05:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,421 INFO L225 Difference]: With dead ends: 697 [2024-11-19 07:05:54,421 INFO L226 Difference]: Without dead ends: 697 [2024-11-19 07:05:54,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,422 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-19 07:05:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2024-11-19 07:05:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1204 transitions. [2024-11-19 07:05:54,437 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1204 transitions. Word has length 26 [2024-11-19 07:05:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1204 transitions. [2024-11-19 07:05:54,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1204 transitions. [2024-11-19 07:05:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:05:54,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:05:54,439 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 737765162, now seen corresponding path program 1 times [2024-11-19 07:05:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068619127] [2024-11-19 07:05:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068619127] [2024-11-19 07:05:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068619127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713611962] [2024-11-19 07:05:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,474 INFO L87 Difference]: Start difference. First operand 694 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,491 INFO L93 Difference]: Finished difference Result 1289 states and 2254 transitions. [2024-11-19 07:05:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 07:05:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,497 INFO L225 Difference]: With dead ends: 1289 [2024-11-19 07:05:54,498 INFO L226 Difference]: Without dead ends: 1289 [2024-11-19 07:05:54,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,499 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 57 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-19 07:05:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 966. [2024-11-19 07:05:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1644 transitions. [2024-11-19 07:05:54,517 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1644 transitions. Word has length 26 [2024-11-19 07:05:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,518 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1644 transitions. [2024-11-19 07:05:54,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1644 transitions. [2024-11-19 07:05:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 07:05:54,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:05:54,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1256379544, now seen corresponding path program 1 times [2024-11-19 07:05:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698510967] [2024-11-19 07:05:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698510967] [2024-11-19 07:05:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698510967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207898949] [2024-11-19 07:05:54,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,562 INFO L87 Difference]: Start difference. First operand 966 states and 1644 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,580 INFO L93 Difference]: Finished difference Result 1353 states and 2294 transitions. [2024-11-19 07:05:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 07:05:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,586 INFO L225 Difference]: With dead ends: 1353 [2024-11-19 07:05:54,586 INFO L226 Difference]: Without dead ends: 1353 [2024-11-19 07:05:54,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,588 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-19 07:05:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1350. [2024-11-19 07:05:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2292 transitions. [2024-11-19 07:05:54,618 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2292 transitions. Word has length 26 [2024-11-19 07:05:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,618 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2292 transitions. [2024-11-19 07:05:54,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2292 transitions. [2024-11-19 07:05:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:05:54,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 07:05:54,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1402491608, now seen corresponding path program 1 times [2024-11-19 07:05:54,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917210368] [2024-11-19 07:05:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917210368] [2024-11-19 07:05:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917210368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940440842] [2024-11-19 07:05:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,660 INFO L87 Difference]: Start difference. First operand 1350 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,681 INFO L93 Difference]: Finished difference Result 1369 states and 2294 transitions. [2024-11-19 07:05:54,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 07:05:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,687 INFO L225 Difference]: With dead ends: 1369 [2024-11-19 07:05:54,688 INFO L226 Difference]: Without dead ends: 1369 [2024-11-19 07:05:54,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,689 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-19 07:05:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1366. [2024-11-19 07:05:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2292 transitions. [2024-11-19 07:05:54,729 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2292 transitions. Word has length 27 [2024-11-19 07:05:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,729 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2292 transitions. [2024-11-19 07:05:54,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2292 transitions. [2024-11-19 07:05:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:05:54,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:05:54,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash -286452134, now seen corresponding path program 1 times [2024-11-19 07:05:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954036955] [2024-11-19 07:05:54,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954036955] [2024-11-19 07:05:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954036955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164036646] [2024-11-19 07:05:54,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,773 INFO L87 Difference]: Start difference. First operand 1366 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,798 INFO L93 Difference]: Finished difference Result 2505 states and 4246 transitions. [2024-11-19 07:05:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 07:05:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,807 INFO L225 Difference]: With dead ends: 2505 [2024-11-19 07:05:54,808 INFO L226 Difference]: Without dead ends: 2505 [2024-11-19 07:05:54,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,809 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-19 07:05:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1926. [2024-11-19 07:05:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 3156 transitions. [2024-11-19 07:05:54,852 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 3156 transitions. Word has length 27 [2024-11-19 07:05:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,852 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 3156 transitions. [2024-11-19 07:05:54,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 3156 transitions. [2024-11-19 07:05:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 07:05:54,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:54,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 07:05:54,856 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2014370456, now seen corresponding path program 1 times [2024-11-19 07:05:54,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480238487] [2024-11-19 07:05:54,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480238487] [2024-11-19 07:05:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480238487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:54,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:54,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:54,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538385055] [2024-11-19 07:05:54,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:54,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:54,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:54,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,887 INFO L87 Difference]: Start difference. First operand 1926 states and 3156 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:54,912 INFO L93 Difference]: Finished difference Result 2665 states and 4358 transitions. [2024-11-19 07:05:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 07:05:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:54,922 INFO L225 Difference]: With dead ends: 2665 [2024-11-19 07:05:54,923 INFO L226 Difference]: Without dead ends: 2665 [2024-11-19 07:05:54,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:54,924 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:54,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2024-11-19 07:05:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2662. [2024-11-19 07:05:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 4356 transitions. [2024-11-19 07:05:54,978 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 4356 transitions. Word has length 27 [2024-11-19 07:05:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:54,978 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 4356 transitions. [2024-11-19 07:05:54,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 4356 transitions. [2024-11-19 07:05:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:05:54,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:54,981 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-19 07:05:54,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:05:54,982 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:54,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash -283462925, now seen corresponding path program 1 times [2024-11-19 07:05:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:54,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917954420] [2024-11-19 07:05:54,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:55,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917954420] [2024-11-19 07:05:55,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917954420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:55,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:55,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389300721] [2024-11-19 07:05:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,017 INFO L87 Difference]: Start difference. First operand 2662 states and 4356 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-19 07:05:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:55,038 INFO L93 Difference]: Finished difference Result 2697 states and 4358 transitions. [2024-11-19 07:05:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:55,038 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-19 07:05:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:55,046 INFO L225 Difference]: With dead ends: 2697 [2024-11-19 07:05:55,047 INFO L226 Difference]: Without dead ends: 2697 [2024-11-19 07:05:55,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,048 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:55,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2024-11-19 07:05:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2694. [2024-11-19 07:05:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 4356 transitions. [2024-11-19 07:05:55,135 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 4356 transitions. Word has length 28 [2024-11-19 07:05:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:55,136 INFO L471 AbstractCegarLoop]: Abstraction has 2694 states and 4356 transitions. [2024-11-19 07:05:55,136 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-19 07:05:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 4356 transitions. [2024-11-19 07:05:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:05:55,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:55,139 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-19 07:05:55,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 07:05:55,139 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:55,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1972406667, now seen corresponding path program 1 times [2024-11-19 07:05:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536631262] [2024-11-19 07:05:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:55,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:55,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536631262] [2024-11-19 07:05:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536631262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:55,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157006694] [2024-11-19 07:05:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:55,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:55,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:55,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,164 INFO L87 Difference]: Start difference. First operand 2694 states and 4356 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-19 07:05:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:55,195 INFO L93 Difference]: Finished difference Result 4873 states and 7974 transitions. [2024-11-19 07:05:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:55,195 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-19 07:05:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:55,211 INFO L225 Difference]: With dead ends: 4873 [2024-11-19 07:05:55,211 INFO L226 Difference]: Without dead ends: 4873 [2024-11-19 07:05:55,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,212 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:55,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2024-11-19 07:05:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 3846. [2024-11-19 07:05:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 6052 transitions. [2024-11-19 07:05:55,294 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 6052 transitions. Word has length 28 [2024-11-19 07:05:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:55,294 INFO L471 AbstractCegarLoop]: Abstraction has 3846 states and 6052 transitions. [2024-11-19 07:05:55,295 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-19 07:05:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 6052 transitions. [2024-11-19 07:05:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:05:55,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:55,300 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-19 07:05:55,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 07:05:55,300 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:55,301 INFO L85 PathProgramCache]: Analyzing trace with hash 328415923, now seen corresponding path program 1 times [2024-11-19 07:05:55,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:55,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128577089] [2024-11-19 07:05:55,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:55,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128577089] [2024-11-19 07:05:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128577089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:55,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:55,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:55,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278411949] [2024-11-19 07:05:55,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:55,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,325 INFO L87 Difference]: Start difference. First operand 3846 states and 6052 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-19 07:05:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:55,355 INFO L93 Difference]: Finished difference Result 5257 states and 8262 transitions. [2024-11-19 07:05:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:55,356 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-19 07:05:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:55,384 INFO L225 Difference]: With dead ends: 5257 [2024-11-19 07:05:55,384 INFO L226 Difference]: Without dead ends: 5257 [2024-11-19 07:05:55,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,385 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:55,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 207 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2024-11-19 07:05:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5254. [2024-11-19 07:05:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 8260 transitions. [2024-11-19 07:05:55,525 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 8260 transitions. Word has length 28 [2024-11-19 07:05:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:55,526 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 8260 transitions. [2024-11-19 07:05:55,526 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-19 07:05:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 8260 transitions. [2024-11-19 07:05:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:05:55,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:55,531 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-19 07:05:55,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 07:05:55,531 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:55,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1008435325, now seen corresponding path program 1 times [2024-11-19 07:05:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:55,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700697120] [2024-11-19 07:05:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:55,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:55,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:55,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700697120] [2024-11-19 07:05:55,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700697120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:55,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:55,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:55,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572513700] [2024-11-19 07:05:55,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:55,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:55,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:55,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:55,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,555 INFO L87 Difference]: Start difference. First operand 5254 states and 8260 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-19 07:05:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:55,586 INFO L93 Difference]: Finished difference Result 5321 states and 8262 transitions. [2024-11-19 07:05:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:55,586 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-19 07:05:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:55,603 INFO L225 Difference]: With dead ends: 5321 [2024-11-19 07:05:55,603 INFO L226 Difference]: Without dead ends: 5321 [2024-11-19 07:05:55,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,604 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:55,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2024-11-19 07:05:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 5318. [2024-11-19 07:05:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 8260 transitions. [2024-11-19 07:05:55,699 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 8260 transitions. Word has length 29 [2024-11-19 07:05:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:55,699 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 8260 transitions. [2024-11-19 07:05:55,700 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-19 07:05:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 8260 transitions. [2024-11-19 07:05:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:05:55,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:55,705 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-19 07:05:55,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 07:05:55,705 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:55,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1597588229, now seen corresponding path program 1 times [2024-11-19 07:05:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236672203] [2024-11-19 07:05:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:55,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:55,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236672203] [2024-11-19 07:05:55,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236672203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:55,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:55,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823810402] [2024-11-19 07:05:55,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:55,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:55,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:55,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:55,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,736 INFO L87 Difference]: Start difference. First operand 5318 states and 8260 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-19 07:05:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:55,779 INFO L93 Difference]: Finished difference Result 9481 states and 14918 transitions. [2024-11-19 07:05:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:55,780 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-19 07:05:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:55,796 INFO L225 Difference]: With dead ends: 9481 [2024-11-19 07:05:55,797 INFO L226 Difference]: Without dead ends: 9481 [2024-11-19 07:05:55,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:55,798 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:55,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9481 states. [2024-11-19 07:05:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9481 to 7686. [2024-11-19 07:05:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7686 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 11588 transitions. [2024-11-19 07:05:55,991 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 11588 transitions. Word has length 29 [2024-11-19 07:05:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:55,992 INFO L471 AbstractCegarLoop]: Abstraction has 7686 states and 11588 transitions. [2024-11-19 07:05:55,992 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-19 07:05:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 11588 transitions. [2024-11-19 07:05:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:05:56,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:56,001 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-19 07:05:56,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 07:05:56,002 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:56,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash -396556477, now seen corresponding path program 1 times [2024-11-19 07:05:56,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:56,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568466518] [2024-11-19 07:05:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:56,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568466518] [2024-11-19 07:05:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568466518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:56,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:56,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392710400] [2024-11-19 07:05:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:56,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:56,027 INFO L87 Difference]: Start difference. First operand 7686 states and 11588 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-19 07:05:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:56,067 INFO L93 Difference]: Finished difference Result 10377 states and 15622 transitions. [2024-11-19 07:05:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:56,068 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-19 07:05:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:56,085 INFO L225 Difference]: With dead ends: 10377 [2024-11-19 07:05:56,085 INFO L226 Difference]: Without dead ends: 10377 [2024-11-19 07:05:56,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:56,086 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:56,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2024-11-19 07:05:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 10374. [2024-11-19 07:05:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10374 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10374 states to 10374 states and 15620 transitions. [2024-11-19 07:05:56,293 INFO L78 Accepts]: Start accepts. Automaton has 10374 states and 15620 transitions. Word has length 29 [2024-11-19 07:05:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:56,293 INFO L471 AbstractCegarLoop]: Abstraction has 10374 states and 15620 transitions. [2024-11-19 07:05:56,293 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-19 07:05:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 10374 states and 15620 transitions. [2024-11-19 07:05:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:05:56,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:56,305 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-19 07:05:56,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 07:05:56,306 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:56,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2007732674, now seen corresponding path program 1 times [2024-11-19 07:05:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:56,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565663500] [2024-11-19 07:05:56,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565663500] [2024-11-19 07:05:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565663500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989506827] [2024-11-19 07:05:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:56,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:56,347 INFO L87 Difference]: Start difference. First operand 10374 states and 15620 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-19 07:05:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:56,394 INFO L93 Difference]: Finished difference Result 10505 states and 15622 transitions. [2024-11-19 07:05:56,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:56,395 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-19 07:05:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:56,414 INFO L225 Difference]: With dead ends: 10505 [2024-11-19 07:05:56,414 INFO L226 Difference]: Without dead ends: 10505 [2024-11-19 07:05:56,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:56,416 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:56,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10505 states. [2024-11-19 07:05:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10505 to 10502. [2024-11-19 07:05:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10502 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10502 states to 10502 states and 15620 transitions. [2024-11-19 07:05:56,613 INFO L78 Accepts]: Start accepts. Automaton has 10502 states and 15620 transitions. Word has length 30 [2024-11-19 07:05:56,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:56,614 INFO L471 AbstractCegarLoop]: Abstraction has 10502 states and 15620 transitions. [2024-11-19 07:05:56,614 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-19 07:05:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 10502 states and 15620 transitions. [2024-11-19 07:05:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:05:56,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:56,623 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-19 07:05:56,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 07:05:56,624 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:56,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash 598290880, now seen corresponding path program 1 times [2024-11-19 07:05:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:56,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468619365] [2024-11-19 07:05:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:56,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:56,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468619365] [2024-11-19 07:05:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468619365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:56,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:56,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456571969] [2024-11-19 07:05:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:56,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:56,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:56,648 INFO L87 Difference]: Start difference. First operand 10502 states and 15620 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-19 07:05:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:56,699 INFO L93 Difference]: Finished difference Result 18441 states and 27782 transitions. [2024-11-19 07:05:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:56,699 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-19 07:05:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:56,776 INFO L225 Difference]: With dead ends: 18441 [2024-11-19 07:05:56,777 INFO L226 Difference]: Without dead ends: 18441 [2024-11-19 07:05:56,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:56,777 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:56,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18441 states. [2024-11-19 07:05:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18441 to 15366. [2024-11-19 07:05:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15366 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15366 states to 15366 states and 22148 transitions. [2024-11-19 07:05:56,962 INFO L78 Accepts]: Start accepts. Automaton has 15366 states and 22148 transitions. Word has length 30 [2024-11-19 07:05:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:56,962 INFO L471 AbstractCegarLoop]: Abstraction has 15366 states and 22148 transitions. [2024-11-19 07:05:56,962 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-19 07:05:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 15366 states and 22148 transitions. [2024-11-19 07:05:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:05:56,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:56,979 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-19 07:05:56,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 07:05:56,980 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:56,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1395853826, now seen corresponding path program 1 times [2024-11-19 07:05:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:56,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644960522] [2024-11-19 07:05:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:57,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644960522] [2024-11-19 07:05:57,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644960522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:57,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:57,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131003509] [2024-11-19 07:05:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:57,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:57,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:57,006 INFO L87 Difference]: Start difference. First operand 15366 states and 22148 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-19 07:05:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:57,070 INFO L93 Difference]: Finished difference Result 20489 states and 29446 transitions. [2024-11-19 07:05:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:57,071 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-19 07:05:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:57,104 INFO L225 Difference]: With dead ends: 20489 [2024-11-19 07:05:57,105 INFO L226 Difference]: Without dead ends: 20489 [2024-11-19 07:05:57,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:57,105 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:57,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 209 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20489 states. [2024-11-19 07:05:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20489 to 20486. [2024-11-19 07:05:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20486 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20486 states to 20486 states and 29444 transitions. [2024-11-19 07:05:57,415 INFO L78 Accepts]: Start accepts. Automaton has 20486 states and 29444 transitions. Word has length 30 [2024-11-19 07:05:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:57,415 INFO L471 AbstractCegarLoop]: Abstraction has 20486 states and 29444 transitions. [2024-11-19 07:05:57,415 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-19 07:05:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20486 states and 29444 transitions. [2024-11-19 07:05:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:05:57,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:57,439 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-19 07:05:57,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 07:05:57,440 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1373798446, now seen corresponding path program 1 times [2024-11-19 07:05:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386257938] [2024-11-19 07:05:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:57,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:57,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386257938] [2024-11-19 07:05:57,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386257938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:57,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:57,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:57,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717529845] [2024-11-19 07:05:57,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:57,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:57,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:57,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:57,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:57,469 INFO L87 Difference]: Start difference. First operand 20486 states and 29444 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-19 07:05:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:57,530 INFO L93 Difference]: Finished difference Result 20745 states and 29446 transitions. [2024-11-19 07:05:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:57,628 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-19 07:05:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:57,692 INFO L225 Difference]: With dead ends: 20745 [2024-11-19 07:05:57,692 INFO L226 Difference]: Without dead ends: 20745 [2024-11-19 07:05:57,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:57,693 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 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-19 07:05:57,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20745 states. [2024-11-19 07:05:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20745 to 20742. [2024-11-19 07:05:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20742 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20742 states to 20742 states and 29444 transitions. [2024-11-19 07:05:58,080 INFO L78 Accepts]: Start accepts. Automaton has 20742 states and 29444 transitions. Word has length 31 [2024-11-19 07:05:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:58,081 INFO L471 AbstractCegarLoop]: Abstraction has 20742 states and 29444 transitions. [2024-11-19 07:05:58,081 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-19 07:05:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 20742 states and 29444 transitions. [2024-11-19 07:05:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:05:58,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:58,100 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-19 07:05:58,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 07:05:58,100 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:58,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash -315145296, now seen corresponding path program 1 times [2024-11-19 07:05:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:58,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111479009] [2024-11-19 07:05:58,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:58,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111479009] [2024-11-19 07:05:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111479009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:58,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403557607] [2024-11-19 07:05:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:58,126 INFO L87 Difference]: Start difference. First operand 20742 states and 29444 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-19 07:05:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:58,239 INFO L93 Difference]: Finished difference Result 35849 states and 51462 transitions. [2024-11-19 07:05:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:58,241 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-19 07:05:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:58,307 INFO L225 Difference]: With dead ends: 35849 [2024-11-19 07:05:58,307 INFO L226 Difference]: Without dead ends: 35849 [2024-11-19 07:05:58,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:58,308 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 42 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:58,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35849 states. [2024-11-19 07:05:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35849 to 30726. [2024-11-19 07:05:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30726 states, 30725 states have (on average 1.3749064279902359) internal successors, (42244), 30725 states have internal predecessors, (42244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30726 states to 30726 states and 42244 transitions. [2024-11-19 07:05:58,845 INFO L78 Accepts]: Start accepts. Automaton has 30726 states and 42244 transitions. Word has length 31 [2024-11-19 07:05:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:58,845 INFO L471 AbstractCegarLoop]: Abstraction has 30726 states and 42244 transitions. [2024-11-19 07:05:58,845 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-19 07:05:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 30726 states and 42244 transitions. [2024-11-19 07:05:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:05:58,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:58,870 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-19 07:05:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 07:05:58,871 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:58,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1985677294, now seen corresponding path program 1 times [2024-11-19 07:05:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758804834] [2024-11-19 07:05:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:58,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-19 07:05:58,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758804834] [2024-11-19 07:05:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758804834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:58,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328189567] [2024-11-19 07:05:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:58,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:58,892 INFO L87 Difference]: Start difference. First operand 30726 states and 42244 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-19 07:05:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:59,204 INFO L93 Difference]: Finished difference Result 40457 states and 55302 transitions. [2024-11-19 07:05:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:05:59,205 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-19 07:05:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:59,264 INFO L225 Difference]: With dead ends: 40457 [2024-11-19 07:05:59,264 INFO L226 Difference]: Without dead ends: 40457 [2024-11-19 07:05:59,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:59,265 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:59,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:05:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40457 states. [2024-11-19 07:05:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40457 to 40454. [2024-11-19 07:05:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40454 states, 40453 states have (on average 1.3670185153140681) internal successors, (55300), 40453 states have internal predecessors, (55300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:05:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40454 states to 40454 states and 55300 transitions. [2024-11-19 07:05:59,886 INFO L78 Accepts]: Start accepts. Automaton has 40454 states and 55300 transitions. Word has length 31 [2024-11-19 07:05:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:59,886 INFO L471 AbstractCegarLoop]: Abstraction has 40454 states and 55300 transitions. [2024-11-19 07:05:59,886 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-19 07:05:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 40454 states and 55300 transitions. [2024-11-19 07:05:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 07:05:59,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:59,915 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, 1] [2024-11-19 07:05:59,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 07:05:59,915 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:05:59,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1172908663, now seen corresponding path program 1 times [2024-11-19 07:05:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:59,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626940221] [2024-11-19 07:05:59,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:59,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:59,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:59,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626940221] [2024-11-19 07:05:59,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626940221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:05:59,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:05:59,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:05:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807547370] [2024-11-19 07:05:59,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:05:59,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:05:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:59,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:05:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:05:59,944 INFO L87 Difference]: Start difference. First operand 40454 states and 55300 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:00,091 INFO L93 Difference]: Finished difference Result 40969 states and 55302 transitions. [2024-11-19 07:06:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-19 07:06:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:00,153 INFO L225 Difference]: With dead ends: 40969 [2024-11-19 07:06:00,153 INFO L226 Difference]: Without dead ends: 40969 [2024-11-19 07:06:00,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-19 07:06:00,154 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 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-19 07:06:00,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40969 states. [2024-11-19 07:06:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40969 to 40966. [2024-11-19 07:06:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40966 states, 40965 states have (on average 1.3499328695227633) internal successors, (55300), 40965 states have internal predecessors, (55300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40966 states to 40966 states and 55300 transitions. [2024-11-19 07:06:00,847 INFO L78 Accepts]: Start accepts. Automaton has 40966 states and 55300 transitions. Word has length 32 [2024-11-19 07:06:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:00,848 INFO L471 AbstractCegarLoop]: Abstraction has 40966 states and 55300 transitions. [2024-11-19 07:06:00,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 40966 states and 55300 transitions. [2024-11-19 07:06:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 07:06:00,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:00,873 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, 1] [2024-11-19 07:06:00,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 07:06:00,873 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1433114891, now seen corresponding path program 1 times [2024-11-19 07:06:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844854090] [2024-11-19 07:06:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844854090] [2024-11-19 07:06:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844854090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:00,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:00,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175181051] [2024-11-19 07:06:00,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:00,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:00,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:00,896 INFO L87 Difference]: Start difference. First operand 40966 states and 55300 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:01,256 INFO L93 Difference]: Finished difference Result 79881 states and 104454 transitions. [2024-11-19 07:06:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-19 07:06:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:01,379 INFO L225 Difference]: With dead ends: 79881 [2024-11-19 07:06:01,379 INFO L226 Difference]: Without dead ends: 79881 [2024-11-19 07:06:01,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:01,381 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 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-19 07:06:01,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79881 states. [2024-11-19 07:06:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79881 to 79878. [2024-11-19 07:06:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79878 states, 79877 states have (on average 1.3076605280618951) internal successors, (104452), 79877 states have internal predecessors, (104452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79878 states to 79878 states and 104452 transitions. [2024-11-19 07:06:02,863 INFO L78 Accepts]: Start accepts. Automaton has 79878 states and 104452 transitions. Word has length 32 [2024-11-19 07:06:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:02,863 INFO L471 AbstractCegarLoop]: Abstraction has 79878 states and 104452 transitions. [2024-11-19 07:06:02,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 79878 states and 104452 transitions. [2024-11-19 07:06:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 07:06:02,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:02,903 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, 1] [2024-11-19 07:06:02,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 07:06:02,904 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:02,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash -867707699, now seen corresponding path program 1 times [2024-11-19 07:06:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350540262] [2024-11-19 07:06:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:02,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:02,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350540262] [2024-11-19 07:06:02,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350540262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:02,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:02,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087318677] [2024-11-19 07:06:02,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:02,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:02,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:02,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:02,926 INFO L87 Difference]: Start difference. First operand 79878 states and 104452 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:03,106 INFO L93 Difference]: Finished difference Result 88073 states and 117766 transitions. [2024-11-19 07:06:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-19 07:06:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:03,524 INFO L225 Difference]: With dead ends: 88073 [2024-11-19 07:06:03,524 INFO L226 Difference]: Without dead ends: 88073 [2024-11-19 07:06:03,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:03,533 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 39 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:03,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 205 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88073 states. [2024-11-19 07:06:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88073 to 79878. [2024-11-19 07:06:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79878 states, 79877 states have (on average 1.2948408177573019) internal successors, (103428), 79877 states have internal predecessors, (103428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79878 states to 79878 states and 103428 transitions. [2024-11-19 07:06:04,682 INFO L78 Accepts]: Start accepts. Automaton has 79878 states and 103428 transitions. Word has length 32 [2024-11-19 07:06:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:04,682 INFO L471 AbstractCegarLoop]: Abstraction has 79878 states and 103428 transitions. [2024-11-19 07:06:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 79878 states and 103428 transitions. [2024-11-19 07:06:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:06:04,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:04,724 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, 1, 1] [2024-11-19 07:06:04,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 07:06:04,724 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:04,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1483560153, now seen corresponding path program 1 times [2024-11-19 07:06:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:04,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257866011] [2024-11-19 07:06:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:04,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:04,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-19 07:06:04,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:04,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257866011] [2024-11-19 07:06:04,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257866011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:04,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:04,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:04,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297784063] [2024-11-19 07:06:04,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:04,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:04,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:04,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:04,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:04,751 INFO L87 Difference]: Start difference. First operand 79878 states and 103428 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:05,350 INFO L93 Difference]: Finished difference Result 134153 states and 174086 transitions. [2024-11-19 07:06:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:05,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-19 07:06:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:05,500 INFO L225 Difference]: With dead ends: 134153 [2024-11-19 07:06:05,500 INFO L226 Difference]: Without dead ends: 134153 [2024-11-19 07:06:05,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:05,501 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:05,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134153 states. [2024-11-19 07:06:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134153 to 121862. [2024-11-19 07:06:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121862 states, 121861 states have (on average 1.260485307030141) internal successors, (153604), 121861 states have internal predecessors, (153604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121862 states to 121862 states and 153604 transitions. [2024-11-19 07:06:07,213 INFO L78 Accepts]: Start accepts. Automaton has 121862 states and 153604 transitions. Word has length 33 [2024-11-19 07:06:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:07,213 INFO L471 AbstractCegarLoop]: Abstraction has 121862 states and 153604 transitions. [2024-11-19 07:06:07,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 121862 states and 153604 transitions. [2024-11-19 07:06:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:06:07,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:07,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 07:06:07,269 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:07,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash -510584553, now seen corresponding path program 1 times [2024-11-19 07:06:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:07,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027623412] [2024-11-19 07:06:07,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027623412] [2024-11-19 07:06:07,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027623412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:07,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017018118] [2024-11-19 07:06:07,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:07,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:07,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:07,291 INFO L87 Difference]: Start difference. First operand 121862 states and 153604 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:07,599 INFO L93 Difference]: Finished difference Result 156681 states and 194566 transitions. [2024-11-19 07:06:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:07,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-19 07:06:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:08,330 INFO L225 Difference]: With dead ends: 156681 [2024-11-19 07:06:08,334 INFO L226 Difference]: Without dead ends: 156681 [2024-11-19 07:06:08,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:08,335 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 58 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:08,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156681 states. [2024-11-19 07:06:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156681 to 156678. [2024-11-19 07:06:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156678 states, 156677 states have (on average 1.2418159653299463) internal successors, (194564), 156677 states have internal predecessors, (194564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156678 states to 156678 states and 194564 transitions. [2024-11-19 07:06:10,766 INFO L78 Accepts]: Start accepts. Automaton has 156678 states and 194564 transitions. Word has length 33 [2024-11-19 07:06:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:10,766 INFO L471 AbstractCegarLoop]: Abstraction has 156678 states and 194564 transitions. [2024-11-19 07:06:10,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 156678 states and 194564 transitions. [2024-11-19 07:06:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:06:10,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:10,842 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, 1, 1, 1] [2024-11-19 07:06:10,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 07:06:10,843 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:10,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1247593450, now seen corresponding path program 1 times [2024-11-19 07:06:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209845054] [2024-11-19 07:06:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:10,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209845054] [2024-11-19 07:06:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209845054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:10,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:10,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:10,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585235904] [2024-11-19 07:06:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:10,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:10,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:10,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:10,865 INFO L87 Difference]: Start difference. First operand 156678 states and 194564 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:11,183 INFO L93 Difference]: Finished difference Result 159753 states and 196614 transitions. [2024-11-19 07:06:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:11,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-19 07:06:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:11,354 INFO L225 Difference]: With dead ends: 159753 [2024-11-19 07:06:11,354 INFO L226 Difference]: Without dead ends: 159753 [2024-11-19 07:06:11,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:11,356 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 60 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 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-19 07:06:11,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159753 states. [2024-11-19 07:06:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159753 to 159750. [2024-11-19 07:06:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159750 states, 159749 states have (on average 1.2307557480798001) internal successors, (196612), 159749 states have internal predecessors, (196612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159750 states to 159750 states and 196612 transitions. [2024-11-19 07:06:13,861 INFO L78 Accepts]: Start accepts. Automaton has 159750 states and 196612 transitions. Word has length 34 [2024-11-19 07:06:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:13,862 INFO L471 AbstractCegarLoop]: Abstraction has 159750 states and 196612 transitions. [2024-11-19 07:06:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 159750 states and 196612 transitions. [2024-11-19 07:06:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:06:13,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:13,959 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, 1, 1, 1] [2024-11-19 07:06:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 07:06:13,960 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:13,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1358430104, now seen corresponding path program 1 times [2024-11-19 07:06:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822110227] [2024-11-19 07:06:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:13,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:13,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822110227] [2024-11-19 07:06:13,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822110227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:13,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:13,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:13,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087229838] [2024-11-19 07:06:13,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:13,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:13,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:13,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:13,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:13,988 INFO L87 Difference]: Start difference. First operand 159750 states and 196612 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:15,245 INFO L93 Difference]: Finished difference Result 262153 states and 319494 transitions. [2024-11-19 07:06:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-19 07:06:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:15,568 INFO L225 Difference]: With dead ends: 262153 [2024-11-19 07:06:15,568 INFO L226 Difference]: Without dead ends: 262153 [2024-11-19 07:06:15,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:15,569 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 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-19 07:06:15,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262153 states. [2024-11-19 07:06:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262153 to 245766. [2024-11-19 07:06:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245766 states, 245765 states have (on average 1.1999918621447319) internal successors, (294916), 245765 states have internal predecessors, (294916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245766 states to 245766 states and 294916 transitions. [2024-11-19 07:06:19,395 INFO L78 Accepts]: Start accepts. Automaton has 245766 states and 294916 transitions. Word has length 34 [2024-11-19 07:06:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:19,395 INFO L471 AbstractCegarLoop]: Abstraction has 245766 states and 294916 transitions. [2024-11-19 07:06:19,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 245766 states and 294916 transitions. [2024-11-19 07:06:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:06:19,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:19,608 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, 1, 1, 1] [2024-11-19 07:06:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 07:06:19,609 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:19,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash -635714602, now seen corresponding path program 1 times [2024-11-19 07:06:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307462741] [2024-11-19 07:06:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:19,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:19,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307462741] [2024-11-19 07:06:19,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307462741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:19,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:19,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:19,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832747213] [2024-11-19 07:06:19,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:19,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:19,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:19,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:19,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:19,636 INFO L87 Difference]: Start difference. First operand 245766 states and 294916 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:21,423 INFO L93 Difference]: Finished difference Result 311305 states and 364550 transitions. [2024-11-19 07:06:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:21,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-19 07:06:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:21,946 INFO L225 Difference]: With dead ends: 311305 [2024-11-19 07:06:21,947 INFO L226 Difference]: Without dead ends: 311305 [2024-11-19 07:06:21,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:21,947 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:06:21,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311305 states. [2024-11-19 07:06:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311305 to 311302. [2024-11-19 07:06:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311302 states, 311301 states have (on average 1.1710466718706332) internal successors, (364548), 311301 states have internal predecessors, (364548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311302 states to 311302 states and 364548 transitions. [2024-11-19 07:06:26,281 INFO L78 Accepts]: Start accepts. Automaton has 311302 states and 364548 transitions. Word has length 34 [2024-11-19 07:06:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:06:26,281 INFO L471 AbstractCegarLoop]: Abstraction has 311302 states and 364548 transitions. [2024-11-19 07:06:26,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 311302 states and 364548 transitions. [2024-11-19 07:06:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 07:06:26,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:06:26,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:06:26,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 07:06:26,468 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 07:06:26,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:06:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash -831647102, now seen corresponding path program 1 times [2024-11-19 07:06:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:06:26,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853438121] [2024-11-19 07:06:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:06:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:06:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:06:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:06:26,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:06:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853438121] [2024-11-19 07:06:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853438121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:06:26,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:06:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:06:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648142548] [2024-11-19 07:06:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:06:26,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:06:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:06:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:06:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:26,489 INFO L87 Difference]: Start difference. First operand 311302 states and 364548 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:06:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:06:28,288 INFO L93 Difference]: Finished difference Result 315401 states and 364550 transitions. [2024-11-19 07:06:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:06:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-19 07:06:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:06:28,647 INFO L225 Difference]: With dead ends: 315401 [2024-11-19 07:06:28,647 INFO L226 Difference]: Without dead ends: 315401 [2024-11-19 07:06:28,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:06:28,648 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 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-19 07:06:28,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:06:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315401 states.