./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_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:21:25,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:21:26,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:21:26,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:21:26,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:21:26,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:21:26,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:21:26,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:21:26,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:21:26,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:21:26,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:21:26,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:21:26,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:21:26,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:21:26,098 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:21:26,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:21:26,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:21:26,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:21:26,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:21:26,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:21:26,099 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:21:26,100 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:21:26,100 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:21:26,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:21:26,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:21:26,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:21:26,101 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:21:26,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:21:26,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:21:26,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:21:26,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:21:26,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:21:26,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:21:26,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:21:26,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:21:26,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:21:26,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:21:26,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:21:26,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:21:26,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:21:26,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:21:26,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:21:26,109 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-clean/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-clean/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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2024-10-11 18:21:26,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:21:26,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:21:26,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:21:26,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:21:26,385 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:21:26,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-10-11 18:21:27,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:21:28,123 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:21:28,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-10-11 18:21:28,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc0ba8639/6bcbf49e03c34c84ab85bf78e75226dd/FLAGade02cbf9 [2024-10-11 18:21:28,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc0ba8639/6bcbf49e03c34c84ab85bf78e75226dd [2024-10-11 18:21:28,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:21:28,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:21:28,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:21:28,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:21:28,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:21:28,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d9d17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28, skipping insertion in model container [2024-10-11 18:21:28,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:21:28,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:21:28,796 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:21:28,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:21:28,833 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:21:28,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28 WrapperNode [2024-10-11 18:21:28,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:21:28,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:21:28,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:21:28,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:21:28,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,871 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2024-10-11 18:21:28,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:21:28,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:21:28,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:21:28,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:21:28,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,899 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-10-11 18:21:28,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:21:28,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:21:28,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:21:28,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:21:28,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (1/1) ... [2024-10-11 18:21:28,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:21:28,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:21:28,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:21:28,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:21:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:21:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:21:29,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:21:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:21:29,078 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:21:29,082 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:21:29,332 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-11 18:21:29,332 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:21:29,366 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:21:29,366 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:21:29,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:29 BoogieIcfgContainer [2024-10-11 18:21:29,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:21:29,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:21:29,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:21:29,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:21:29,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:21:28" (1/3) ... [2024-10-11 18:21:29,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48389822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:21:29, skipping insertion in model container [2024-10-11 18:21:29,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:28" (2/3) ... [2024-10-11 18:21:29,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48389822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:21:29, skipping insertion in model container [2024-10-11 18:21:29,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:29" (3/3) ... [2024-10-11 18:21:29,376 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2024-10-11 18:21:29,398 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:21:29,399 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 18:21:29,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:21:29,463 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;@3a156740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:21:29,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 18:21:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 40 states have (on average 1.95) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:21:29,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:29,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:21:29,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:29,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 7492822, now seen corresponding path program 1 times [2024-10-11 18:21:29,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:29,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255984289] [2024-10-11 18:21:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:29,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:29,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255984289] [2024-10-11 18:21:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255984289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:29,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:21:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690818405] [2024-10-11 18:21:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 18:21:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 18:21:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:21:29,684 INFO L87 Difference]: Start difference. First operand has 43 states, 40 states have (on average 1.95) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:29,705 INFO L93 Difference]: Finished difference Result 43 states and 75 transitions. [2024-10-11 18:21:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 18:21:29,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-11 18:21:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:29,715 INFO L225 Difference]: With dead ends: 43 [2024-10-11 18:21:29,715 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 18:21:29,717 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-10-11 18:21:29,720 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:29,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 18:21:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 18:21:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.85) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2024-10-11 18:21:29,762 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 4 [2024-10-11 18:21:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:29,763 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2024-10-11 18:21:29,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2024-10-11 18:21:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:21:29,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:29,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:21:29,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:21:29,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:29,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:29,767 INFO L85 PathProgramCache]: Analyzing trace with hash 232151558, now seen corresponding path program 1 times [2024-10-11 18:21:29,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:29,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817478933] [2024-10-11 18:21:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:29,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:29,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817478933] [2024-10-11 18:21:29,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817478933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:29,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:29,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:21:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251487765] [2024-10-11 18:21:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:29,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:29,858 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand has 3 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-10-11 18:21:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:29,867 INFO L93 Difference]: Finished difference Result 41 states and 73 transitions. [2024-10-11 18:21:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:29,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-10-11 18:21:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:29,869 INFO L225 Difference]: With dead ends: 41 [2024-10-11 18:21:29,869 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 18:21:29,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 18:21:29,871 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 72 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-10-11 18:21:29,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 72 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 18:21:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 18:21:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2024-10-11 18:21:29,911 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 5 [2024-10-11 18:21:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:29,912 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 71 transitions. [2024-10-11 18:21:29,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-10-11 18:21:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2024-10-11 18:21:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:21:29,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:29,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:29,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:21:29,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:29,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1707449351, now seen corresponding path program 1 times [2024-10-11 18:21:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:29,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080439728] [2024-10-11 18:21:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:29,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080439728] [2024-10-11 18:21:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080439728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969431628] [2024-10-11 18:21:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,101 INFO L87 Difference]: Start difference. First operand 39 states and 71 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-10-11 18:21:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,134 INFO L93 Difference]: Finished difference Result 76 states and 138 transitions. [2024-10-11 18:21:30,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,135 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-10-11 18:21:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,137 INFO L225 Difference]: With dead ends: 76 [2024-10-11 18:21:30,138 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 18:21:30,139 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-10-11 18:21:30,140 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:30,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 18:21:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 51. [2024-10-11 18:21:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions. [2024-10-11 18:21:30,152 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18 [2024-10-11 18:21:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,153 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 94 transitions. [2024-10-11 18:21:30,154 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-10-11 18:21:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions. [2024-10-11 18:21:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:21:30,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:30,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:21:30,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1307654267, now seen corresponding path program 1 times [2024-10-11 18:21:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799375667] [2024-10-11 18:21:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799375667] [2024-10-11 18:21:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799375667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668160536] [2024-10-11 18:21:30,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,236 INFO L87 Difference]: Start difference. First operand 51 states and 94 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-10-11 18:21:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,256 INFO L93 Difference]: Finished difference Result 76 states and 136 transitions. [2024-10-11 18:21:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,257 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-10-11 18:21:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,258 INFO L225 Difference]: With dead ends: 76 [2024-10-11 18:21:30,258 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 18:21:30,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-10-11 18:21:30,259 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 54 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:30,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 156 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 18:21:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-10-11 18:21:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2024-10-11 18:21:30,268 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2024-10-11 18:21:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2024-10-11 18:21:30,268 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-10-11 18:21:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2024-10-11 18:21:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:21:30,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,270 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-10-11 18:21:30,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:21:30,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1384724885, now seen corresponding path program 1 times [2024-10-11 18:21:30,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848882159] [2024-10-11 18:21:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848882159] [2024-10-11 18:21:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848882159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793871124] [2024-10-11 18:21:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,336 INFO L87 Difference]: Start difference. First operand 73 states and 134 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-10-11 18:21:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,364 INFO L93 Difference]: Finished difference Result 79 states and 138 transitions. [2024-10-11 18:21:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,365 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-10-11 18:21:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,366 INFO L225 Difference]: With dead ends: 79 [2024-10-11 18:21:30,366 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 18:21:30,366 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-10-11 18:21:30,368 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 56 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:30,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 18:21:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-11 18:21:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions. [2024-10-11 18:21:30,381 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19 [2024-10-11 18:21:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,381 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 136 transitions. [2024-10-11 18:21:30,382 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-10-11 18:21:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions. [2024-10-11 18:21:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:21:30,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,384 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-10-11 18:21:30,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:21:30,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1889174057, now seen corresponding path program 1 times [2024-10-11 18:21:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756761454] [2024-10-11 18:21:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756761454] [2024-10-11 18:21:30,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756761454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551499166] [2024-10-11 18:21:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,437 INFO L87 Difference]: Start difference. First operand 76 states and 136 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-10-11 18:21:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,466 INFO L93 Difference]: Finished difference Result 144 states and 259 transitions. [2024-10-11 18:21:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,469 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-10-11 18:21:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,471 INFO L225 Difference]: With dead ends: 144 [2024-10-11 18:21:30,471 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 18:21:30,471 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-10-11 18:21:30,472 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:30,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 18:21:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2024-10-11 18:21:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2024-10-11 18:21:30,485 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19 [2024-10-11 18:21:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,485 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2024-10-11 18:21:30,485 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-10-11 18:21:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2024-10-11 18:21:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:21:30,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,486 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-10-11 18:21:30,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:21:30,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash 609310379, now seen corresponding path program 1 times [2024-10-11 18:21:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770982136] [2024-10-11 18:21:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770982136] [2024-10-11 18:21:30,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770982136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381183389] [2024-10-11 18:21:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,530 INFO L87 Difference]: Start difference. First operand 101 states and 181 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-10-11 18:21:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,546 INFO L93 Difference]: Finished difference Result 146 states and 257 transitions. [2024-10-11 18:21:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,546 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-10-11 18:21:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,547 INFO L225 Difference]: With dead ends: 146 [2024-10-11 18:21:30,548 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 18:21:30,548 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-10-11 18:21:30,549 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 53 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:30,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 18:21:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-10-11 18:21:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2024-10-11 18:21:30,559 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19 [2024-10-11 18:21:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,560 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2024-10-11 18:21:30,560 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-10-11 18:21:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2024-10-11 18:21:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:21:30,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,561 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-10-11 18:21:30,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:21:30,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1558538362, now seen corresponding path program 1 times [2024-10-11 18:21:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388595209] [2024-10-11 18:21:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388595209] [2024-10-11 18:21:30,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388595209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355666699] [2024-10-11 18:21:30,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,611 INFO L87 Difference]: Start difference. First operand 143 states and 255 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-10-11 18:21:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,633 INFO L93 Difference]: Finished difference Result 148 states and 257 transitions. [2024-10-11 18:21:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,634 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-10-11 18:21:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,639 INFO L225 Difference]: With dead ends: 148 [2024-10-11 18:21:30,640 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 18:21:30,640 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-10-11 18:21:30,641 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 55 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:30,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 18:21:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2024-10-11 18:21:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions. [2024-10-11 18:21:30,659 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20 [2024-10-11 18:21:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,661 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 255 transitions. [2024-10-11 18:21:30,661 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-10-11 18:21:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2024-10-11 18:21:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:21:30,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,663 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-10-11 18:21:30,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:21:30,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1715360580, now seen corresponding path program 1 times [2024-10-11 18:21:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877252435] [2024-10-11 18:21:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877252435] [2024-10-11 18:21:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877252435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907230181] [2024-10-11 18:21:30,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,738 INFO L87 Difference]: Start difference. First operand 145 states and 255 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-10-11 18:21:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,758 INFO L93 Difference]: Finished difference Result 280 states and 485 transitions. [2024-10-11 18:21:30,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,760 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-10-11 18:21:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,762 INFO L225 Difference]: With dead ends: 280 [2024-10-11 18:21:30,762 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 18:21:30,762 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-10-11 18:21:30,767 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 53 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:30,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 139 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 18:21:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2024-10-11 18:21:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions. [2024-10-11 18:21:30,788 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20 [2024-10-11 18:21:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,788 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 483 transitions. [2024-10-11 18:21:30,788 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-10-11 18:21:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions. [2024-10-11 18:21:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:21:30,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:21:30,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1299743038, now seen corresponding path program 1 times [2024-10-11 18:21:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670773555] [2024-10-11 18:21:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670773555] [2024-10-11 18:21:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670773555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469234993] [2024-10-11 18:21:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,835 INFO L87 Difference]: Start difference. First operand 277 states and 483 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-10-11 18:21:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,852 INFO L93 Difference]: Finished difference Result 352 states and 617 transitions. [2024-10-11 18:21:30,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,852 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-10-11 18:21:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,854 INFO L225 Difference]: With dead ends: 352 [2024-10-11 18:21:30,854 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 18:21:30,855 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-10-11 18:21:30,856 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 48 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 188 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-10-11 18:21:30,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 18:21:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 277. [2024-10-11 18:21:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions. [2024-10-11 18:21:30,874 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20 [2024-10-11 18:21:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,874 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 479 transitions. [2024-10-11 18:21:30,874 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-10-11 18:21:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions. [2024-10-11 18:21:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:21:30,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,877 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-10-11 18:21:30,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:21:30,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1643189014, now seen corresponding path program 1 times [2024-10-11 18:21:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528131230] [2024-10-11 18:21:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:30,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528131230] [2024-10-11 18:21:30,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528131230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:30,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:30,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:30,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397219407] [2024-10-11 18:21:30,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:30,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:30,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:30,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:30,928 INFO L87 Difference]: Start difference. First operand 277 states and 479 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-10-11 18:21:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:30,942 INFO L93 Difference]: Finished difference Result 516 states and 897 transitions. [2024-10-11 18:21:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:30,943 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-10-11 18:21:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:30,945 INFO L225 Difference]: With dead ends: 516 [2024-10-11 18:21:30,945 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 18:21:30,946 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-10-11 18:21:30,947 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:30,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 18:21:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 385. [2024-10-11 18:21:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions. [2024-10-11 18:21:30,960 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21 [2024-10-11 18:21:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:30,961 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 655 transitions. [2024-10-11 18:21:30,961 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-10-11 18:21:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions. [2024-10-11 18:21:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:21:30,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:30,965 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-10-11 18:21:30,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:21:30,966 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:30,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash 363325336, now seen corresponding path program 1 times [2024-10-11 18:21:30,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:30,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99190242] [2024-10-11 18:21:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:30,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99190242] [2024-10-11 18:21:31,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99190242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036085108] [2024-10-11 18:21:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,008 INFO L87 Difference]: Start difference. First operand 385 states and 655 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-10-11 18:21:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,026 INFO L93 Difference]: Finished difference Result 540 states and 909 transitions. [2024-10-11 18:21:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,027 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-10-11 18:21:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,029 INFO L225 Difference]: With dead ends: 540 [2024-10-11 18:21:31,029 INFO L226 Difference]: Without dead ends: 540 [2024-10-11 18:21:31,030 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-10-11 18:21:31,033 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 159 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-11 18:21:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 537. [2024-10-11 18:21:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions. [2024-10-11 18:21:31,050 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21 [2024-10-11 18:21:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,051 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 907 transitions. [2024-10-11 18:21:31,051 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-10-11 18:21:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions. [2024-10-11 18:21:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:21:31,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,053 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-10-11 18:21:31,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:21:31,054 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,055 INFO L85 PathProgramCache]: Analyzing trace with hash -594118961, now seen corresponding path program 1 times [2024-10-11 18:21:31,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899122112] [2024-10-11 18:21:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899122112] [2024-10-11 18:21:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899122112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774024596] [2024-10-11 18:21:31,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,103 INFO L87 Difference]: Start difference. First operand 537 states and 907 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-10-11 18:21:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,120 INFO L93 Difference]: Finished difference Result 552 states and 917 transitions. [2024-10-11 18:21:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,122 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-10-11 18:21:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,124 INFO L225 Difference]: With dead ends: 552 [2024-10-11 18:21:31,126 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 18:21:31,126 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-10-11 18:21:31,128 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 53 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 18:21:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 549. [2024-10-11 18:21:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2024-10-11 18:21:31,143 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2024-10-11 18:21:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,144 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2024-10-11 18:21:31,144 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-10-11 18:21:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2024-10-11 18:21:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:21:31,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,145 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-10-11 18:21:31,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:21:31,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1615187315, now seen corresponding path program 1 times [2024-10-11 18:21:31,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716637053] [2024-10-11 18:21:31,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716637053] [2024-10-11 18:21:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716637053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901248145] [2024-10-11 18:21:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,184 INFO L87 Difference]: Start difference. First operand 549 states and 915 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-10-11 18:21:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,200 INFO L93 Difference]: Finished difference Result 1000 states and 1677 transitions. [2024-10-11 18:21:31,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,201 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-10-11 18:21:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,205 INFO L225 Difference]: With dead ends: 1000 [2024-10-11 18:21:31,205 INFO L226 Difference]: Without dead ends: 1000 [2024-10-11 18:21:31,205 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-10-11 18:21:31,206 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 42 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-10-11 18:21:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 773. [2024-10-11 18:21:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2024-10-11 18:21:31,225 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2024-10-11 18:21:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,225 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2024-10-11 18:21:31,225 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-10-11 18:21:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2024-10-11 18:21:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:21:31,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,226 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-10-11 18:21:31,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:21:31,227 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1399916303, now seen corresponding path program 1 times [2024-10-11 18:21:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467293553] [2024-10-11 18:21:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467293553] [2024-10-11 18:21:31,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467293553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272974766] [2024-10-11 18:21:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,258 INFO L87 Difference]: Start difference. First operand 773 states and 1259 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-10-11 18:21:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,277 INFO L93 Difference]: Finished difference Result 1064 states and 1717 transitions. [2024-10-11 18:21:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,277 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-10-11 18:21:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,282 INFO L225 Difference]: With dead ends: 1064 [2024-10-11 18:21:31,283 INFO L226 Difference]: Without dead ends: 1064 [2024-10-11 18:21:31,284 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-10-11 18:21:31,285 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 50 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-10-11 18:21:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1061. [2024-10-11 18:21:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2024-10-11 18:21:31,308 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2024-10-11 18:21:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,308 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2024-10-11 18:21:31,308 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-10-11 18:21:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2024-10-11 18:21:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:21:31,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,310 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-10-11 18:21:31,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:21:31,310 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1475440515, now seen corresponding path program 1 times [2024-10-11 18:21:31,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845172385] [2024-10-11 18:21:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845172385] [2024-10-11 18:21:31,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845172385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657827786] [2024-10-11 18:21:31,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,349 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 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-10-11 18:21:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,367 INFO L93 Difference]: Finished difference Result 1080 states and 1717 transitions. [2024-10-11 18:21:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,368 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-10-11 18:21:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,372 INFO L225 Difference]: With dead ends: 1080 [2024-10-11 18:21:31,372 INFO L226 Difference]: Without dead ends: 1080 [2024-10-11 18:21:31,373 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-10-11 18:21:31,373 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 52 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-10-11 18:21:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1077. [2024-10-11 18:21:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2024-10-11 18:21:31,409 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2024-10-11 18:21:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,410 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2024-10-11 18:21:31,410 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-10-11 18:21:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2024-10-11 18:21:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:21:31,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,411 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-10-11 18:21:31,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:21:31,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 454372161, now seen corresponding path program 1 times [2024-10-11 18:21:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678579300] [2024-10-11 18:21:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678579300] [2024-10-11 18:21:31,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678579300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512089586] [2024-10-11 18:21:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,450 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 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-10-11 18:21:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,470 INFO L93 Difference]: Finished difference Result 1928 states and 3093 transitions. [2024-10-11 18:21:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,471 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-10-11 18:21:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,477 INFO L225 Difference]: With dead ends: 1928 [2024-10-11 18:21:31,477 INFO L226 Difference]: Without dead ends: 1928 [2024-10-11 18:21:31,478 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-10-11 18:21:31,479 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-10-11 18:21:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1541. [2024-10-11 18:21:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2024-10-11 18:21:31,521 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2024-10-11 18:21:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,521 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2024-10-11 18:21:31,521 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-10-11 18:21:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2024-10-11 18:21:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:21:31,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,525 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-10-11 18:21:31,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:21:31,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,526 INFO L85 PathProgramCache]: Analyzing trace with hash -825491517, now seen corresponding path program 1 times [2024-10-11 18:21:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853504042] [2024-10-11 18:21:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853504042] [2024-10-11 18:21:31,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853504042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037505759] [2024-10-11 18:21:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,554 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 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-10-11 18:21:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,573 INFO L93 Difference]: Finished difference Result 2088 states and 3205 transitions. [2024-10-11 18:21:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,574 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-10-11 18:21:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,580 INFO L225 Difference]: With dead ends: 2088 [2024-10-11 18:21:31,580 INFO L226 Difference]: Without dead ends: 2088 [2024-10-11 18:21:31,581 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-10-11 18:21:31,581 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-11 18:21:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2085. [2024-10-11 18:21:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2024-10-11 18:21:31,627 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2024-10-11 18:21:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,627 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2024-10-11 18:21:31,627 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-10-11 18:21:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2024-10-11 18:21:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:21:31,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,629 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-10-11 18:21:31,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:21:31,630 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1207285402, now seen corresponding path program 1 times [2024-10-11 18:21:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850815561] [2024-10-11 18:21:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850815561] [2024-10-11 18:21:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850815561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869864901] [2024-10-11 18:21:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,663 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 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-10-11 18:21:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,686 INFO L93 Difference]: Finished difference Result 2120 states and 3205 transitions. [2024-10-11 18:21:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,687 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-10-11 18:21:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,694 INFO L225 Difference]: With dead ends: 2120 [2024-10-11 18:21:31,694 INFO L226 Difference]: Without dead ends: 2120 [2024-10-11 18:21:31,695 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-10-11 18:21:31,695 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2024-10-11 18:21:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2117. [2024-10-11 18:21:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2024-10-11 18:21:31,742 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2024-10-11 18:21:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,742 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2024-10-11 18:21:31,742 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-10-11 18:21:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2024-10-11 18:21:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:21:31,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,745 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-10-11 18:21:31,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:21:31,745 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash 186217048, now seen corresponding path program 1 times [2024-10-11 18:21:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31625424] [2024-10-11 18:21:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31625424] [2024-10-11 18:21:31,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31625424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696880250] [2024-10-11 18:21:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,770 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 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-10-11 18:21:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,796 INFO L93 Difference]: Finished difference Result 3720 states and 5669 transitions. [2024-10-11 18:21:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,796 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-10-11 18:21:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,809 INFO L225 Difference]: With dead ends: 3720 [2024-10-11 18:21:31,810 INFO L226 Difference]: Without dead ends: 3720 [2024-10-11 18:21:31,810 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-10-11 18:21:31,810 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 127 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2024-10-11 18:21:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 3077. [2024-10-11 18:21:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2024-10-11 18:21:31,897 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2024-10-11 18:21:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:31,898 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2024-10-11 18:21:31,898 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-10-11 18:21:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2024-10-11 18:21:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:21:31,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:31,902 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-10-11 18:21:31,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:21:31,902 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1093646630, now seen corresponding path program 1 times [2024-10-11 18:21:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607477163] [2024-10-11 18:21:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:31,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:31,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607477163] [2024-10-11 18:21:31,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607477163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:31,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:31,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:31,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601778061] [2024-10-11 18:21:31,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:31,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:31,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:31,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:31,925 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 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-10-11 18:21:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:31,952 INFO L93 Difference]: Finished difference Result 4104 states and 5957 transitions. [2024-10-11 18:21:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:31,953 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-10-11 18:21:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:31,968 INFO L225 Difference]: With dead ends: 4104 [2024-10-11 18:21:31,969 INFO L226 Difference]: Without dead ends: 4104 [2024-10-11 18:21:31,969 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-10-11 18:21:31,969 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:31,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 162 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2024-10-11 18:21:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 4101. [2024-10-11 18:21:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2024-10-11 18:21:32,055 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2024-10-11 18:21:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:32,056 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2024-10-11 18:21:32,056 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-10-11 18:21:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2024-10-11 18:21:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:21:32,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:32,061 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-10-11 18:21:32,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:21:32,061 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1484422062, now seen corresponding path program 1 times [2024-10-11 18:21:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:32,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146992422] [2024-10-11 18:21:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:32,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:32,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146992422] [2024-10-11 18:21:32,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146992422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:32,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:32,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092739336] [2024-10-11 18:21:32,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:32,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:32,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:32,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:32,086 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 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-10-11 18:21:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:32,112 INFO L93 Difference]: Finished difference Result 4168 states and 5957 transitions. [2024-10-11 18:21:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:32,113 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-10-11 18:21:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:32,126 INFO L225 Difference]: With dead ends: 4168 [2024-10-11 18:21:32,127 INFO L226 Difference]: Without dead ends: 4168 [2024-10-11 18:21:32,130 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-10-11 18:21:32,131 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:32,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2024-10-11 18:21:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4165. [2024-10-11 18:21:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2024-10-11 18:21:32,231 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2024-10-11 18:21:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:32,232 INFO L471 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2024-10-11 18:21:32,232 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-10-11 18:21:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2024-10-11 18:21:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:21:32,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:32,239 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-10-11 18:21:32,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:21:32,239 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:32,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash 463353708, now seen corresponding path program 1 times [2024-10-11 18:21:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:32,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294856333] [2024-10-11 18:21:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:32,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:32,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294856333] [2024-10-11 18:21:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294856333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:32,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710300111] [2024-10-11 18:21:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:32,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:32,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:32,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:32,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:32,300 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 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-10-11 18:21:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:32,338 INFO L93 Difference]: Finished difference Result 7176 states and 10309 transitions. [2024-10-11 18:21:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:32,339 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-10-11 18:21:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:32,358 INFO L225 Difference]: With dead ends: 7176 [2024-10-11 18:21:32,358 INFO L226 Difference]: Without dead ends: 7176 [2024-10-11 18:21:32,359 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-10-11 18:21:32,359 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 33 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:32,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7176 states. [2024-10-11 18:21:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7176 to 6149. [2024-10-11 18:21:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2024-10-11 18:21:32,480 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2024-10-11 18:21:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:32,480 INFO L471 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2024-10-11 18:21:32,481 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-10-11 18:21:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2024-10-11 18:21:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:21:32,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:32,489 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-10-11 18:21:32,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:21:32,489 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:32,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash -816509970, now seen corresponding path program 1 times [2024-10-11 18:21:32,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:32,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823599476] [2024-10-11 18:21:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:32,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823599476] [2024-10-11 18:21:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823599476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:32,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:32,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227493131] [2024-10-11 18:21:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:32,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:32,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:32,515 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 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-10-11 18:21:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:32,563 INFO L93 Difference]: Finished difference Result 8072 states and 11013 transitions. [2024-10-11 18:21:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:32,563 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-10-11 18:21:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:32,577 INFO L225 Difference]: With dead ends: 8072 [2024-10-11 18:21:32,577 INFO L226 Difference]: Without dead ends: 8072 [2024-10-11 18:21:32,578 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-10-11 18:21:32,578 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:32,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8072 states. [2024-10-11 18:21:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8072 to 8069. [2024-10-11 18:21:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2024-10-11 18:21:32,753 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2024-10-11 18:21:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:32,754 INFO L471 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2024-10-11 18:21:32,754 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-10-11 18:21:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2024-10-11 18:21:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:21:32,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:32,764 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-10-11 18:21:32,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:21:32,765 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:32,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:32,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1485734501, now seen corresponding path program 1 times [2024-10-11 18:21:32,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457558930] [2024-10-11 18:21:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:32,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457558930] [2024-10-11 18:21:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457558930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:32,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6838767] [2024-10-11 18:21:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:32,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:32,789 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 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-10-11 18:21:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:32,831 INFO L93 Difference]: Finished difference Result 8200 states and 11013 transitions. [2024-10-11 18:21:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:32,835 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-10-11 18:21:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:32,853 INFO L225 Difference]: With dead ends: 8200 [2024-10-11 18:21:32,854 INFO L226 Difference]: Without dead ends: 8200 [2024-10-11 18:21:32,854 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-10-11 18:21:32,854 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:32,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2024-10-11 18:21:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 8197. [2024-10-11 18:21:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2024-10-11 18:21:32,987 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2024-10-11 18:21:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:32,988 INFO L471 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2024-10-11 18:21:32,988 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-10-11 18:21:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2024-10-11 18:21:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:21:32,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:32,996 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-10-11 18:21:32,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:21:32,997 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:32,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:32,997 INFO L85 PathProgramCache]: Analyzing trace with hash 464666147, now seen corresponding path program 1 times [2024-10-11 18:21:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:32,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795426037] [2024-10-11 18:21:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:33,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795426037] [2024-10-11 18:21:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795426037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:33,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:33,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962450529] [2024-10-11 18:21:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:33,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:33,023 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 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-10-11 18:21:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:33,092 INFO L93 Difference]: Finished difference Result 13832 states and 18565 transitions. [2024-10-11 18:21:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:33,093 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-10-11 18:21:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:33,119 INFO L225 Difference]: With dead ends: 13832 [2024-10-11 18:21:33,119 INFO L226 Difference]: Without dead ends: 13832 [2024-10-11 18:21:33,119 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-10-11 18:21:33,120 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 30 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:33,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 123 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13832 states. [2024-10-11 18:21:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13832 to 12293. [2024-10-11 18:21:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12293 states to 12293 states and 16003 transitions. [2024-10-11 18:21:33,303 INFO L78 Accepts]: Start accepts. Automaton has 12293 states and 16003 transitions. Word has length 26 [2024-10-11 18:21:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:33,303 INFO L471 AbstractCegarLoop]: Abstraction has 12293 states and 16003 transitions. [2024-10-11 18:21:33,303 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-10-11 18:21:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 12293 states and 16003 transitions. [2024-10-11 18:21:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:21:33,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:33,317 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-10-11 18:21:33,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 18:21:33,317 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:33,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:33,318 INFO L85 PathProgramCache]: Analyzing trace with hash -815197531, now seen corresponding path program 1 times [2024-10-11 18:21:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096703863] [2024-10-11 18:21:33,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096703863] [2024-10-11 18:21:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096703863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585360989] [2024-10-11 18:21:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:33,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:33,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:33,350 INFO L87 Difference]: Start difference. First operand 12293 states and 16003 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-10-11 18:21:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:33,453 INFO L93 Difference]: Finished difference Result 15880 states and 20229 transitions. [2024-10-11 18:21:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:33,453 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-10-11 18:21:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:33,485 INFO L225 Difference]: With dead ends: 15880 [2024-10-11 18:21:33,485 INFO L226 Difference]: Without dead ends: 15880 [2024-10-11 18:21:33,485 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-10-11 18:21:33,487 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:33,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15880 states. [2024-10-11 18:21:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15880 to 15877. [2024-10-11 18:21:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.2740614764424287) internal successors, (20227), 15876 states have internal predecessors, (20227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20227 transitions. [2024-10-11 18:21:33,830 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 20227 transitions. Word has length 26 [2024-10-11 18:21:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:33,831 INFO L471 AbstractCegarLoop]: Abstraction has 15877 states and 20227 transitions. [2024-10-11 18:21:33,831 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-10-11 18:21:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 20227 transitions. [2024-10-11 18:21:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:21:33,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:33,848 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-10-11 18:21:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 18:21:33,849 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:33,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1526430681, now seen corresponding path program 1 times [2024-10-11 18:21:33,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:33,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229230391] [2024-10-11 18:21:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:33,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229230391] [2024-10-11 18:21:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229230391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:33,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:33,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58452402] [2024-10-11 18:21:33,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:33,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:33,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:33,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:33,879 INFO L87 Difference]: Start difference. First operand 15877 states and 20227 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-10-11 18:21:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:33,936 INFO L93 Difference]: Finished difference Result 16136 states and 20229 transitions. [2024-10-11 18:21:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:33,936 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-10-11 18:21:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:33,960 INFO L225 Difference]: With dead ends: 16136 [2024-10-11 18:21:33,960 INFO L226 Difference]: Without dead ends: 16136 [2024-10-11 18:21:33,961 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-10-11 18:21:33,962 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:33,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16136 states. [2024-10-11 18:21:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16136 to 16133. [2024-10-11 18:21:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16133 states, 16132 states have (on average 1.2538432928341186) internal successors, (20227), 16132 states have internal predecessors, (20227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 20227 transitions. [2024-10-11 18:21:34,316 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 20227 transitions. Word has length 27 [2024-10-11 18:21:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:34,316 INFO L471 AbstractCegarLoop]: Abstraction has 16133 states and 20227 transitions. [2024-10-11 18:21:34,316 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-10-11 18:21:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 20227 transitions. [2024-10-11 18:21:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:21:34,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:34,334 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-10-11 18:21:34,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:21:34,334 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash 505362327, now seen corresponding path program 1 times [2024-10-11 18:21:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479634265] [2024-10-11 18:21:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:34,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:34,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479634265] [2024-10-11 18:21:34,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479634265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:34,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:34,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438500058] [2024-10-11 18:21:34,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:34,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:34,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:34,365 INFO L87 Difference]: Start difference. First operand 16133 states and 20227 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-10-11 18:21:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:34,470 INFO L93 Difference]: Finished difference Result 26632 states and 33029 transitions. [2024-10-11 18:21:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:34,471 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-10-11 18:21:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:34,524 INFO L225 Difference]: With dead ends: 26632 [2024-10-11 18:21:34,525 INFO L226 Difference]: Without dead ends: 26632 [2024-10-11 18:21:34,526 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-10-11 18:21:34,530 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 27 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:34,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26632 states. [2024-10-11 18:21:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26632 to 24581. [2024-10-11 18:21:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24581 states, 24580 states have (on average 1.2186737184703011) internal successors, (29955), 24580 states have internal predecessors, (29955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24581 states to 24581 states and 29955 transitions. [2024-10-11 18:21:35,131 INFO L78 Accepts]: Start accepts. Automaton has 24581 states and 29955 transitions. Word has length 27 [2024-10-11 18:21:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:35,131 INFO L471 AbstractCegarLoop]: Abstraction has 24581 states and 29955 transitions. [2024-10-11 18:21:35,132 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-10-11 18:21:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 24581 states and 29955 transitions. [2024-10-11 18:21:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:21:35,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:35,157 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-10-11 18:21:35,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 18:21:35,157 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash -774501351, now seen corresponding path program 1 times [2024-10-11 18:21:35,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:35,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926870877] [2024-10-11 18:21:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:35,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926870877] [2024-10-11 18:21:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926870877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:35,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:35,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572147959] [2024-10-11 18:21:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:35,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:35,189 INFO L87 Difference]: Start difference. First operand 24581 states and 29955 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-10-11 18:21:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:35,284 INFO L93 Difference]: Finished difference Result 31240 states and 36869 transitions. [2024-10-11 18:21:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:35,285 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-10-11 18:21:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:35,345 INFO L225 Difference]: With dead ends: 31240 [2024-10-11 18:21:35,346 INFO L226 Difference]: Without dead ends: 31240 [2024-10-11 18:21:35,346 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-10-11 18:21:35,346 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:35,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 165 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31240 states. [2024-10-11 18:21:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31240 to 31237. [2024-10-11 18:21:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31237 states, 31236 states have (on average 1.1802727621974645) internal successors, (36867), 31236 states have internal predecessors, (36867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31237 states to 31237 states and 36867 transitions. [2024-10-11 18:21:36,094 INFO L78 Accepts]: Start accepts. Automaton has 31237 states and 36867 transitions. Word has length 27 [2024-10-11 18:21:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:36,095 INFO L471 AbstractCegarLoop]: Abstraction has 31237 states and 36867 transitions. [2024-10-11 18:21:36,095 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-10-11 18:21:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31237 states and 36867 transitions. [2024-10-11 18:21:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:21:36,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:36,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:36,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 18:21:36,125 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:36,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1506944464, now seen corresponding path program 1 times [2024-10-11 18:21:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691654701] [2024-10-11 18:21:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:36,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:36,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691654701] [2024-10-11 18:21:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691654701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:36,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:36,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182198166] [2024-10-11 18:21:36,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:36,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:36,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:36,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:36,163 INFO L87 Difference]: Start difference. First operand 31237 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:36,446 INFO L93 Difference]: Finished difference Result 31752 states and 36869 transitions. [2024-10-11 18:21:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:36,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:21:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:36,509 INFO L225 Difference]: With dead ends: 31752 [2024-10-11 18:21:36,509 INFO L226 Difference]: Without dead ends: 31752 [2024-10-11 18:21:36,510 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-10-11 18:21:36,510 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:36,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 140 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31752 states. [2024-10-11 18:21:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31752 to 31749. [2024-10-11 18:21:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.1612385032128008) internal successors, (36867), 31748 states have internal predecessors, (36867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 36867 transitions. [2024-10-11 18:21:36,999 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 36867 transitions. Word has length 28 [2024-10-11 18:21:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:36,999 INFO L471 AbstractCegarLoop]: Abstraction has 31749 states and 36867 transitions. [2024-10-11 18:21:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 36867 transitions. [2024-10-11 18:21:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:21:37,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:37,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:37,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 18:21:37,023 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:37,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1766954478, now seen corresponding path program 1 times [2024-10-11 18:21:37,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:37,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519311972] [2024-10-11 18:21:37,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:37,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519311972] [2024-10-11 18:21:37,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519311972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:37,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909216642] [2024-10-11 18:21:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:37,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:37,045 INFO L87 Difference]: Start difference. First operand 31749 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:37,449 INFO L93 Difference]: Finished difference Result 61445 states and 67587 transitions. [2024-10-11 18:21:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:37,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:21:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:37,512 INFO L225 Difference]: With dead ends: 61445 [2024-10-11 18:21:37,513 INFO L226 Difference]: Without dead ends: 31749 [2024-10-11 18:21:37,513 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-10-11 18:21:37,514 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:37,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31749 states. [2024-10-11 18:21:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 31749. [2024-10-11 18:21:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.096730502708832) internal successors, (34819), 31748 states have internal predecessors, (34819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 34819 transitions. [2024-10-11 18:21:38,198 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 34819 transitions. Word has length 28 [2024-10-11 18:21:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:38,198 INFO L471 AbstractCegarLoop]: Abstraction has 31749 states and 34819 transitions. [2024-10-11 18:21:38,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 34819 transitions. [2024-10-11 18:21:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:21:38,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:38,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:38,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 18:21:38,219 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:38,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1248149140, now seen corresponding path program 1 times [2024-10-11 18:21:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:38,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465816735] [2024-10-11 18:21:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465816735] [2024-10-11 18:21:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465816735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:38,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557491740] [2024-10-11 18:21:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:38,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:38,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:38,239 INFO L87 Difference]: Start difference. First operand 31749 states and 34819 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:38,325 INFO L93 Difference]: Finished difference Result 31746 states and 33793 transitions. [2024-10-11 18:21:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:38,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:21:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:38,326 INFO L225 Difference]: With dead ends: 31746 [2024-10-11 18:21:38,326 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 18:21:38,327 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-10-11 18:21:38,327 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 75 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-10-11 18:21:38,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 75 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 18:21:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 18:21:38,328 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-10-11 18:21:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 18:21:38,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2024-10-11 18:21:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:38,328 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 18:21:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 18:21:38,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 18:21:38,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-10-11 18:21:38,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-10-11 18:21:38,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 18:21:38,340 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:38,343 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:21:38,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:21:38 BoogieIcfgContainer [2024-10-11 18:21:38,347 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:21:38,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:21:38,348 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:21:38,348 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:21:38,349 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:29" (3/4) ... [2024-10-11 18:21:38,351 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 18:21:38,364 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 18:21:38,365 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 18:21:38,365 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 18:21:38,365 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 18:21:38,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 18:21:38,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 18:21:38,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:21:38,474 INFO L158 Benchmark]: Toolchain (without parser) took 9965.07ms. Allocated memory was 157.3MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 104.0MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 438.2MB. Max. memory is 16.1GB. [2024-10-11 18:21:38,475 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:21:38,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.81ms. Allocated memory is still 157.3MB. Free memory was 103.6MB in the beginning and 125.3MB in the end (delta: -21.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 18:21:38,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.62ms. Allocated memory is still 157.3MB. Free memory was 125.3MB in the beginning and 123.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:21:38,475 INFO L158 Benchmark]: Boogie Preprocessor took 35.32ms. Allocated memory is still 157.3MB. Free memory was 123.3MB in the beginning and 121.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:21:38,479 INFO L158 Benchmark]: RCFGBuilder took 454.56ms. Allocated memory is still 157.3MB. Free memory was 121.2MB in the beginning and 104.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 18:21:38,479 INFO L158 Benchmark]: TraceAbstraction took 8978.46ms. Allocated memory was 157.3MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 103.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 435.1MB. Max. memory is 16.1GB. [2024-10-11 18:21:38,480 INFO L158 Benchmark]: Witness Printer took 125.76ms. Allocated memory is still 2.9GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 18:21:38,481 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.19ms. Allocated memory is still 96.5MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.81ms. Allocated memory is still 157.3MB. Free memory was 103.6MB in the beginning and 125.3MB in the end (delta: -21.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.62ms. Allocated memory is still 157.3MB. Free memory was 125.3MB in the beginning and 123.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.32ms. Allocated memory is still 157.3MB. Free memory was 123.3MB in the beginning and 121.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.56ms. Allocated memory is still 157.3MB. Free memory was 121.2MB in the beginning and 104.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8978.46ms. Allocated memory was 157.3MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 103.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 435.1MB. Max. memory is 16.1GB. * Witness Printer took 125.76ms. Allocated memory is still 2.9GB. Free memory was 2.5GB in the beginning and 2.5GB 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: 8.9s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1494 mSDsluCounter, 4708 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1830 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2878 mSDtfsCounter, 197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31749occurred in iteration=31, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 6205 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 696 ConstructedInterpolants, 0 QuantifiedInterpolants, 1507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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-10-11 18:21:38,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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