./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_9.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:52:08,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:52:08,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:52:08,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:52:08,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:52:08,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:52:08,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:52:08,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:52:08,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:52:08,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:52:08,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:52:08,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:52:08,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:52:08,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:52:08,853 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:52:08,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:52:08,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:52:08,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:52:08,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:52:08,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:52:08,854 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:52:08,857 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:52:08,857 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:52:08,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:52:08,857 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:52:08,858 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:52:08,858 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:52:08,858 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:52:08,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:52:08,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:52:08,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:52:08,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:52:08,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:52:08,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:52:08,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:52:08,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:52:08,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:52:08,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:52:08,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:52:08,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:52:08,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:52:08,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:52:08,861 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2024-11-17 00:52:09,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:52:09,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:52:09,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:52:09,076 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:52:09,077 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:52:09,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2024-11-17 00:52:10,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:52:10,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:52:10,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2024-11-17 00:52:10,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174584343/5554fb0b75c641beae44a14e1794ae05/FLAG9ae8442f1 [2024-11-17 00:52:10,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174584343/5554fb0b75c641beae44a14e1794ae05 [2024-11-17 00:52:10,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:52:10,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:52:10,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:52:10,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:52:10,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:52:10,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63157560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10, skipping insertion in model container [2024-11-17 00:52:10,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:52:10,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:52:10,633 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:52:10,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:52:10,660 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:52:10,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10 WrapperNode [2024-11-17 00:52:10,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:52:10,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:52:10,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:52:10,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:52:10,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,687 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 136 [2024-11-17 00:52:10,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:52:10,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:52:10,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:52:10,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:52:10,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,705 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 00:52:10,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:52:10,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:52:10,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:52:10,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:52:10,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (1/1) ... [2024-11-17 00:52:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:52:10,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:52:10,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:52:10,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:52:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:52:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:52:10,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:52:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:52:10,828 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:52:10,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:52:11,018 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-17 00:52:11,018 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:52:11,029 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:52:11,029 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:52:11,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:11 BoogieIcfgContainer [2024-11-17 00:52:11,030 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:52:11,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:52:11,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:52:11,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:52:11,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:52:10" (1/3) ... [2024-11-17 00:52:11,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c96285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:11, skipping insertion in model container [2024-11-17 00:52:11,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:52:10" (2/3) ... [2024-11-17 00:52:11,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c96285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:52:11, skipping insertion in model container [2024-11-17 00:52:11,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:11" (3/3) ... [2024-11-17 00:52:11,038 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2024-11-17 00:52:11,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:52:11,053 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:52:11,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:52:11,087 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;@569441f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:52:11,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:52:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 40 states have (on average 1.8) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:52:11,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash -331860861, now seen corresponding path program 1 times [2024-11-17 00:52:11,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982623791] [2024-11-17 00:52:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982623791] [2024-11-17 00:52:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982623791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379091073] [2024-11-17 00:52:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:52:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:52:11,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:52:11,268 INFO L87 Difference]: Start difference. First operand has 43 states, 40 states have (on average 1.8) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,282 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2024-11-17 00:52:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:52:11,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:52:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,289 INFO L225 Difference]: With dead ends: 42 [2024-11-17 00:52:11,289 INFO L226 Difference]: Without dead ends: 39 [2024-11-17 00:52:11,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:52:11,293 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-17 00:52:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-17 00:52:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2024-11-17 00:52:11,325 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 65 transitions. Word has length 6 [2024-11-17 00:52:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,326 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 65 transitions. [2024-11-17 00:52:11,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 65 transitions. [2024-11-17 00:52:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:52:11,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:52:11,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1033501014, now seen corresponding path program 1 times [2024-11-17 00:52:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438146746] [2024-11-17 00:52:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438146746] [2024-11-17 00:52:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438146746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:52:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044077601] [2024-11-17 00:52:11,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,387 INFO L87 Difference]: Start difference. First operand 39 states and 65 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,393 INFO L93 Difference]: Finished difference Result 38 states and 64 transitions. [2024-11-17 00:52:11,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-17 00:52:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,395 INFO L225 Difference]: With dead ends: 38 [2024-11-17 00:52:11,395 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 00:52:11,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,396 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 00:52:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 00:52:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2024-11-17 00:52:11,400 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 61 transitions. Word has length 8 [2024-11-17 00:52:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,401 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 61 transitions. [2024-11-17 00:52:11,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 61 transitions. [2024-11-17 00:52:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:52:11,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:52:11,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 756481741, now seen corresponding path program 1 times [2024-11-17 00:52:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788905080] [2024-11-17 00:52:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788905080] [2024-11-17 00:52:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788905080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190480198] [2024-11-17 00:52:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,529 INFO L87 Difference]: Start difference. First operand 35 states and 61 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,555 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2024-11-17 00:52:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:52:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,556 INFO L225 Difference]: With dead ends: 67 [2024-11-17 00:52:11,556 INFO L226 Difference]: Without dead ends: 67 [2024-11-17 00:52:11,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,557 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-17 00:52:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2024-11-17 00:52:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 44 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. [2024-11-17 00:52:11,566 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 80 transitions. Word has length 18 [2024-11-17 00:52:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,566 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 80 transitions. [2024-11-17 00:52:11,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. [2024-11-17 00:52:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:52:11,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:52:11,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,569 INFO L85 PathProgramCache]: Analyzing trace with hash 463078734, now seen corresponding path program 1 times [2024-11-17 00:52:11,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860555947] [2024-11-17 00:52:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860555947] [2024-11-17 00:52:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860555947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213071921] [2024-11-17 00:52:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,634 INFO L87 Difference]: Start difference. First operand 45 states and 80 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,654 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2024-11-17 00:52:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:52:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,655 INFO L225 Difference]: With dead ends: 67 [2024-11-17 00:52:11,655 INFO L226 Difference]: Without dead ends: 67 [2024-11-17 00:52:11,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,658 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-17 00:52:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2024-11-17 00:52:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7936507936507937) internal successors, (113), 63 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2024-11-17 00:52:11,670 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 18 [2024-11-17 00:52:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,670 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2024-11-17 00:52:11,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2024-11-17 00:52:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:52:11,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:52:11,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1976953780, now seen corresponding path program 1 times [2024-11-17 00:52:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450646520] [2024-11-17 00:52:11,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450646520] [2024-11-17 00:52:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450646520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035665969] [2024-11-17 00:52:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,725 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,740 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2024-11-17 00:52:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:52:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,741 INFO L225 Difference]: With dead ends: 71 [2024-11-17 00:52:11,742 INFO L226 Difference]: Without dead ends: 71 [2024-11-17 00:52:11,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,742 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 47 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-17 00:52:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-11-17 00:52:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 67 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2024-11-17 00:52:11,751 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 19 [2024-11-17 00:52:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,752 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2024-11-17 00:52:11,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2024-11-17 00:52:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:52:11,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:52:11,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1471395155, now seen corresponding path program 1 times [2024-11-17 00:52:11,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448341423] [2024-11-17 00:52:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448341423] [2024-11-17 00:52:11,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448341423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597016792] [2024-11-17 00:52:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,780 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,790 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2024-11-17 00:52:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:52:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,791 INFO L225 Difference]: With dead ends: 126 [2024-11-17 00:52:11,791 INFO L226 Difference]: Without dead ends: 126 [2024-11-17 00:52:11,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,794 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 42 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-17 00:52:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 89. [2024-11-17 00:52:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.7386363636363635) internal successors, (153), 88 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 153 transitions. [2024-11-17 00:52:11,800 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 153 transitions. Word has length 19 [2024-11-17 00:52:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,801 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 153 transitions. [2024-11-17 00:52:11,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 153 transitions. [2024-11-17 00:52:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:52:11,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:52:11,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1177992148, now seen corresponding path program 1 times [2024-11-17 00:52:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897921028] [2024-11-17 00:52:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897921028] [2024-11-17 00:52:11,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897921028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706677670] [2024-11-17 00:52:11,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,826 INFO L87 Difference]: Start difference. First operand 89 states and 153 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,836 INFO L93 Difference]: Finished difference Result 128 states and 215 transitions. [2024-11-17 00:52:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:52:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,837 INFO L225 Difference]: With dead ends: 128 [2024-11-17 00:52:11,837 INFO L226 Difference]: Without dead ends: 128 [2024-11-17 00:52:11,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,838 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-17 00:52:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2024-11-17 00:52:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.717741935483871) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 213 transitions. [2024-11-17 00:52:11,846 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 213 transitions. Word has length 19 [2024-11-17 00:52:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,846 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 213 transitions. [2024-11-17 00:52:11,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 213 transitions. [2024-11-17 00:52:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:52:11,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:52:11,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1630540889, now seen corresponding path program 1 times [2024-11-17 00:52:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631968578] [2024-11-17 00:52:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631968578] [2024-11-17 00:52:11,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631968578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182422233] [2024-11-17 00:52:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,887 INFO L87 Difference]: Start difference. First operand 125 states and 213 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,895 INFO L93 Difference]: Finished difference Result 130 states and 215 transitions. [2024-11-17 00:52:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:52:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,896 INFO L225 Difference]: With dead ends: 130 [2024-11-17 00:52:11,896 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 00:52:11,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,897 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 46 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 00:52:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-11-17 00:52:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 126 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 213 transitions. [2024-11-17 00:52:11,904 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 213 transitions. Word has length 20 [2024-11-17 00:52:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,904 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 213 transitions. [2024-11-17 00:52:11,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 213 transitions. [2024-11-17 00:52:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:52:11,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:52:11,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2136099514, now seen corresponding path program 1 times [2024-11-17 00:52:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954100147] [2024-11-17 00:52:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954100147] [2024-11-17 00:52:11,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954100147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122205595] [2024-11-17 00:52:11,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,939 INFO L87 Difference]: Start difference. First operand 127 states and 213 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:11,953 INFO L93 Difference]: Finished difference Result 234 states and 395 transitions. [2024-11-17 00:52:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:11,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:52:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:11,954 INFO L225 Difference]: With dead ends: 234 [2024-11-17 00:52:11,954 INFO L226 Difference]: Without dead ends: 234 [2024-11-17 00:52:11,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,955 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 39 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:11,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 117 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-17 00:52:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 171. [2024-11-17 00:52:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.6764705882352942) internal successors, (285), 170 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 285 transitions. [2024-11-17 00:52:11,964 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 285 transitions. Word has length 20 [2024-11-17 00:52:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:11,965 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 285 transitions. [2024-11-17 00:52:11,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 285 transitions. [2024-11-17 00:52:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:52:11,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:11,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:11,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:52:11,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:11,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:11,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1865464775, now seen corresponding path program 1 times [2024-11-17 00:52:11,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:11,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108057908] [2024-11-17 00:52:11,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:11,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108057908] [2024-11-17 00:52:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108057908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:11,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:11,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:11,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637722532] [2024-11-17 00:52:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:11,997 INFO L87 Difference]: Start difference. First operand 171 states and 285 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,007 INFO L93 Difference]: Finished difference Result 242 states and 395 transitions. [2024-11-17 00:52:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:52:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,009 INFO L225 Difference]: With dead ends: 242 [2024-11-17 00:52:12,009 INFO L226 Difference]: Without dead ends: 242 [2024-11-17 00:52:12,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,009 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-17 00:52:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2024-11-17 00:52:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.6512605042016806) internal successors, (393), 238 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 393 transitions. [2024-11-17 00:52:12,020 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 393 transitions. Word has length 20 [2024-11-17 00:52:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,020 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 393 transitions. [2024-11-17 00:52:12,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 393 transitions. [2024-11-17 00:52:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:52:12,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,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] [2024-11-17 00:52:12,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:52:12,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1793732659, now seen corresponding path program 1 times [2024-11-17 00:52:12,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542072471] [2024-11-17 00:52:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542072471] [2024-11-17 00:52:12,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542072471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097495182] [2024-11-17 00:52:12,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,048 INFO L87 Difference]: Start difference. First operand 239 states and 393 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,060 INFO L93 Difference]: Finished difference Result 246 states and 395 transitions. [2024-11-17 00:52:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:52:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,061 INFO L225 Difference]: With dead ends: 246 [2024-11-17 00:52:12,061 INFO L226 Difference]: Without dead ends: 246 [2024-11-17 00:52:12,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,062 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-17 00:52:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2024-11-17 00:52:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.6239669421487604) internal successors, (393), 242 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 393 transitions. [2024-11-17 00:52:12,073 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 393 transitions. Word has length 21 [2024-11-17 00:52:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,073 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 393 transitions. [2024-11-17 00:52:12,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 393 transitions. [2024-11-17 00:52:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:52:12,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:52:12,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1995676012, now seen corresponding path program 1 times [2024-11-17 00:52:12,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838338345] [2024-11-17 00:52:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838338345] [2024-11-17 00:52:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838338345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954499106] [2024-11-17 00:52:12,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,109 INFO L87 Difference]: Start difference. First operand 243 states and 393 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,121 INFO L93 Difference]: Finished difference Result 442 states and 719 transitions. [2024-11-17 00:52:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:52:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,123 INFO L225 Difference]: With dead ends: 442 [2024-11-17 00:52:12,123 INFO L226 Difference]: Without dead ends: 442 [2024-11-17 00:52:12,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,123 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 36 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-17 00:52:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 335. [2024-11-17 00:52:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.595808383233533) internal successors, (533), 334 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 533 transitions. [2024-11-17 00:52:12,129 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 533 transitions. Word has length 21 [2024-11-17 00:52:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,130 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 533 transitions. [2024-11-17 00:52:12,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 533 transitions. [2024-11-17 00:52:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:52:12,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:52:12,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1702273005, now seen corresponding path program 1 times [2024-11-17 00:52:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433620717] [2024-11-17 00:52:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433620717] [2024-11-17 00:52:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433620717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522066640] [2024-11-17 00:52:12,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,149 INFO L87 Difference]: Start difference. First operand 335 states and 533 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,163 INFO L93 Difference]: Finished difference Result 466 states and 727 transitions. [2024-11-17 00:52:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:52:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,164 INFO L225 Difference]: With dead ends: 466 [2024-11-17 00:52:12,164 INFO L226 Difference]: Without dead ends: 466 [2024-11-17 00:52:12,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,165 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-17 00:52:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 463. [2024-11-17 00:52:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.5692640692640694) internal successors, (725), 462 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 725 transitions. [2024-11-17 00:52:12,171 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 725 transitions. Word has length 21 [2024-11-17 00:52:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 725 transitions. [2024-11-17 00:52:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 725 transitions. [2024-11-17 00:52:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:52:12,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:52:12,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1737250336, now seen corresponding path program 1 times [2024-11-17 00:52:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636562228] [2024-11-17 00:52:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636562228] [2024-11-17 00:52:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636562228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481352936] [2024-11-17 00:52:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,207 INFO L87 Difference]: Start difference. First operand 463 states and 725 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,217 INFO L93 Difference]: Finished difference Result 474 states and 727 transitions. [2024-11-17 00:52:12,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:52:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,219 INFO L225 Difference]: With dead ends: 474 [2024-11-17 00:52:12,219 INFO L226 Difference]: Without dead ends: 474 [2024-11-17 00:52:12,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,220 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-17 00:52:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 471. [2024-11-17 00:52:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.5425531914893618) internal successors, (725), 470 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 725 transitions. [2024-11-17 00:52:12,227 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 725 transitions. Word has length 22 [2024-11-17 00:52:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,227 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 725 transitions. [2024-11-17 00:52:12,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 725 transitions. [2024-11-17 00:52:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:52:12,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:52:12,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1231691711, now seen corresponding path program 1 times [2024-11-17 00:52:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658100468] [2024-11-17 00:52:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658100468] [2024-11-17 00:52:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658100468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195589963] [2024-11-17 00:52:12,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,258 INFO L87 Difference]: Start difference. First operand 471 states and 725 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,267 INFO L93 Difference]: Finished difference Result 842 states and 1303 transitions. [2024-11-17 00:52:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:52:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,271 INFO L225 Difference]: With dead ends: 842 [2024-11-17 00:52:12,271 INFO L226 Difference]: Without dead ends: 842 [2024-11-17 00:52:12,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,272 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 33 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-17 00:52:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 663. [2024-11-17 00:52:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.5060422960725075) internal successors, (997), 662 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 997 transitions. [2024-11-17 00:52:12,282 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 997 transitions. Word has length 22 [2024-11-17 00:52:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,282 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 997 transitions. [2024-11-17 00:52:12,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 997 transitions. [2024-11-17 00:52:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:52:12,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:52:12,284 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 938288704, now seen corresponding path program 1 times [2024-11-17 00:52:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67976124] [2024-11-17 00:52:12,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67976124] [2024-11-17 00:52:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67976124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647832733] [2024-11-17 00:52:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,309 INFO L87 Difference]: Start difference. First operand 663 states and 997 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,320 INFO L93 Difference]: Finished difference Result 906 states and 1335 transitions. [2024-11-17 00:52:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:52:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,323 INFO L225 Difference]: With dead ends: 906 [2024-11-17 00:52:12,323 INFO L226 Difference]: Without dead ends: 906 [2024-11-17 00:52:12,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,324 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-17 00:52:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 903. [2024-11-17 00:52:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 1.4778270509977827) internal successors, (1333), 902 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1333 transitions. [2024-11-17 00:52:12,336 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1333 transitions. Word has length 22 [2024-11-17 00:52:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,337 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1333 transitions. [2024-11-17 00:52:12,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1333 transitions. [2024-11-17 00:52:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:52:12,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:52:12,338 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,339 INFO L85 PathProgramCache]: Analyzing trace with hash -471433242, now seen corresponding path program 1 times [2024-11-17 00:52:12,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107435169] [2024-11-17 00:52:12,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107435169] [2024-11-17 00:52:12,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107435169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019741321] [2024-11-17 00:52:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,359 INFO L87 Difference]: Start difference. First operand 903 states and 1333 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,370 INFO L93 Difference]: Finished difference Result 922 states and 1335 transitions. [2024-11-17 00:52:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:52:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,372 INFO L225 Difference]: With dead ends: 922 [2024-11-17 00:52:12,372 INFO L226 Difference]: Without dead ends: 922 [2024-11-17 00:52:12,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,373 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-17 00:52:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2024-11-17 00:52:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 1.4520697167755992) internal successors, (1333), 918 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1333 transitions. [2024-11-17 00:52:12,384 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1333 transitions. Word has length 23 [2024-11-17 00:52:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,385 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1333 transitions. [2024-11-17 00:52:12,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1333 transitions. [2024-11-17 00:52:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:52:12,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:52:12,387 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash -976991867, now seen corresponding path program 1 times [2024-11-17 00:52:12,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626968552] [2024-11-17 00:52:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626968552] [2024-11-17 00:52:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626968552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642441327] [2024-11-17 00:52:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,404 INFO L87 Difference]: Start difference. First operand 919 states and 1333 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,416 INFO L93 Difference]: Finished difference Result 1610 states and 2343 transitions. [2024-11-17 00:52:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:52:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,420 INFO L225 Difference]: With dead ends: 1610 [2024-11-17 00:52:12,420 INFO L226 Difference]: Without dead ends: 1610 [2024-11-17 00:52:12,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,421 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2024-11-17 00:52:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1319. [2024-11-17 00:52:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.4119878603945373) internal successors, (1861), 1318 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1861 transitions. [2024-11-17 00:52:12,440 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1861 transitions. Word has length 23 [2024-11-17 00:52:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,440 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1861 transitions. [2024-11-17 00:52:12,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1861 transitions. [2024-11-17 00:52:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:52:12,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:52:12,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1270394874, now seen corresponding path program 1 times [2024-11-17 00:52:12,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130137790] [2024-11-17 00:52:12,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130137790] [2024-11-17 00:52:12,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130137790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176007130] [2024-11-17 00:52:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,465 INFO L87 Difference]: Start difference. First operand 1319 states and 1861 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,478 INFO L93 Difference]: Finished difference Result 1770 states and 2439 transitions. [2024-11-17 00:52:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:52:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,482 INFO L225 Difference]: With dead ends: 1770 [2024-11-17 00:52:12,482 INFO L226 Difference]: Without dead ends: 1770 [2024-11-17 00:52:12,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,483 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-11-17 00:52:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1767. [2024-11-17 00:52:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1766 states have (on average 1.3799546998867498) internal successors, (2437), 1766 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2437 transitions. [2024-11-17 00:52:12,508 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2437 transitions. Word has length 23 [2024-11-17 00:52:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,508 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2437 transitions. [2024-11-17 00:52:12,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2437 transitions. [2024-11-17 00:52:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:52:12,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:52:12,510 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,511 INFO L85 PathProgramCache]: Analyzing trace with hash -221154151, now seen corresponding path program 1 times [2024-11-17 00:52:12,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072334716] [2024-11-17 00:52:12,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072334716] [2024-11-17 00:52:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072334716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457905859] [2024-11-17 00:52:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,544 INFO L87 Difference]: Start difference. First operand 1767 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,558 INFO L93 Difference]: Finished difference Result 1802 states and 2439 transitions. [2024-11-17 00:52:12,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:52:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,563 INFO L225 Difference]: With dead ends: 1802 [2024-11-17 00:52:12,563 INFO L226 Difference]: Without dead ends: 1802 [2024-11-17 00:52:12,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,564 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-17 00:52:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1799. [2024-11-17 00:52:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1798 states have (on average 1.3553948832035596) internal successors, (2437), 1798 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2437 transitions. [2024-11-17 00:52:12,595 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2437 transitions. Word has length 24 [2024-11-17 00:52:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,596 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2437 transitions. [2024-11-17 00:52:12,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2437 transitions. [2024-11-17 00:52:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:52:12,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:52:12,598 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -726712776, now seen corresponding path program 1 times [2024-11-17 00:52:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145009591] [2024-11-17 00:52:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145009591] [2024-11-17 00:52:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145009591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886816586] [2024-11-17 00:52:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,624 INFO L87 Difference]: Start difference. First operand 1799 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,642 INFO L93 Difference]: Finished difference Result 3082 states and 4167 transitions. [2024-11-17 00:52:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:52:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,649 INFO L225 Difference]: With dead ends: 3082 [2024-11-17 00:52:12,649 INFO L226 Difference]: Without dead ends: 3082 [2024-11-17 00:52:12,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,650 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2024-11-17 00:52:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2631. [2024-11-17 00:52:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 1.3159695817490493) internal successors, (3461), 2630 states have internal predecessors, (3461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3461 transitions. [2024-11-17 00:52:12,690 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3461 transitions. Word has length 24 [2024-11-17 00:52:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,691 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3461 transitions. [2024-11-17 00:52:12,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3461 transitions. [2024-11-17 00:52:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:52:12,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:52:12,693 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1020115783, now seen corresponding path program 1 times [2024-11-17 00:52:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003717611] [2024-11-17 00:52:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003717611] [2024-11-17 00:52:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003717611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556218828] [2024-11-17 00:52:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,711 INFO L87 Difference]: Start difference. First operand 2631 states and 3461 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,729 INFO L93 Difference]: Finished difference Result 3466 states and 4423 transitions. [2024-11-17 00:52:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:52:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,738 INFO L225 Difference]: With dead ends: 3466 [2024-11-17 00:52:12,738 INFO L226 Difference]: Without dead ends: 3466 [2024-11-17 00:52:12,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,739 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 140 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2024-11-17 00:52:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3463. [2024-11-17 00:52:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 3462 states have (on average 1.277007510109763) internal successors, (4421), 3462 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4421 transitions. [2024-11-17 00:52:12,783 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4421 transitions. Word has length 24 [2024-11-17 00:52:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,783 INFO L471 AbstractCegarLoop]: Abstraction has 3463 states and 4421 transitions. [2024-11-17 00:52:12,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4421 transitions. [2024-11-17 00:52:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:52:12,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:52:12,786 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1052443649, now seen corresponding path program 1 times [2024-11-17 00:52:12,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626145871] [2024-11-17 00:52:12,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626145871] [2024-11-17 00:52:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626145871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766994242] [2024-11-17 00:52:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,807 INFO L87 Difference]: Start difference. First operand 3463 states and 4421 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,822 INFO L93 Difference]: Finished difference Result 3530 states and 4423 transitions. [2024-11-17 00:52:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:52:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,829 INFO L225 Difference]: With dead ends: 3530 [2024-11-17 00:52:12,830 INFO L226 Difference]: Without dead ends: 3530 [2024-11-17 00:52:12,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,831 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 126 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2024-11-17 00:52:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3527. [2024-11-17 00:52:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 3526 states have (on average 1.2538287010777085) internal successors, (4421), 3526 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 4421 transitions. [2024-11-17 00:52:12,888 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 4421 transitions. Word has length 25 [2024-11-17 00:52:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:12,888 INFO L471 AbstractCegarLoop]: Abstraction has 3527 states and 4421 transitions. [2024-11-17 00:52:12,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 4421 transitions. [2024-11-17 00:52:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:52:12,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:12,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:12,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 00:52:12,893 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1558002274, now seen corresponding path program 1 times [2024-11-17 00:52:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182534989] [2024-11-17 00:52:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:12,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:12,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182534989] [2024-11-17 00:52:12,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182534989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:12,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:12,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:12,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309761065] [2024-11-17 00:52:12,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:12,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,911 INFO L87 Difference]: Start difference. First operand 3527 states and 4421 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:12,932 INFO L93 Difference]: Finished difference Result 5898 states and 7303 transitions. [2024-11-17 00:52:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:12,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:52:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:12,948 INFO L225 Difference]: With dead ends: 5898 [2024-11-17 00:52:12,949 INFO L226 Difference]: Without dead ends: 5898 [2024-11-17 00:52:12,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:12,950 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:12,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2024-11-17 00:52:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 5255. [2024-11-17 00:52:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5255 states, 5254 states have (on average 1.2190711838599162) internal successors, (6405), 5254 states have internal predecessors, (6405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5255 states to 5255 states and 6405 transitions. [2024-11-17 00:52:13,011 INFO L78 Accepts]: Start accepts. Automaton has 5255 states and 6405 transitions. Word has length 25 [2024-11-17 00:52:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:13,012 INFO L471 AbstractCegarLoop]: Abstraction has 5255 states and 6405 transitions. [2024-11-17 00:52:13,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 6405 transitions. [2024-11-17 00:52:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:52:13,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:13,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:13,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 00:52:13,017 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:13,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1851405281, now seen corresponding path program 1 times [2024-11-17 00:52:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:13,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305769176] [2024-11-17 00:52:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:13,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305769176] [2024-11-17 00:52:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305769176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:13,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:13,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131403508] [2024-11-17 00:52:13,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:13,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:13,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:13,032 INFO L87 Difference]: Start difference. First operand 5255 states and 6405 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:13,056 INFO L93 Difference]: Finished difference Result 6794 states and 7943 transitions. [2024-11-17 00:52:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:13,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:52:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:13,064 INFO L225 Difference]: With dead ends: 6794 [2024-11-17 00:52:13,064 INFO L226 Difference]: Without dead ends: 6794 [2024-11-17 00:52:13,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:13,065 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:13,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 141 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6794 states. [2024-11-17 00:52:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6794 to 6791. [2024-11-17 00:52:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6791 states, 6790 states have (on average 1.1695139911634758) internal successors, (7941), 6790 states have internal predecessors, (7941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6791 states to 6791 states and 7941 transitions. [2024-11-17 00:52:13,146 INFO L78 Accepts]: Start accepts. Automaton has 6791 states and 7941 transitions. Word has length 25 [2024-11-17 00:52:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:13,146 INFO L471 AbstractCegarLoop]: Abstraction has 6791 states and 7941 transitions. [2024-11-17 00:52:13,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6791 states and 7941 transitions. [2024-11-17 00:52:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:52:13,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:13,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 00:52:13,156 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1052621038, now seen corresponding path program 1 times [2024-11-17 00:52:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165978605] [2024-11-17 00:52:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165978605] [2024-11-17 00:52:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165978605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:13,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:13,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648854679] [2024-11-17 00:52:13,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:13,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:13,173 INFO L87 Difference]: Start difference. First operand 6791 states and 7941 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:13,203 INFO L93 Difference]: Finished difference Result 6922 states and 7943 transitions. [2024-11-17 00:52:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-17 00:52:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:13,215 INFO L225 Difference]: With dead ends: 6922 [2024-11-17 00:52:13,216 INFO L226 Difference]: Without dead ends: 6922 [2024-11-17 00:52:13,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:13,216 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:13,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2024-11-17 00:52:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6919. [2024-11-17 00:52:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6919 states, 6918 states have (on average 1.147875108412836) internal successors, (7941), 6918 states have internal predecessors, (7941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6919 states to 6919 states and 7941 transitions. [2024-11-17 00:52:13,285 INFO L78 Accepts]: Start accepts. Automaton has 6919 states and 7941 transitions. Word has length 26 [2024-11-17 00:52:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 6919 states and 7941 transitions. [2024-11-17 00:52:13,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6919 states and 7941 transitions. [2024-11-17 00:52:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:52:13,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:13,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:13,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 00:52:13,291 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:13,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:13,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1558179663, now seen corresponding path program 1 times [2024-11-17 00:52:13,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:13,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972512792] [2024-11-17 00:52:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:13,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972512792] [2024-11-17 00:52:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972512792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650715635] [2024-11-17 00:52:13,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:13,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:13,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:13,316 INFO L87 Difference]: Start difference. First operand 6919 states and 7941 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:13,348 INFO L93 Difference]: Finished difference Result 11271 states and 12549 transitions. [2024-11-17 00:52:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:13,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-17 00:52:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:13,362 INFO L225 Difference]: With dead ends: 11271 [2024-11-17 00:52:13,363 INFO L226 Difference]: Without dead ends: 11271 [2024-11-17 00:52:13,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:13,363 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:13,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2024-11-17 00:52:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 10503. [2024-11-17 00:52:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10503 states, 10502 states have (on average 1.1217863264140164) internal successors, (11781), 10502 states have internal predecessors, (11781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10503 states to 10503 states and 11781 transitions. [2024-11-17 00:52:13,495 INFO L78 Accepts]: Start accepts. Automaton has 10503 states and 11781 transitions. Word has length 26 [2024-11-17 00:52:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:13,495 INFO L471 AbstractCegarLoop]: Abstraction has 10503 states and 11781 transitions. [2024-11-17 00:52:13,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 10503 states and 11781 transitions. [2024-11-17 00:52:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:52:13,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:52:13,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:52:13,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 00:52:13,506 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:52:13,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:52:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1851582670, now seen corresponding path program 1 times [2024-11-17 00:52:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:52:13,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439897555] [2024-11-17 00:52:13,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:52:13,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:52:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:52:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:52:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:52:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439897555] [2024-11-17 00:52:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439897555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:52:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:52:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:52:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635282367] [2024-11-17 00:52:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:52:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:52:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:52:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:52:13,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:13,523 INFO L87 Difference]: Start difference. First operand 10503 states and 11781 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:52:13,575 INFO L93 Difference]: Finished difference Result 13316 states and 14083 transitions. [2024-11-17 00:52:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:52:13,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-17 00:52:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:52:13,576 INFO L225 Difference]: With dead ends: 13316 [2024-11-17 00:52:13,576 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 00:52:13,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:52:13,577 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 35 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:52:13,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:52:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 00:52:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 00:52:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 00:52:13,578 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-17 00:52:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:52:13,578 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 00:52:13,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:52:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 00:52:13,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 00:52:13,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-17 00:52:13,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-17 00:52:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-17 00:52:13,584 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] [2024-11-17 00:52:13,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:52:13,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:52:13 BoogieIcfgContainer [2024-11-17 00:52:13,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:52:13,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:52:13,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:52:13,589 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:52:13,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:52:11" (3/4) ... [2024-11-17 00:52:13,591 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 00:52:13,599 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-17 00:52:13,600 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-17 00:52:13,600 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 00:52:13,601 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 00:52:13,679 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:52:13,679 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 00:52:13,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:52:13,680 INFO L158 Benchmark]: Toolchain (without parser) took 3233.82ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 159.6MB in the beginning and 76.2MB in the end (delta: 83.4MB). Peak memory consumption was 121.3MB. Max. memory is 16.1GB. [2024-11-17 00:52:13,681 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:52:13,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.60ms. Allocated memory is still 188.7MB. Free memory was 159.3MB in the beginning and 150.1MB in the end (delta: 9.3MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-17 00:52:13,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.42ms. Allocated memory is still 188.7MB. Free memory was 150.1MB in the beginning and 148.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:13,681 INFO L158 Benchmark]: Boogie Preprocessor took 22.56ms. Allocated memory is still 188.7MB. Free memory was 148.4MB in the beginning and 146.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:52:13,682 INFO L158 Benchmark]: IcfgBuilder took 318.11ms. Allocated memory is still 188.7MB. Free memory was 146.3MB in the beginning and 131.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 00:52:13,682 INFO L158 Benchmark]: TraceAbstraction took 2556.30ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 131.2MB in the beginning and 81.4MB in the end (delta: 49.8MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2024-11-17 00:52:13,682 INFO L158 Benchmark]: Witness Printer took 91.64ms. Allocated memory is still 226.5MB. Free memory was 81.4MB in the beginning and 76.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 00:52:13,683 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.13ms. Allocated memory is still 130.0MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.60ms. Allocated memory is still 188.7MB. Free memory was 159.3MB in the beginning and 150.1MB in the end (delta: 9.3MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.42ms. Allocated memory is still 188.7MB. Free memory was 150.1MB in the beginning and 148.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.56ms. Allocated memory is still 188.7MB. Free memory was 148.4MB in the beginning and 146.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 318.11ms. Allocated memory is still 188.7MB. Free memory was 146.3MB in the beginning and 131.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2556.30ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 131.2MB in the beginning and 81.4MB in the end (delta: 49.8MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. * Witness Printer took 91.64ms. Allocated memory is still 226.5MB. Free memory was 81.4MB in the beginning and 76.2MB in the end (delta: 5.2MB). 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: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: 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: 2.5s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1067 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1067 mSDsluCounter, 3473 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1329 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 2144 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10503occurred in iteration=27, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 2609 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 562 ConstructedInterpolants, 0 QuantifiedInterpolants, 1132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-17 00:52:13,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE