./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 15:01:50,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 15:01:51,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 15:01:51,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 15:01:51,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 15:01:51,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 15:01:51,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 15:01:51,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 15:01:51,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 15:01:51,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 15:01:51,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 15:01:51,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 15:01:51,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 15:01:51,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 15:01:51,047 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 15:01:51,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 15:01:51,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 15:01:51,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 15:01:51,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 15:01:51,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 15:01:51,049 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 15:01:51,053 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 15:01:51,054 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 15:01:51,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 15:01:51,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 15:01:51,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 15:01:51,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 15:01:51,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 15:01:51,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 15:01:51,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 15:01:51,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 15:01:51,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 15:01:51,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 15:01:51,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:01:51,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 15:01:51,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 15:01:51,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 15:01:51,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 15:01:51,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 15:01:51,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 15:01:51,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 15:01:51,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 15:01:51,059 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2024-11-20 15:01:51,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 15:01:51,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 15:01:51,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 15:01:51,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 15:01:51,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 15:01:51,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2024-11-20 15:01:52,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 15:01:53,100 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 15:01:53,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2024-11-20 15:01:53,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312edc9f1/6ab764dde7b6497283d4b24fd572fe5f/FLAG5246e67ba [2024-11-20 15:01:53,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312edc9f1/6ab764dde7b6497283d4b24fd572fe5f [2024-11-20 15:01:53,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 15:01:53,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 15:01:53,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 15:01:53,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 15:01:53,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 15:01:53,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfabcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53, skipping insertion in model container [2024-11-20 15:01:53,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 15:01:53,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:01:53,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 15:01:53,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:01:53,434 INFO L204 MainTranslator]: Completed translation [2024-11-20 15:01:53,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53 WrapperNode [2024-11-20 15:01:53,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 15:01:53,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 15:01:53,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 15:01:53,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 15:01:53,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,472 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-20 15:01:53,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 15:01:53,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 15:01:53,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 15:01:53,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 15:01:53,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,507 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-20 15:01:53,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 15:01:53,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 15:01:53,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 15:01:53,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 15:01:53,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (1/1) ... [2024-11-20 15:01:53,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:01:53,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:01:53,574 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-20 15:01:53,581 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-20 15:01:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 15:01:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 15:01:53,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 15:01:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 15:01:53,706 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 15:01:53,710 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 15:01:53,981 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-20 15:01:53,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 15:01:54,001 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 15:01:54,002 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 15:01:54,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:01:54 BoogieIcfgContainer [2024-11-20 15:01:54,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 15:01:54,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 15:01:54,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 15:01:54,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 15:01:54,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:01:53" (1/3) ... [2024-11-20 15:01:54,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5830c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:01:54, skipping insertion in model container [2024-11-20 15:01:54,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:01:53" (2/3) ... [2024-11-20 15:01:54,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5830c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:01:54, skipping insertion in model container [2024-11-20 15:01:54,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:01:54" (3/3) ... [2024-11-20 15:01:54,028 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2024-11-20 15:01:54,043 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 15:01:54,043 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 15:01:54,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 15:01:54,098 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;@42d22485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 15:01:54,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 15:01:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 40 states have (on average 1.875) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 15:01:54,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:54,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 15:01:54,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:54,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash 28703470, now seen corresponding path program 1 times [2024-11-20 15:01:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570454305] [2024-11-20 15:01:54,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:54,292 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-20 15:01:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570454305] [2024-11-20 15:01:54,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570454305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:54,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:54,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:01:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700478815] [2024-11-20 15:01:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:54,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 15:01:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 15:01:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 15:01:54,331 INFO L87 Difference]: Start difference. First operand has 43 states, 40 states have (on average 1.875) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-20 15:01:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:54,344 INFO L93 Difference]: Finished difference Result 42 states and 71 transitions. [2024-11-20 15:01:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 15:01:54,346 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-20 15:01:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:54,352 INFO L225 Difference]: With dead ends: 42 [2024-11-20 15:01:54,352 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 15:01:54,353 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-20 15:01:54,356 INFO L432 NwaCegarLoop]: 71 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, 71 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-20 15:01:54,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 15:01:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-20 15:01:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 39 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2024-11-20 15:01:54,385 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 69 transitions. Word has length 5 [2024-11-20 15:01:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:54,385 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 69 transitions. [2024-11-20 15:01:54,385 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-20 15:01:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 69 transitions. [2024-11-20 15:01:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 15:01:54,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:54,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 15:01:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 15:01:54,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash 889697966, now seen corresponding path program 1 times [2024-11-20 15:01:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374141963] [2024-11-20 15:01:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:54,454 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-20 15:01:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:54,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374141963] [2024-11-20 15:01:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374141963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:54,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:54,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:01:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318191914] [2024-11-20 15:01:54,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:54,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:54,460 INFO L87 Difference]: Start difference. First operand 40 states and 69 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-20 15:01:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:54,475 INFO L93 Difference]: Finished difference Result 39 states and 68 transitions. [2024-11-20 15:01:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:54,476 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-20 15:01:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:54,477 INFO L225 Difference]: With dead ends: 39 [2024-11-20 15:01:54,477 INFO L226 Difference]: Without dead ends: 37 [2024-11-20 15:01:54,477 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-20 15:01:54,478 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 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-20 15:01:54,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-20 15:01:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-20 15:01:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2024-11-20 15:01:54,485 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 6 [2024-11-20 15:01:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:54,485 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 66 transitions. [2024-11-20 15:01:54,485 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-20 15:01:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. [2024-11-20 15:01:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 15:01:54,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:54,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 15:01:54,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:54,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash 458860360, now seen corresponding path program 1 times [2024-11-20 15:01:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733691876] [2024-11-20 15:01:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:54,566 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-20 15:01:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733691876] [2024-11-20 15:01:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733691876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143661283] [2024-11-20 15:01:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:54,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:54,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:54,570 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:54,617 INFO L93 Difference]: Finished difference Result 71 states and 127 transitions. [2024-11-20 15:01:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 15:01:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:54,620 INFO L225 Difference]: With dead ends: 71 [2024-11-20 15:01:54,620 INFO L226 Difference]: Without dead ends: 71 [2024-11-20 15:01:54,620 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-20 15:01:54,621 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:01:54,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-20 15:01:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2024-11-20 15:01:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 87 transitions. [2024-11-20 15:01:54,636 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 87 transitions. Word has length 18 [2024-11-20 15:01:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:54,637 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 87 transitions. [2024-11-20 15:01:54,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2024-11-20 15:01:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 15:01:54,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:54,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:54,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 15:01:54,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash -552256890, now seen corresponding path program 1 times [2024-11-20 15:01:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886206425] [2024-11-20 15:01:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:54,742 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-20 15:01:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886206425] [2024-11-20 15:01:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886206425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:54,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:54,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525974978] [2024-11-20 15:01:54,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:54,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:54,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:54,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:54,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:54,746 INFO L87 Difference]: Start difference. First operand 48 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:54,766 INFO L93 Difference]: Finished difference Result 71 states and 125 transitions. [2024-11-20 15:01:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 15:01:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:54,768 INFO L225 Difference]: With dead ends: 71 [2024-11-20 15:01:54,768 INFO L226 Difference]: Without dead ends: 71 [2024-11-20 15:01:54,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:54,769 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 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-20 15:01:54,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-20 15:01:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-11-20 15:01:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 123 transitions. [2024-11-20 15:01:54,778 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 123 transitions. Word has length 18 [2024-11-20 15:01:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:54,778 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 123 transitions. [2024-11-20 15:01:54,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 123 transitions. [2024-11-20 15:01:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:01:54,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:54,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:54,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 15:01:54,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:54,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1346377270, now seen corresponding path program 1 times [2024-11-20 15:01:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:54,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593307328] [2024-11-20 15:01:54,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:54,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:54,842 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-20 15:01:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593307328] [2024-11-20 15:01:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593307328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:54,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950954370] [2024-11-20 15:01:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:54,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:54,845 INFO L87 Difference]: Start difference. First operand 68 states and 123 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:54,863 INFO L93 Difference]: Finished difference Result 74 states and 127 transitions. [2024-11-20 15:01:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 15:01:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:54,865 INFO L225 Difference]: With dead ends: 74 [2024-11-20 15:01:54,865 INFO L226 Difference]: Without dead ends: 74 [2024-11-20 15:01:54,865 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-20 15:01:54,866 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:01:54,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-20 15:01:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-11-20 15:01:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 125 transitions. [2024-11-20 15:01:54,874 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 125 transitions. Word has length 19 [2024-11-20 15:01:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:54,875 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 125 transitions. [2024-11-20 15:01:54,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 125 transitions. [2024-11-20 15:01:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:01:54,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:54,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:54,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 15:01:54,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:54,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash 66513592, now seen corresponding path program 1 times [2024-11-20 15:01:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308248662] [2024-11-20 15:01:54,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:54,946 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-20 15:01:54,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308248662] [2024-11-20 15:01:54,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308248662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:54,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:54,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097259205] [2024-11-20 15:01:54,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:54,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:54,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:54,949 INFO L87 Difference]: Start difference. First operand 71 states and 125 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:54,976 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2024-11-20 15:01:54,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:54,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 15:01:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:54,978 INFO L225 Difference]: With dead ends: 133 [2024-11-20 15:01:54,978 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 15:01:54,978 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-20 15:01:54,979 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 46 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 128 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-20 15:01:54,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 15:01:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2024-11-20 15:01:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2024-11-20 15:01:54,999 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 19 [2024-11-20 15:01:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,000 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2024-11-20 15:01:55,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2024-11-20 15:01:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 15:01:55,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,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] [2024-11-20 15:01:55,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 15:01:55,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,003 INFO L85 PathProgramCache]: Analyzing trace with hash -944603658, now seen corresponding path program 1 times [2024-11-20 15:01:55,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930647445] [2024-11-20 15:01:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,063 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-20 15:01:55,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930647445] [2024-11-20 15:01:55,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930647445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608322417] [2024-11-20 15:01:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,068 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,091 INFO L93 Difference]: Finished difference Result 135 states and 234 transitions. [2024-11-20 15:01:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 15:01:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,093 INFO L225 Difference]: With dead ends: 135 [2024-11-20 15:01:55,093 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 15:01:55,093 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-20 15:01:55,094 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 146 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-20 15:01:55,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 15:01:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-20 15:01:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 232 transitions. [2024-11-20 15:01:55,106 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 232 transitions. Word has length 19 [2024-11-20 15:01:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,107 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 232 transitions. [2024-11-20 15:01:55,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 232 transitions. [2024-11-20 15:01:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:01:55,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:55,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 15:01:55,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539921, now seen corresponding path program 1 times [2024-11-20 15:01:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477091579] [2024-11-20 15:01:55,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,148 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-20 15:01:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477091579] [2024-11-20 15:01:55,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477091579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798960187] [2024-11-20 15:01:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,153 INFO L87 Difference]: Start difference. First operand 132 states and 232 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,168 INFO L93 Difference]: Finished difference Result 137 states and 234 transitions. [2024-11-20 15:01:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 15:01:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,172 INFO L225 Difference]: With dead ends: 137 [2024-11-20 15:01:55,172 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 15:01:55,173 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-20 15:01:55,174 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:01:55,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 15:01:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-20 15:01:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 232 transitions. [2024-11-20 15:01:55,191 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 232 transitions. Word has length 20 [2024-11-20 15:01:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,192 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 232 transitions. [2024-11-20 15:01:55,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 232 transitions. [2024-11-20 15:01:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:01:55,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:55,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 15:01:55,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 788676243, now seen corresponding path program 1 times [2024-11-20 15:01:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114404362] [2024-11-20 15:01:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,247 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-20 15:01:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114404362] [2024-11-20 15:01:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114404362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086196895] [2024-11-20 15:01:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,251 INFO L87 Difference]: Start difference. First operand 134 states and 232 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,278 INFO L93 Difference]: Finished difference Result 257 states and 438 transitions. [2024-11-20 15:01:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 15:01:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,280 INFO L225 Difference]: With dead ends: 257 [2024-11-20 15:01:55,280 INFO L226 Difference]: Without dead ends: 257 [2024-11-20 15:01:55,280 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-20 15:01:55,281 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 130 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-20 15:01:55,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-20 15:01:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2024-11-20 15:01:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.7233201581027668) internal successors, (436), 253 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 436 transitions. [2024-11-20 15:01:55,313 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 436 transitions. Word has length 20 [2024-11-20 15:01:55,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,314 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 436 transitions. [2024-11-20 15:01:55,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 436 transitions. [2024-11-20 15:01:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:01:55,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:55,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 15:01:55,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1799793493, now seen corresponding path program 1 times [2024-11-20 15:01:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809833313] [2024-11-20 15:01:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,359 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-20 15:01:55,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809833313] [2024-11-20 15:01:55,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809833313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241049437] [2024-11-20 15:01:55,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,361 INFO L87 Difference]: Start difference. First operand 254 states and 436 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,377 INFO L93 Difference]: Finished difference Result 321 states and 554 transitions. [2024-11-20 15:01:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 15:01:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,379 INFO L225 Difference]: With dead ends: 321 [2024-11-20 15:01:55,379 INFO L226 Difference]: Without dead ends: 321 [2024-11-20 15:01:55,380 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-20 15:01:55,380 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 43 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 173 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-20 15:01:55,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 173 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-20 15:01:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 254. [2024-11-20 15:01:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 432 transitions. [2024-11-20 15:01:55,400 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 432 transitions. Word has length 20 [2024-11-20 15:01:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,401 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 432 transitions. [2024-11-20 15:01:55,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 432 transitions. [2024-11-20 15:01:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:01:55,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:55,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 15:01:55,408 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1314211103, now seen corresponding path program 1 times [2024-11-20 15:01:55,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122346712] [2024-11-20 15:01:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,443 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-20 15:01:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122346712] [2024-11-20 15:01:55,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122346712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714854087] [2024-11-20 15:01:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,445 INFO L87 Difference]: Start difference. First operand 254 states and 432 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,463 INFO L93 Difference]: Finished difference Result 469 states and 802 transitions. [2024-11-20 15:01:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 15:01:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,465 INFO L225 Difference]: With dead ends: 469 [2024-11-20 15:01:55,465 INFO L226 Difference]: Without dead ends: 469 [2024-11-20 15:01:55,466 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-20 15:01:55,466 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 40 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 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-20 15:01:55,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-20 15:01:55,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 354. [2024-11-20 15:01:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.6770538243626063) internal successors, (592), 353 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 592 transitions. [2024-11-20 15:01:55,480 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 592 transitions. Word has length 21 [2024-11-20 15:01:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,480 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 592 transitions. [2024-11-20 15:01:55,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 592 transitions. [2024-11-20 15:01:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 15:01:55,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:55,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 15:01:55,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1969638943, now seen corresponding path program 1 times [2024-11-20 15:01:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851404919] [2024-11-20 15:01:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,544 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-20 15:01:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851404919] [2024-11-20 15:01:55,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851404919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392272627] [2024-11-20 15:01:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,545 INFO L87 Difference]: Start difference. First operand 354 states and 592 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,563 INFO L93 Difference]: Finished difference Result 493 states and 814 transitions. [2024-11-20 15:01:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 15:01:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,566 INFO L225 Difference]: With dead ends: 493 [2024-11-20 15:01:55,566 INFO L226 Difference]: Without dead ends: 493 [2024-11-20 15:01:55,566 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-20 15:01:55,567 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 148 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-20 15:01:55,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-20 15:01:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2024-11-20 15:01:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.6605316973415134) internal successors, (812), 489 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 812 transitions. [2024-11-20 15:01:55,585 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 812 transitions. Word has length 21 [2024-11-20 15:01:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,586 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 812 transitions. [2024-11-20 15:01:55,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 812 transitions. [2024-11-20 15:01:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 15:01:55,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,589 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-20 15:01:55,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 15:01:55,589 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2079198818, now seen corresponding path program 1 times [2024-11-20 15:01:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23742312] [2024-11-20 15:01:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,619 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-20 15:01:55,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23742312] [2024-11-20 15:01:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23742312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033261537] [2024-11-20 15:01:55,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,622 INFO L87 Difference]: Start difference. First operand 490 states and 812 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-20 15:01:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,640 INFO L93 Difference]: Finished difference Result 505 states and 822 transitions. [2024-11-20 15:01:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,641 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-20 15:01:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,643 INFO L225 Difference]: With dead ends: 505 [2024-11-20 15:01:55,645 INFO L226 Difference]: Without dead ends: 505 [2024-11-20 15:01:55,645 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-20 15:01:55,646 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 151 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-20 15:01:55,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-20 15:01:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2024-11-20 15:01:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 820 transitions. [2024-11-20 15:01:55,659 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 820 transitions. Word has length 22 [2024-11-20 15:01:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,659 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 820 transitions. [2024-11-20 15:01:55,660 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-20 15:01:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 820 transitions. [2024-11-20 15:01:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 15:01:55,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,661 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-20 15:01:55,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 15:01:55,661 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash 935904800, now seen corresponding path program 1 times [2024-11-20 15:01:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783309472] [2024-11-20 15:01:55,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:01:55,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783309472] [2024-11-20 15:01:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783309472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436851548] [2024-11-20 15:01:55,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,700 INFO L87 Difference]: Start difference. First operand 502 states and 820 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-20 15:01:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,718 INFO L93 Difference]: Finished difference Result 905 states and 1486 transitions. [2024-11-20 15:01:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,719 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-20 15:01:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,722 INFO L225 Difference]: With dead ends: 905 [2024-11-20 15:01:55,723 INFO L226 Difference]: Without dead ends: 905 [2024-11-20 15:01:55,723 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-20 15:01:55,724 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 122 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-20 15:01:55,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-20 15:01:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 710. [2024-11-20 15:01:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1132 transitions. [2024-11-20 15:01:55,741 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1132 transitions. Word has length 22 [2024-11-20 15:01:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,741 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1132 transitions. [2024-11-20 15:01:55,742 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-20 15:01:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1132 transitions. [2024-11-20 15:01:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 15:01:55,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,743 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-20 15:01:55,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 15:01:55,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash -75212450, now seen corresponding path program 1 times [2024-11-20 15:01:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649109276] [2024-11-20 15:01:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,764 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-20 15:01:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649109276] [2024-11-20 15:01:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649109276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663102462] [2024-11-20 15:01:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,767 INFO L87 Difference]: Start difference. First operand 710 states and 1132 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-20 15:01:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,786 INFO L93 Difference]: Finished difference Result 969 states and 1526 transitions. [2024-11-20 15:01:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,787 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-20 15:01:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,790 INFO L225 Difference]: With dead ends: 969 [2024-11-20 15:01:55,790 INFO L226 Difference]: Without dead ends: 969 [2024-11-20 15:01:55,791 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-20 15:01:55,791 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 149 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-20 15:01:55,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-20 15:01:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 966. [2024-11-20 15:01:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1524 transitions. [2024-11-20 15:01:55,811 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1524 transitions. Word has length 22 [2024-11-20 15:01:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,811 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1524 transitions. [2024-11-20 15:01:55,811 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-20 15:01:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1524 transitions. [2024-11-20 15:01:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 15:01:55,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,813 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-20 15:01:55,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 15:01:55,813 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1045071990, now seen corresponding path program 1 times [2024-11-20 15:01:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541976896] [2024-11-20 15:01:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,835 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-20 15:01:55,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541976896] [2024-11-20 15:01:55,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541976896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102181840] [2024-11-20 15:01:55,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,837 INFO L87 Difference]: Start difference. First operand 966 states and 1524 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-20 15:01:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,856 INFO L93 Difference]: Finished difference Result 985 states and 1526 transitions. [2024-11-20 15:01:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,856 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-20 15:01:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,861 INFO L225 Difference]: With dead ends: 985 [2024-11-20 15:01:55,862 INFO L226 Difference]: Without dead ends: 985 [2024-11-20 15:01:55,862 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-20 15:01:55,863 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 147 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-20 15:01:55,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-20 15:01:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 982. [2024-11-20 15:01:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1524 transitions. [2024-11-20 15:01:55,882 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1524 transitions. Word has length 23 [2024-11-20 15:01:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,883 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1524 transitions. [2024-11-20 15:01:55,883 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-20 15:01:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1524 transitions. [2024-11-20 15:01:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 15:01:55,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,884 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-20 15:01:55,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 15:01:55,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1970031628, now seen corresponding path program 1 times [2024-11-20 15:01:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393291862] [2024-11-20 15:01:55,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:55,914 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-20 15:01:55,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393291862] [2024-11-20 15:01:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393291862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:55,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:55,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904343297] [2024-11-20 15:01:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:55,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:55,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,920 INFO L87 Difference]: Start difference. First operand 982 states and 1524 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-20 15:01:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:55,937 INFO L93 Difference]: Finished difference Result 1737 states and 2710 transitions. [2024-11-20 15:01:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:55,938 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-20 15:01:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:55,943 INFO L225 Difference]: With dead ends: 1737 [2024-11-20 15:01:55,944 INFO L226 Difference]: Without dead ends: 1737 [2024-11-20 15:01:55,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:55,945 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 120 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-20 15:01:55,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2024-11-20 15:01:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1414. [2024-11-20 15:01:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2132 transitions. [2024-11-20 15:01:55,974 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2132 transitions. Word has length 23 [2024-11-20 15:01:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:55,975 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2132 transitions. [2024-11-20 15:01:55,975 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-20 15:01:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2132 transitions. [2024-11-20 15:01:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 15:01:55,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:55,978 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-20 15:01:55,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 15:01:55,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:55,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash 958914378, now seen corresponding path program 1 times [2024-11-20 15:01:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:55,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258225526] [2024-11-20 15:01:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:55,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:56,001 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-20 15:01:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258225526] [2024-11-20 15:01:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258225526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:56,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218026162] [2024-11-20 15:01:56,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:56,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:56,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:56,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:56,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:56,004 INFO L87 Difference]: Start difference. First operand 1414 states and 2132 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-20 15:01:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:56,021 INFO L93 Difference]: Finished difference Result 1897 states and 2822 transitions. [2024-11-20 15:01:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:56,021 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-20 15:01:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:56,027 INFO L225 Difference]: With dead ends: 1897 [2024-11-20 15:01:56,027 INFO L226 Difference]: Without dead ends: 1897 [2024-11-20 15:01:56,028 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-20 15:01:56,030 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 150 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-20 15:01:56,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2024-11-20 15:01:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1894. [2024-11-20 15:01:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2820 transitions. [2024-11-20 15:01:56,077 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2820 transitions. Word has length 23 [2024-11-20 15:01:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:56,078 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2820 transitions. [2024-11-20 15:01:56,078 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-20 15:01:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2820 transitions. [2024-11-20 15:01:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 15:01:56,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:56,081 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-20 15:01:56,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 15:01:56,082 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:56,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 948099177, now seen corresponding path program 1 times [2024-11-20 15:01:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:56,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542473423] [2024-11-20 15:01:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:01:56,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542473423] [2024-11-20 15:01:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542473423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:56,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:56,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875362173] [2024-11-20 15:01:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:56,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:56,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:56,114 INFO L87 Difference]: Start difference. First operand 1894 states and 2820 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-20 15:01:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:56,139 INFO L93 Difference]: Finished difference Result 1929 states and 2822 transitions. [2024-11-20 15:01:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:56,140 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-20 15:01:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:56,146 INFO L225 Difference]: With dead ends: 1929 [2024-11-20 15:01:56,147 INFO L226 Difference]: Without dead ends: 1929 [2024-11-20 15:01:56,147 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-20 15:01:56,147 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 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-20 15:01:56,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-20 15:01:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1926. [2024-11-20 15:01:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2820 transitions. [2024-11-20 15:01:56,186 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2820 transitions. Word has length 24 [2024-11-20 15:01:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:56,187 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2820 transitions. [2024-11-20 15:01:56,187 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-20 15:01:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2820 transitions. [2024-11-20 15:01:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 15:01:56,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:56,189 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-20 15:01:56,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 15:01:56,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:56,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash -331764501, now seen corresponding path program 1 times [2024-11-20 15:01:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:56,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724734680] [2024-11-20 15:01:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:56,221 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-20 15:01:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724734680] [2024-11-20 15:01:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724734680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195168111] [2024-11-20 15:01:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:56,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:56,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:56,224 INFO L87 Difference]: Start difference. First operand 1926 states and 2820 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-20 15:01:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:56,247 INFO L93 Difference]: Finished difference Result 3337 states and 4902 transitions. [2024-11-20 15:01:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:56,248 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-20 15:01:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:56,258 INFO L225 Difference]: With dead ends: 3337 [2024-11-20 15:01:56,258 INFO L226 Difference]: Without dead ends: 3337 [2024-11-20 15:01:56,258 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-20 15:01:56,260 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 118 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-20 15:01:56,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2024-11-20 15:01:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2822. [2024-11-20 15:01:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 4004 transitions. [2024-11-20 15:01:56,322 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 4004 transitions. Word has length 24 [2024-11-20 15:01:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:56,323 INFO L471 AbstractCegarLoop]: Abstraction has 2822 states and 4004 transitions. [2024-11-20 15:01:56,323 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-20 15:01:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 4004 transitions. [2024-11-20 15:01:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 15:01:56,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:56,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:56,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 15:01:56,328 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:56,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1342881751, now seen corresponding path program 1 times [2024-11-20 15:01:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:56,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311920655] [2024-11-20 15:01:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:56,363 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-20 15:01:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311920655] [2024-11-20 15:01:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311920655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:56,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346511197] [2024-11-20 15:01:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:56,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:56,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:56,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:56,365 INFO L87 Difference]: Start difference. First operand 2822 states and 4004 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-20 15:01:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:56,393 INFO L93 Difference]: Finished difference Result 3721 states and 5190 transitions. [2024-11-20 15:01:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:56,393 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-20 15:01:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:56,406 INFO L225 Difference]: With dead ends: 3721 [2024-11-20 15:01:56,406 INFO L226 Difference]: Without dead ends: 3721 [2024-11-20 15:01:56,406 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-20 15:01:56,407 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 151 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-20 15:01:56,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-11-20 15:01:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3718. [2024-11-20 15:01:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3718 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 5188 transitions. [2024-11-20 15:01:56,498 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 5188 transitions. Word has length 24 [2024-11-20 15:01:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:56,499 INFO L471 AbstractCegarLoop]: Abstraction has 3718 states and 5188 transitions. [2024-11-20 15:01:56,499 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-20 15:01:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 5188 transitions. [2024-11-20 15:01:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 15:01:56,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:56,503 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-20 15:01:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 15:01:56,504 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:56,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1688093515, now seen corresponding path program 1 times [2024-11-20 15:01:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:56,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210856229] [2024-11-20 15:01:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:56,524 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-20 15:01:56,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:56,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210856229] [2024-11-20 15:01:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210856229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:56,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622156695] [2024-11-20 15:01:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:56,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:56,526 INFO L87 Difference]: Start difference. First operand 3718 states and 5188 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-20 15:01:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:56,551 INFO L93 Difference]: Finished difference Result 3785 states and 5190 transitions. [2024-11-20 15:01:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:56,551 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-20 15:01:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:56,565 INFO L225 Difference]: With dead ends: 3785 [2024-11-20 15:01:56,565 INFO L226 Difference]: Without dead ends: 3785 [2024-11-20 15:01:56,566 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-20 15:01:56,566 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 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-20 15:01:56,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2024-11-20 15:01:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3782. [2024-11-20 15:01:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5188 transitions. [2024-11-20 15:01:56,636 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5188 transitions. Word has length 25 [2024-11-20 15:01:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:56,636 INFO L471 AbstractCegarLoop]: Abstraction has 3782 states and 5188 transitions. [2024-11-20 15:01:56,636 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-20 15:01:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5188 transitions. [2024-11-20 15:01:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 15:01:56,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:56,643 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-20 15:01:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 15:01:56,643 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:56,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1327010103, now seen corresponding path program 1 times [2024-11-20 15:01:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417858735] [2024-11-20 15:01:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:56,666 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-20 15:01:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417858735] [2024-11-20 15:01:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417858735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:56,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042847232] [2024-11-20 15:01:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:56,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:56,668 INFO L87 Difference]: Start difference. First operand 3782 states and 5188 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-20 15:01:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:56,699 INFO L93 Difference]: Finished difference Result 6409 states and 8774 transitions. [2024-11-20 15:01:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:56,700 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-20 15:01:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:56,729 INFO L225 Difference]: With dead ends: 6409 [2024-11-20 15:01:56,729 INFO L226 Difference]: Without dead ends: 6409 [2024-11-20 15:01:56,729 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-20 15:01:56,730 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 116 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-20 15:01:56,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2024-11-20 15:01:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 5638. [2024-11-20 15:01:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 7492 transitions. [2024-11-20 15:01:56,878 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 7492 transitions. Word has length 25 [2024-11-20 15:01:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:56,879 INFO L471 AbstractCegarLoop]: Abstraction has 5638 states and 7492 transitions. [2024-11-20 15:01:56,879 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-20 15:01:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 7492 transitions. [2024-11-20 15:01:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 15:01:56,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:56,889 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-20 15:01:56,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 15:01:56,890 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash 315892853, now seen corresponding path program 1 times [2024-11-20 15:01:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603045066] [2024-11-20 15:01:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:56,914 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-20 15:01:56,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:56,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603045066] [2024-11-20 15:01:56,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603045066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:56,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:56,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:56,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589998570] [2024-11-20 15:01:56,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:56,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:56,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:56,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:56,918 INFO L87 Difference]: Start difference. First operand 5638 states and 7492 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-20 15:01:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:56,968 INFO L93 Difference]: Finished difference Result 7305 states and 9478 transitions. [2024-11-20 15:01:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:56,969 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-20 15:01:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:56,984 INFO L225 Difference]: With dead ends: 7305 [2024-11-20 15:01:56,984 INFO L226 Difference]: Without dead ends: 7305 [2024-11-20 15:01:56,985 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-20 15:01:56,986 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 42 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 152 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-20 15:01:56,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7305 states. [2024-11-20 15:01:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7305 to 7302. [2024-11-20 15:01:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7302 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9476 transitions. [2024-11-20 15:01:57,113 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9476 transitions. Word has length 25 [2024-11-20 15:01:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:57,113 INFO L471 AbstractCegarLoop]: Abstraction has 7302 states and 9476 transitions. [2024-11-20 15:01:57,114 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-20 15:01:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9476 transitions. [2024-11-20 15:01:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 15:01:57,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:57,122 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-20 15:01:57,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 15:01:57,122 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:57,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1805677772, now seen corresponding path program 1 times [2024-11-20 15:01:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:57,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766881332] [2024-11-20 15:01:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:57,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:57,143 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-20 15:01:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766881332] [2024-11-20 15:01:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766881332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354306893] [2024-11-20 15:01:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:57,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:57,146 INFO L87 Difference]: Start difference. First operand 7302 states and 9476 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-20 15:01:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:57,179 INFO L93 Difference]: Finished difference Result 7433 states and 9478 transitions. [2024-11-20 15:01:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:57,179 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-20 15:01:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:57,192 INFO L225 Difference]: With dead ends: 7433 [2024-11-20 15:01:57,192 INFO L226 Difference]: Without dead ends: 7433 [2024-11-20 15:01:57,192 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-20 15:01:57,194 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 135 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-20 15:01:57,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2024-11-20 15:01:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7430. [2024-11-20 15:01:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7430 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7430 states to 7430 states and 9476 transitions. [2024-11-20 15:01:57,342 INFO L78 Accepts]: Start accepts. Automaton has 7430 states and 9476 transitions. Word has length 26 [2024-11-20 15:01:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:57,343 INFO L471 AbstractCegarLoop]: Abstraction has 7430 states and 9476 transitions. [2024-11-20 15:01:57,346 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-20 15:01:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 7430 states and 9476 transitions. [2024-11-20 15:01:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 15:01:57,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:57,355 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-20 15:01:57,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 15:01:57,356 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:57,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1209425846, now seen corresponding path program 1 times [2024-11-20 15:01:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825157457] [2024-11-20 15:01:57,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:57,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:57,385 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-20 15:01:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825157457] [2024-11-20 15:01:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825157457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540995861] [2024-11-20 15:01:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:57,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:57,387 INFO L87 Difference]: Start difference. First operand 7430 states and 9476 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-20 15:01:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:57,433 INFO L93 Difference]: Finished difference Result 12297 states and 15494 transitions. [2024-11-20 15:01:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:57,434 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-20 15:01:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:57,456 INFO L225 Difference]: With dead ends: 12297 [2024-11-20 15:01:57,456 INFO L226 Difference]: Without dead ends: 12297 [2024-11-20 15:01:57,457 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-20 15:01:57,457 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 114 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-20 15:01:57,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 114 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12297 states. [2024-11-20 15:01:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12297 to 11270. [2024-11-20 15:01:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11270 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 13956 transitions. [2024-11-20 15:01:57,679 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 13956 transitions. Word has length 26 [2024-11-20 15:01:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:57,680 INFO L471 AbstractCegarLoop]: Abstraction has 11270 states and 13956 transitions. [2024-11-20 15:01:57,680 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-20 15:01:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 13956 transitions. [2024-11-20 15:01:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 15:01:57,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:57,696 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-20 15:01:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 15:01:57,696 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 198308596, now seen corresponding path program 1 times [2024-11-20 15:01:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718236022] [2024-11-20 15:01:57,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:57,720 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-20 15:01:57,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718236022] [2024-11-20 15:01:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718236022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:57,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:57,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478687354] [2024-11-20 15:01:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:57,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:57,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:57,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:57,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:57,722 INFO L87 Difference]: Start difference. First operand 11270 states and 13956 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-20 15:01:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:57,781 INFO L93 Difference]: Finished difference Result 14345 states and 17158 transitions. [2024-11-20 15:01:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:57,781 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-20 15:01:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:57,808 INFO L225 Difference]: With dead ends: 14345 [2024-11-20 15:01:57,808 INFO L226 Difference]: Without dead ends: 14345 [2024-11-20 15:01:57,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-20 15:01:57,809 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 153 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-20 15:01:57,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14345 states. [2024-11-20 15:01:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14345 to 14342. [2024-11-20 15:01:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14342 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14342 states to 14342 states and 17156 transitions. [2024-11-20 15:01:58,101 INFO L78 Accepts]: Start accepts. Automaton has 14342 states and 17156 transitions. Word has length 26 [2024-11-20 15:01:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:58,101 INFO L471 AbstractCegarLoop]: Abstraction has 14342 states and 17156 transitions. [2024-11-20 15:01:58,101 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-20 15:01:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14342 states and 17156 transitions. [2024-11-20 15:01:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 15:01:58,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:58,191 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-20 15:01:58,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 15:01:58,191 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:58,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1155811872, now seen corresponding path program 1 times [2024-11-20 15:01:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142391581] [2024-11-20 15:01:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:01:58,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142391581] [2024-11-20 15:01:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142391581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:58,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:58,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:58,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684866531] [2024-11-20 15:01:58,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:58,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:58,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:58,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:58,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:58,240 INFO L87 Difference]: Start difference. First operand 14342 states and 17156 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-20 15:01:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:58,290 INFO L93 Difference]: Finished difference Result 14601 states and 17158 transitions. [2024-11-20 15:01:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:58,291 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-20 15:01:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:58,318 INFO L225 Difference]: With dead ends: 14601 [2024-11-20 15:01:58,319 INFO L226 Difference]: Without dead ends: 14601 [2024-11-20 15:01:58,319 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-20 15:01:58,320 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 131 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-20 15:01:58,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2024-11-20 15:01:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14598. [2024-11-20 15:01:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14598 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14598 states to 14598 states and 17156 transitions. [2024-11-20 15:01:58,599 INFO L78 Accepts]: Start accepts. Automaton has 14598 states and 17156 transitions. Word has length 27 [2024-11-20 15:01:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:58,600 INFO L471 AbstractCegarLoop]: Abstraction has 14598 states and 17156 transitions. [2024-11-20 15:01:58,600 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-20 15:01:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 14598 states and 17156 transitions. [2024-11-20 15:01:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 15:01:58,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:58,618 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-20 15:01:58,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 15:01:58,619 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1859291746, now seen corresponding path program 1 times [2024-11-20 15:01:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419126972] [2024-11-20 15:01:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:58,638 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-20 15:01:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:58,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419126972] [2024-11-20 15:01:58,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419126972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:58,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:58,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:58,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123357347] [2024-11-20 15:01:58,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:58,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:58,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:58,640 INFO L87 Difference]: Start difference. First operand 14598 states and 17156 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-20 15:01:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:58,743 INFO L93 Difference]: Finished difference Result 23558 states and 26884 transitions. [2024-11-20 15:01:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:58,744 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-20 15:01:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:58,785 INFO L225 Difference]: With dead ends: 23558 [2024-11-20 15:01:58,785 INFO L226 Difference]: Without dead ends: 23558 [2024-11-20 15:01:58,786 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-20 15:01:58,787 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 110 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-20 15:01:58,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 110 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23558 states. [2024-11-20 15:01:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23558 to 22534. [2024-11-20 15:01:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.1476501131673547) internal successors, (25860), 22533 states have internal predecessors, (25860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 25860 transitions. [2024-11-20 15:01:59,200 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 25860 transitions. Word has length 27 [2024-11-20 15:01:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:59,201 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 25860 transitions. [2024-11-20 15:01:59,201 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-20 15:01:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 25860 transitions. [2024-11-20 15:01:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 15:01:59,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:59,230 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-20 15:01:59,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 15:01:59,231 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 15:01:59,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 848174496, now seen corresponding path program 1 times [2024-11-20 15:01:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:59,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748133993] [2024-11-20 15:01:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:59,259 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-20 15:01:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748133993] [2024-11-20 15:01:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748133993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:01:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:01:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:01:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064808792] [2024-11-20 15:01:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:01:59,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:01:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:01:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:01:59,261 INFO L87 Difference]: Start difference. First operand 22534 states and 25860 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-20 15:01:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:59,337 INFO L93 Difference]: Finished difference Result 28163 states and 30722 transitions. [2024-11-20 15:01:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:01:59,337 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-20 15:01:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:59,338 INFO L225 Difference]: With dead ends: 28163 [2024-11-20 15:01:59,338 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 15:01:59,338 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-20 15:01:59,339 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 150 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-20 15:01:59,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:01:59,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 15:01:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 15:01:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 15:01:59,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-11-20 15:01:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:59,340 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 15:01:59,341 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-20 15:01:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 15:01:59,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 15:01:59,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-20 15:01:59,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-20 15:01:59,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-20 15:01:59,347 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:59,349 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 15:01:59,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:01:59 BoogieIcfgContainer [2024-11-20 15:01:59,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 15:01:59,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 15:01:59,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 15:01:59,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 15:01:59,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:01:54" (3/4) ... [2024-11-20 15:01:59,355 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 15:01:59,365 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-20 15:01:59,365 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-20 15:01:59,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 15:01:59,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 15:01:59,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 15:01:59,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 15:01:59,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 15:01:59,463 INFO L158 Benchmark]: Toolchain (without parser) took 6331.25ms. Allocated memory was 144.7MB in the beginning and 373.3MB in the end (delta: 228.6MB). Free memory was 92.4MB in the beginning and 156.6MB in the end (delta: -64.3MB). Peak memory consumption was 166.1MB. Max. memory is 16.1GB. [2024-11-20 15:01:59,463 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 15:01:59,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.58ms. Allocated memory is still 144.7MB. Free memory was 92.0MB in the beginning and 79.0MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 15:01:59,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.04ms. Allocated memory is still 144.7MB. Free memory was 79.0MB in the beginning and 77.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 15:01:59,465 INFO L158 Benchmark]: Boogie Preprocessor took 48.27ms. Allocated memory is still 144.7MB. Free memory was 77.3MB in the beginning and 75.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 15:01:59,465 INFO L158 Benchmark]: RCFGBuilder took 481.35ms. Allocated memory is still 144.7MB. Free memory was 75.2MB in the beginning and 59.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 15:01:59,467 INFO L158 Benchmark]: TraceAbstraction took 5333.25ms. Allocated memory was 144.7MB in the beginning and 373.3MB in the end (delta: 228.6MB). Free memory was 115.8MB in the beginning and 162.9MB in the end (delta: -47.1MB). Peak memory consumption was 180.6MB. Max. memory is 16.1GB. [2024-11-20 15:01:59,468 INFO L158 Benchmark]: Witness Printer took 109.53ms. Allocated memory is still 373.3MB. Free memory was 162.9MB in the beginning and 156.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 15:01:59,468 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.58ms. Allocated memory is still 144.7MB. Free memory was 92.0MB in the beginning and 79.0MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.04ms. Allocated memory is still 144.7MB. Free memory was 79.0MB in the beginning and 77.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.27ms. Allocated memory is still 144.7MB. Free memory was 77.3MB in the beginning and 75.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.35ms. Allocated memory is still 144.7MB. Free memory was 75.2MB in the beginning and 59.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5333.25ms. Allocated memory was 144.7MB in the beginning and 373.3MB in the end (delta: 228.6MB). Free memory was 115.8MB in the beginning and 162.9MB in the end (delta: -47.1MB). Peak memory consumption was 180.6MB. Max. memory is 16.1GB. * Witness Printer took 109.53ms. Allocated memory is still 373.3MB. Free memory was 162.9MB in the beginning and 156.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1234 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1234 mSDsluCounter, 4036 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1556 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2480 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22534occurred in iteration=29, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 4150 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-20 15:01:59,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE