./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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_13.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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:33:07,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:33:07,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:33:07,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:33:07,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:33:07,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:33:07,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:33:07,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:33:07,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:33:07,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:33:07,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:33:07,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:33:07,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:33:07,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:33:07,369 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:33:07,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:33:07,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:33:07,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:33:07,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:33:07,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:33:07,370 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:33:07,371 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:33:07,371 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:33:07,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:33:07,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:33:07,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:33:07,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:33:07,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:33:07,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:33:07,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:33:07,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:33:07,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:33:07,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:33:07,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:33:07,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:33:07,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:33:07,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:33:07,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:33:07,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:33:07,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:33:07,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:33:07,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:33:07,377 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2024-11-10 15:33:07,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:33:07,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:33:07,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:33:07,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:33:07,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:33:07,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2024-11-10 15:33:09,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:33:09,172 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:33:09,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2024-11-10 15:33:09,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4261975ef/c0694705bbc14eeba6961250c0115916/FLAG2ee4d2ed4 [2024-11-10 15:33:09,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4261975ef/c0694705bbc14eeba6961250c0115916 [2024-11-10 15:33:09,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:33:09,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:33:09,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:33:09,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:33:09,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:33:09,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b482801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09, skipping insertion in model container [2024-11-10 15:33:09,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:33:09,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:33:09,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:33:09,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:33:09,495 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:33:09,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09 WrapperNode [2024-11-10 15:33:09,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:33:09,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:33:09,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:33:09,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:33:09,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,532 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 184 [2024-11-10 15:33:09,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:33:09,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:33:09,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:33:09,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:33:09,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,556 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-10 15:33:09,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:33:09,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:33:09,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:33:09,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:33:09,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (1/1) ... [2024-11-10 15:33:09,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:33:09,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:33:09,597 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-10 15:33:09,603 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-10 15:33:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:33:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:33:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:33:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:33:09,733 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:33:09,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:33:10,013 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-10 15:33:10,013 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:33:10,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:33:10,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:33:10,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:10 BoogieIcfgContainer [2024-11-10 15:33:10,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:33:10,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:33:10,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:33:10,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:33:10,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:33:09" (1/3) ... [2024-11-10 15:33:10,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e327c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:10, skipping insertion in model container [2024-11-10 15:33:10,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:09" (2/3) ... [2024-11-10 15:33:10,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e327c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:10, skipping insertion in model container [2024-11-10 15:33:10,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:10" (3/3) ... [2024-11-10 15:33:10,038 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2024-11-10 15:33:10,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:33:10,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 15:33:10,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:33:10,100 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;@7998c61e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:33:10,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 15:33:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 54 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:33:10,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:10,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:33:10,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:10,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 733107807, now seen corresponding path program 1 times [2024-11-10 15:33:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684428353] [2024-11-10 15:33:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:10,249 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-10 15:33:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:10,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684428353] [2024-11-10 15:33:10,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684428353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:10,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:33:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868328990] [2024-11-10 15:33:10,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:10,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 15:33:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:10,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 15:33:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:33:10,285 INFO L87 Difference]: Start difference. First operand has 55 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 54 states have internal predecessors, (96), 0 states have call successors, (0), 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-10 15:33:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:10,298 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2024-11-10 15:33:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 15:33:10,299 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-10 15:33:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:10,305 INFO L225 Difference]: With dead ends: 54 [2024-11-10 15:33:10,305 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 15:33:10,306 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-10 15:33:10,309 INFO L432 NwaCegarLoop]: 92 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, 92 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-10 15:33:10,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 15:33:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 15:33:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.816326530612245) internal successors, (89), 50 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2024-11-10 15:33:10,335 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 6 [2024-11-10 15:33:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:10,335 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2024-11-10 15:33:10,335 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-10 15:33:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2024-11-10 15:33:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:33:10,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:10,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:33:10,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 233491718, now seen corresponding path program 1 times [2024-11-10 15:33:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099101351] [2024-11-10 15:33:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:10,421 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-10 15:33:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099101351] [2024-11-10 15:33:10,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099101351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:10,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:33:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677688116] [2024-11-10 15:33:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:10,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:10,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:10,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:10,426 INFO L87 Difference]: Start difference. First operand 51 states and 89 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-10 15:33:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:10,442 INFO L93 Difference]: Finished difference Result 50 states and 88 transitions. [2024-11-10 15:33:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:10,443 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-10 15:33:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:10,444 INFO L225 Difference]: With dead ends: 50 [2024-11-10 15:33:10,444 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 15:33:10,444 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-10 15:33:10,445 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 88 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-10 15:33:10,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 15:33:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 15:33:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 85 transitions. [2024-11-10 15:33:10,452 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 85 transitions. Word has length 8 [2024-11-10 15:33:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:10,452 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 85 transitions. [2024-11-10 15:33:10,452 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-10 15:33:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 85 transitions. [2024-11-10 15:33:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:33:10,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:10,453 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-10 15:33:10,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:33:10,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:10,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1335916983, now seen corresponding path program 1 times [2024-11-10 15:33:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:10,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84085991] [2024-11-10 15:33:10,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:10,531 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-10 15:33:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84085991] [2024-11-10 15:33:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84085991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:10,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287888953] [2024-11-10 15:33:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:10,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:10,534 INFO L87 Difference]: Start difference. First operand 47 states and 85 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-10 15:33:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:10,569 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2024-11-10 15:33:10,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:10,572 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-10 15:33:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:10,573 INFO L225 Difference]: With dead ends: 91 [2024-11-10 15:33:10,574 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 15:33:10,574 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-10 15:33:10,575 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 169 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-10 15:33:10,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 15:33:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2024-11-10 15:33:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 60 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2024-11-10 15:33:10,586 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 22 [2024-11-10 15:33:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:10,586 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions. [2024-11-10 15:33:10,587 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-10 15:33:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2024-11-10 15:33:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:33:10,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:10,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:10,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:33:10,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:10,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash 17392714, now seen corresponding path program 1 times [2024-11-10 15:33:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:10,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158145441] [2024-11-10 15:33:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:10,690 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-10 15:33:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:10,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158145441] [2024-11-10 15:33:10,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158145441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:10,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399890542] [2024-11-10 15:33:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:10,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:10,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:10,694 INFO L87 Difference]: Start difference. First operand 61 states and 112 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-10 15:33:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:10,715 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2024-11-10 15:33:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:10,715 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-10 15:33:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:10,716 INFO L225 Difference]: With dead ends: 91 [2024-11-10 15:33:10,716 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 15:33:10,716 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-10 15:33:10,718 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 65 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 190 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-10 15:33:10,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 15:33:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-11-10 15:33:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.8505747126436782) internal successors, (161), 87 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2024-11-10 15:33:10,727 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 22 [2024-11-10 15:33:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:10,727 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2024-11-10 15:33:10,727 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-10 15:33:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2024-11-10 15:33:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:33:10,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:10,729 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-10 15:33:10,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:33:10,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:10,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1537129684, now seen corresponding path program 1 times [2024-11-10 15:33:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848139776] [2024-11-10 15:33:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:10,811 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-10 15:33:10,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:10,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848139776] [2024-11-10 15:33:10,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848139776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:10,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:10,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881225960] [2024-11-10 15:33:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:10,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:10,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:10,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:10,814 INFO L87 Difference]: Start difference. First operand 88 states and 161 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-10 15:33:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:10,830 INFO L93 Difference]: Finished difference Result 95 states and 166 transitions. [2024-11-10 15:33:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:10,831 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-10 15:33:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:10,832 INFO L225 Difference]: With dead ends: 95 [2024-11-10 15:33:10,832 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 15:33:10,832 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-10 15:33:10,833 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 214 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-10 15:33:10,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 15:33:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-10 15:33:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.8021978021978022) internal successors, (164), 91 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2024-11-10 15:33:10,849 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 23 [2024-11-10 15:33:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2024-11-10 15:33:10,850 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-10 15:33:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2024-11-10 15:33:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:33:10,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:10,851 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-10 15:33:10,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:33:10,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 540057331, now seen corresponding path program 1 times [2024-11-10 15:33:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:10,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398545758] [2024-11-10 15:33:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:10,956 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-10 15:33:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398545758] [2024-11-10 15:33:10,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398545758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:10,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:10,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094291623] [2024-11-10 15:33:10,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:10,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:10,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:10,959 INFO L87 Difference]: Start difference. First operand 92 states and 164 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-10 15:33:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,019 INFO L93 Difference]: Finished difference Result 174 states and 313 transitions. [2024-11-10 15:33:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,020 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-10 15:33:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,021 INFO L225 Difference]: With dead ends: 174 [2024-11-10 15:33:11,021 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 15:33:11,022 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-10 15:33:11,023 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 167 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-10 15:33:11,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 15:33:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 121. [2024-11-10 15:33:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.8083333333333333) internal successors, (217), 120 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 217 transitions. [2024-11-10 15:33:11,039 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 217 transitions. Word has length 23 [2024-11-10 15:33:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,040 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 217 transitions. [2024-11-10 15:33:11,040 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-10 15:33:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 217 transitions. [2024-11-10 15:33:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:33:11,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:11,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:33:11,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1893367028, now seen corresponding path program 1 times [2024-11-10 15:33:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950641593] [2024-11-10 15:33:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,093 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-10 15:33:11,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950641593] [2024-11-10 15:33:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950641593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430398428] [2024-11-10 15:33:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,097 INFO L87 Difference]: Start difference. First operand 121 states and 217 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-10 15:33:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,115 INFO L93 Difference]: Finished difference Result 176 states and 311 transitions. [2024-11-10 15:33:11,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,116 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-10 15:33:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,119 INFO L225 Difference]: With dead ends: 176 [2024-11-10 15:33:11,119 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 15:33:11,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,120 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 191 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-10 15:33:11,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 15:33:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-11-10 15:33:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.7965116279069768) internal successors, (309), 172 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 309 transitions. [2024-11-10 15:33:11,141 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 309 transitions. Word has length 23 [2024-11-10 15:33:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,141 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 309 transitions. [2024-11-10 15:33:11,141 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-10 15:33:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 309 transitions. [2024-11-10 15:33:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:33:11,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,143 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-10 15:33:11,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:33:11,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash -437215453, now seen corresponding path program 1 times [2024-11-10 15:33:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376202127] [2024-11-10 15:33:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,175 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-10 15:33:11,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376202127] [2024-11-10 15:33:11,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376202127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429458315] [2024-11-10 15:33:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,177 INFO L87 Difference]: Start difference. First operand 173 states and 309 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-10 15:33:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,190 INFO L93 Difference]: Finished difference Result 178 states and 311 transitions. [2024-11-10 15:33:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,190 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-10 15:33:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,191 INFO L225 Difference]: With dead ends: 178 [2024-11-10 15:33:11,191 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 15:33:11,191 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-10 15:33:11,192 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 66 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 210 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-10 15:33:11,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 210 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 15:33:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-11-10 15:33:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.7758620689655173) internal successors, (309), 174 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 309 transitions. [2024-11-10 15:33:11,209 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 309 transitions. Word has length 24 [2024-11-10 15:33:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,209 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 309 transitions. [2024-11-10 15:33:11,209 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-10 15:33:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 309 transitions. [2024-11-10 15:33:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:33:11,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,211 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-10 15:33:11,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:33:11,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1434287806, now seen corresponding path program 1 times [2024-11-10 15:33:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484413186] [2024-11-10 15:33:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,253 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-10 15:33:11,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484413186] [2024-11-10 15:33:11,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484413186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231622842] [2024-11-10 15:33:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,258 INFO L87 Difference]: Start difference. First operand 175 states and 309 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-10 15:33:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,279 INFO L93 Difference]: Finished difference Result 330 states and 587 transitions. [2024-11-10 15:33:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,279 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-10 15:33:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,284 INFO L225 Difference]: With dead ends: 330 [2024-11-10 15:33:11,284 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 15:33:11,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,285 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 59 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 165 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-10 15:33:11,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 15:33:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 235. [2024-11-10 15:33:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.764957264957265) internal successors, (413), 234 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 413 transitions. [2024-11-10 15:33:11,297 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 413 transitions. Word has length 24 [2024-11-10 15:33:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,297 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 413 transitions. [2024-11-10 15:33:11,298 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-10 15:33:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 413 transitions. [2024-11-10 15:33:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:33:11,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,299 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-10 15:33:11,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:33:11,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash -80978109, now seen corresponding path program 1 times [2024-11-10 15:33:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455740319] [2024-11-10 15:33:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,328 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-10 15:33:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455740319] [2024-11-10 15:33:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455740319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139377244] [2024-11-10 15:33:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,331 INFO L87 Difference]: Start difference. First operand 235 states and 413 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-10 15:33:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,347 INFO L93 Difference]: Finished difference Result 338 states and 587 transitions. [2024-11-10 15:33:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,348 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-10 15:33:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,349 INFO L225 Difference]: With dead ends: 338 [2024-11-10 15:33:11,349 INFO L226 Difference]: Without dead ends: 338 [2024-11-10 15:33:11,349 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-10 15:33:11,350 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 192 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-10 15:33:11,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-10 15:33:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 335. [2024-11-10 15:33:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.751497005988024) internal successors, (585), 334 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 585 transitions. [2024-11-10 15:33:11,358 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 585 transitions. Word has length 24 [2024-11-10 15:33:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,359 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 585 transitions. [2024-11-10 15:33:11,359 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-10 15:33:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 585 transitions. [2024-11-10 15:33:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:33:11,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,360 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-10 15:33:11,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:33:11,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1512379283, now seen corresponding path program 1 times [2024-11-10 15:33:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441226491] [2024-11-10 15:33:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,396 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-10 15:33:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441226491] [2024-11-10 15:33:11,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441226491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596994253] [2024-11-10 15:33:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,398 INFO L87 Difference]: Start difference. First operand 335 states and 585 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-10 15:33:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,412 INFO L93 Difference]: Finished difference Result 342 states and 587 transitions. [2024-11-10 15:33:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,413 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-10 15:33:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,415 INFO L225 Difference]: With dead ends: 342 [2024-11-10 15:33:11,415 INFO L226 Difference]: Without dead ends: 342 [2024-11-10 15:33:11,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,416 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 206 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-10 15:33:11,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 206 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-10 15:33:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 339. [2024-11-10 15:33:11,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.7307692307692308) internal successors, (585), 338 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 585 transitions. [2024-11-10 15:33:11,425 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 585 transitions. Word has length 25 [2024-11-10 15:33:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 585 transitions. [2024-11-10 15:33:11,427 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-10 15:33:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 585 transitions. [2024-11-10 15:33:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:33:11,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,427 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-10 15:33:11,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:33:11,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1785515660, now seen corresponding path program 1 times [2024-11-10 15:33:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113885447] [2024-11-10 15:33:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:11,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113885447] [2024-11-10 15:33:11,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113885447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799526947] [2024-11-10 15:33:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,469 INFO L87 Difference]: Start difference. First operand 339 states and 585 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-10 15:33:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,485 INFO L93 Difference]: Finished difference Result 634 states and 1103 transitions. [2024-11-10 15:33:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,486 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-10 15:33:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,489 INFO L225 Difference]: With dead ends: 634 [2024-11-10 15:33:11,489 INFO L226 Difference]: Without dead ends: 634 [2024-11-10 15:33:11,489 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-10 15:33:11,494 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 56 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 163 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-10 15:33:11,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-10 15:33:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 463. [2024-11-10 15:33:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.7077922077922079) internal successors, (789), 462 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 789 transitions. [2024-11-10 15:33:11,507 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 789 transitions. Word has length 25 [2024-11-10 15:33:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,507 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 789 transitions. [2024-11-10 15:33:11,507 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-10 15:33:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 789 transitions. [2024-11-10 15:33:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:33:11,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,509 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-10 15:33:11,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:33:11,509 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1156141939, now seen corresponding path program 1 times [2024-11-10 15:33:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019665092] [2024-11-10 15:33:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,549 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-10 15:33:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019665092] [2024-11-10 15:33:11,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019665092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20548082] [2024-11-10 15:33:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,553 INFO L87 Difference]: Start difference. First operand 463 states and 789 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-10 15:33:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,570 INFO L93 Difference]: Finished difference Result 658 states and 1111 transitions. [2024-11-10 15:33:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,571 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-10 15:33:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,573 INFO L225 Difference]: With dead ends: 658 [2024-11-10 15:33:11,574 INFO L226 Difference]: Without dead ends: 658 [2024-11-10 15:33:11,574 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-10 15:33:11,576 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 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-10 15:33:11,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-10 15:33:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 655. [2024-11-10 15:33:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.6957186544342508) internal successors, (1109), 654 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1109 transitions. [2024-11-10 15:33:11,591 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1109 transitions. Word has length 25 [2024-11-10 15:33:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,591 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1109 transitions. [2024-11-10 15:33:11,591 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-10 15:33:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1109 transitions. [2024-11-10 15:33:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:33:11,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,593 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-10 15:33:11,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:33:11,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,594 INFO L85 PathProgramCache]: Analyzing trace with hash -482726372, now seen corresponding path program 1 times [2024-11-10 15:33:11,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204041935] [2024-11-10 15:33:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,649 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-10 15:33:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204041935] [2024-11-10 15:33:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204041935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936764686] [2024-11-10 15:33:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,652 INFO L87 Difference]: Start difference. First operand 655 states and 1109 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-10 15:33:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,667 INFO L93 Difference]: Finished difference Result 666 states and 1111 transitions. [2024-11-10 15:33:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,668 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-10 15:33:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,670 INFO L225 Difference]: With dead ends: 666 [2024-11-10 15:33:11,670 INFO L226 Difference]: Without dead ends: 666 [2024-11-10 15:33:11,671 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-10 15:33:11,672 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 202 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-10 15:33:11,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 202 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-10 15:33:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 663. [2024-11-10 15:33:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.6752265861027191) internal successors, (1109), 662 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1109 transitions. [2024-11-10 15:33:11,688 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1109 transitions. Word has length 26 [2024-11-10 15:33:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,689 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1109 transitions. [2024-11-10 15:33:11,690 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-10 15:33:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1109 transitions. [2024-11-10 15:33:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:33:11,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,691 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-10 15:33:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:33:11,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1479798725, now seen corresponding path program 1 times [2024-11-10 15:33:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3300172] [2024-11-10 15:33:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,723 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-10 15:33:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3300172] [2024-11-10 15:33:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3300172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175574163] [2024-11-10 15:33:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,726 INFO L87 Difference]: Start difference. First operand 663 states and 1109 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-10 15:33:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,744 INFO L93 Difference]: Finished difference Result 1226 states and 2071 transitions. [2024-11-10 15:33:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,745 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-10 15:33:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,750 INFO L225 Difference]: With dead ends: 1226 [2024-11-10 15:33:11,750 INFO L226 Difference]: Without dead ends: 1226 [2024-11-10 15:33:11,752 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-10 15:33:11,752 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 53 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 161 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-10 15:33:11,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-10 15:33:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 919. [2024-11-10 15:33:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 1.6437908496732025) internal successors, (1509), 918 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1509 transitions. [2024-11-10 15:33:11,780 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1509 transitions. Word has length 26 [2024-11-10 15:33:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,780 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1509 transitions. [2024-11-10 15:33:11,780 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-10 15:33:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1509 transitions. [2024-11-10 15:33:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:33:11,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,782 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-10 15:33:11,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:33:11,783 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash -126489028, now seen corresponding path program 1 times [2024-11-10 15:33:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654338442] [2024-11-10 15:33:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,819 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-10 15:33:11,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654338442] [2024-11-10 15:33:11,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654338442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072603199] [2024-11-10 15:33:11,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,822 INFO L87 Difference]: Start difference. First operand 919 states and 1509 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-10 15:33:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,845 INFO L93 Difference]: Finished difference Result 1290 states and 2103 transitions. [2024-11-10 15:33:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,846 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-10 15:33:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,850 INFO L225 Difference]: With dead ends: 1290 [2024-11-10 15:33:11,851 INFO L226 Difference]: Without dead ends: 1290 [2024-11-10 15:33:11,851 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-10 15:33:11,852 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 194 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-10 15:33:11,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2024-11-10 15:33:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1287. [2024-11-10 15:33:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1286 states have (on average 1.6337480559875583) internal successors, (2101), 1286 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2101 transitions. [2024-11-10 15:33:11,877 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2101 transitions. Word has length 26 [2024-11-10 15:33:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,878 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 2101 transitions. [2024-11-10 15:33:11,878 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-10 15:33:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2101 transitions. [2024-11-10 15:33:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:33:11,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:11,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:33:11,880 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1371736070, now seen corresponding path program 1 times [2024-11-10 15:33:11,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80731412] [2024-11-10 15:33:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,913 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-10 15:33:11,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80731412] [2024-11-10 15:33:11,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80731412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557679344] [2024-11-10 15:33:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:11,916 INFO L87 Difference]: Start difference. First operand 1287 states and 2101 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:11,933 INFO L93 Difference]: Finished difference Result 1306 states and 2103 transitions. [2024-11-10 15:33:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:11,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-10 15:33:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:11,937 INFO L225 Difference]: With dead ends: 1306 [2024-11-10 15:33:11,938 INFO L226 Difference]: Without dead ends: 1306 [2024-11-10 15:33:11,938 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-10 15:33:11,938 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 63 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 198 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-10 15:33:11,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2024-11-10 15:33:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1303. [2024-11-10 15:33:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1302 states have (on average 1.6136712749615976) internal successors, (2101), 1302 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 2101 transitions. [2024-11-10 15:33:11,965 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 2101 transitions. Word has length 27 [2024-11-10 15:33:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:11,965 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 2101 transitions. [2024-11-10 15:33:11,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 2101 transitions. [2024-11-10 15:33:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:33:11,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:11,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:11,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:33:11,968 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 374663717, now seen corresponding path program 1 times [2024-11-10 15:33:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006004986] [2024-11-10 15:33:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:11,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:11,998 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-10 15:33:11,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:11,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006004986] [2024-11-10 15:33:11,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006004986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:11,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:11,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896463116] [2024-11-10 15:33:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:11,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:12,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:12,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:12,001 INFO L87 Difference]: Start difference. First operand 1303 states and 2101 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:12,020 INFO L93 Difference]: Finished difference Result 2378 states and 3879 transitions. [2024-11-10 15:33:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-10 15:33:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:12,029 INFO L225 Difference]: With dead ends: 2378 [2024-11-10 15:33:12,029 INFO L226 Difference]: Without dead ends: 2378 [2024-11-10 15:33:12,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:12,031 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 50 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:12,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2024-11-10 15:33:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1831. [2024-11-10 15:33:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1830 states have (on average 1.5765027322404372) internal successors, (2885), 1830 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2885 transitions. [2024-11-10 15:33:12,075 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2885 transitions. Word has length 27 [2024-11-10 15:33:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:12,076 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2885 transitions. [2024-11-10 15:33:12,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2885 transitions. [2024-11-10 15:33:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:33:12,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:12,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:12,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:33:12,079 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:12,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1727973414, now seen corresponding path program 1 times [2024-11-10 15:33:12,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:12,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826255952] [2024-11-10 15:33:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:12,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:12,114 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-10 15:33:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:12,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826255952] [2024-11-10 15:33:12,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826255952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:12,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:12,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694581638] [2024-11-10 15:33:12,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:12,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:12,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:12,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:12,117 INFO L87 Difference]: Start difference. First operand 1831 states and 2885 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:12,149 INFO L93 Difference]: Finished difference Result 2538 states and 3975 transitions. [2024-11-10 15:33:12,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-10 15:33:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:12,158 INFO L225 Difference]: With dead ends: 2538 [2024-11-10 15:33:12,158 INFO L226 Difference]: Without dead ends: 2538 [2024-11-10 15:33:12,159 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-10 15:33:12,159 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 195 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-10 15:33:12,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2024-11-10 15:33:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2535. [2024-11-10 15:33:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2534 states have (on average 1.5678768745067087) internal successors, (3973), 2534 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3973 transitions. [2024-11-10 15:33:12,208 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3973 transitions. Word has length 27 [2024-11-10 15:33:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:12,208 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 3973 transitions. [2024-11-10 15:33:12,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3973 transitions. [2024-11-10 15:33:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:33:12,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:12,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:12,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:33:12,211 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:12,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1269477099, now seen corresponding path program 1 times [2024-11-10 15:33:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422942219] [2024-11-10 15:33:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:12,239 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-10 15:33:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422942219] [2024-11-10 15:33:12,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422942219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:12,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506859781] [2024-11-10 15:33:12,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:12,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:12,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:12,242 INFO L87 Difference]: Start difference. First operand 2535 states and 3973 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:12,263 INFO L93 Difference]: Finished difference Result 2570 states and 3975 transitions. [2024-11-10 15:33:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 15:33:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:12,271 INFO L225 Difference]: With dead ends: 2570 [2024-11-10 15:33:12,272 INFO L226 Difference]: Without dead ends: 2570 [2024-11-10 15:33:12,272 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-10 15:33:12,273 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 194 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-10 15:33:12,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 194 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2024-11-10 15:33:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2567. [2024-11-10 15:33:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2566 states have (on average 1.5483242400623538) internal successors, (3973), 2566 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3973 transitions. [2024-11-10 15:33:12,318 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3973 transitions. Word has length 28 [2024-11-10 15:33:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:12,318 INFO L471 AbstractCegarLoop]: Abstraction has 2567 states and 3973 transitions. [2024-11-10 15:33:12,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3973 transitions. [2024-11-10 15:33:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:33:12,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:12,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:12,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:33:12,322 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2028417844, now seen corresponding path program 1 times [2024-11-10 15:33:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468481132] [2024-11-10 15:33:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:12,350 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-10 15:33:12,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468481132] [2024-11-10 15:33:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468481132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:12,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:12,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:12,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812056511] [2024-11-10 15:33:12,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:12,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:12,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:12,353 INFO L87 Difference]: Start difference. First operand 2567 states and 3973 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:12,377 INFO L93 Difference]: Finished difference Result 4618 states and 7239 transitions. [2024-11-10 15:33:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:12,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 15:33:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:12,393 INFO L225 Difference]: With dead ends: 4618 [2024-11-10 15:33:12,393 INFO L226 Difference]: Without dead ends: 4618 [2024-11-10 15:33:12,394 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-10 15:33:12,394 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 47 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 157 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-10 15:33:12,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2024-11-10 15:33:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 3655. [2024-11-10 15:33:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 3654 states have (on average 1.5076628352490422) internal successors, (5509), 3654 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 5509 transitions. [2024-11-10 15:33:12,469 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 5509 transitions. Word has length 28 [2024-11-10 15:33:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:12,469 INFO L471 AbstractCegarLoop]: Abstraction has 3655 states and 5509 transitions. [2024-11-10 15:33:12,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 5509 transitions. [2024-11-10 15:33:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:33:12,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:12,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:33:12,475 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:12,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -913239755, now seen corresponding path program 1 times [2024-11-10 15:33:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228209948] [2024-11-10 15:33:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:12,498 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-10 15:33:12,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:12,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228209948] [2024-11-10 15:33:12,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228209948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:12,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:12,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092717781] [2024-11-10 15:33:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:12,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:12,501 INFO L87 Difference]: Start difference. First operand 3655 states and 5509 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:12,532 INFO L93 Difference]: Finished difference Result 5002 states and 7495 transitions. [2024-11-10 15:33:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 15:33:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:12,550 INFO L225 Difference]: With dead ends: 5002 [2024-11-10 15:33:12,551 INFO L226 Difference]: Without dead ends: 5002 [2024-11-10 15:33:12,551 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-10 15:33:12,551 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 196 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-10 15:33:12,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2024-11-10 15:33:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4999. [2024-11-10 15:33:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4999 states, 4998 states have (on average 1.4991996798719487) internal successors, (7493), 4998 states have internal predecessors, (7493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 7493 transitions. [2024-11-10 15:33:12,682 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 7493 transitions. Word has length 28 [2024-11-10 15:33:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:12,682 INFO L471 AbstractCegarLoop]: Abstraction has 4999 states and 7493 transitions. [2024-11-10 15:33:12,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 7493 transitions. [2024-11-10 15:33:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:33:12,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:12,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:12,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 15:33:12,689 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1542713441, now seen corresponding path program 1 times [2024-11-10 15:33:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299979318] [2024-11-10 15:33:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:12,716 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-10 15:33:12,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:12,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299979318] [2024-11-10 15:33:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299979318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:12,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:12,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173084329] [2024-11-10 15:33:12,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:12,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:12,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:12,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:12,718 INFO L87 Difference]: Start difference. First operand 4999 states and 7493 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:12,745 INFO L93 Difference]: Finished difference Result 5066 states and 7495 transitions. [2024-11-10 15:33:12,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:12,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 15:33:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:12,755 INFO L225 Difference]: With dead ends: 5066 [2024-11-10 15:33:12,755 INFO L226 Difference]: Without dead ends: 5066 [2024-11-10 15:33:12,756 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-10 15:33:12,756 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 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-10 15:33:12,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2024-11-10 15:33:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 5063. [2024-11-10 15:33:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5062 states have (on average 1.4802449624654286) internal successors, (7493), 5062 states have internal predecessors, (7493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7493 transitions. [2024-11-10 15:33:12,835 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7493 transitions. Word has length 29 [2024-11-10 15:33:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:12,836 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 7493 transitions. [2024-11-10 15:33:12,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7493 transitions. [2024-11-10 15:33:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:33:12,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:12,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 15:33:12,842 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1755181502, now seen corresponding path program 1 times [2024-11-10 15:33:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:12,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456708951] [2024-11-10 15:33:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:12,866 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-10 15:33:12,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456708951] [2024-11-10 15:33:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456708951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:12,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111876160] [2024-11-10 15:33:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:12,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:12,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:12,869 INFO L87 Difference]: Start difference. First operand 5063 states and 7493 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:12,902 INFO L93 Difference]: Finished difference Result 8970 states and 13447 transitions. [2024-11-10 15:33:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:12,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 15:33:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:12,918 INFO L225 Difference]: With dead ends: 8970 [2024-11-10 15:33:12,919 INFO L226 Difference]: Without dead ends: 8970 [2024-11-10 15:33:12,919 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-10 15:33:12,920 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 155 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-10 15:33:12,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8970 states. [2024-11-10 15:33:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8970 to 7303. [2024-11-10 15:33:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7303 states, 7302 states have (on average 1.438099150917557) internal successors, (10501), 7302 states have internal predecessors, (10501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 10501 transitions. [2024-11-10 15:33:13,057 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 10501 transitions. Word has length 29 [2024-11-10 15:33:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:13,057 INFO L471 AbstractCegarLoop]: Abstraction has 7303 states and 10501 transitions. [2024-11-10 15:33:13,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 10501 transitions. [2024-11-10 15:33:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:33:13,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:13,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:13,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:33:13,068 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1186476097, now seen corresponding path program 1 times [2024-11-10 15:33:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260039049] [2024-11-10 15:33:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:13,093 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-10 15:33:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260039049] [2024-11-10 15:33:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260039049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:13,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804181590] [2024-11-10 15:33:13,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:13,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:13,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:13,096 INFO L87 Difference]: Start difference. First operand 7303 states and 10501 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:13,131 INFO L93 Difference]: Finished difference Result 9866 states and 14087 transitions. [2024-11-10 15:33:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:13,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 15:33:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:13,148 INFO L225 Difference]: With dead ends: 9866 [2024-11-10 15:33:13,149 INFO L226 Difference]: Without dead ends: 9866 [2024-11-10 15:33:13,149 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-10 15:33:13,151 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 197 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-10 15:33:13,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9866 states. [2024-11-10 15:33:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9866 to 9863. [2024-11-10 15:33:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9863 states, 9862 states have (on average 1.4282092881768405) internal successors, (14085), 9862 states have internal predecessors, (14085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 14085 transitions. [2024-11-10 15:33:13,366 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 14085 transitions. Word has length 29 [2024-11-10 15:33:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:13,366 INFO L471 AbstractCegarLoop]: Abstraction has 9863 states and 14085 transitions. [2024-11-10 15:33:13,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 14085 transitions. [2024-11-10 15:33:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:33:13,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:13,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:13,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 15:33:13,378 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1423112178, now seen corresponding path program 1 times [2024-11-10 15:33:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559805332] [2024-11-10 15:33:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:13,417 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-10 15:33:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559805332] [2024-11-10 15:33:13,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559805332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:13,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:13,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738044558] [2024-11-10 15:33:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:13,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:13,420 INFO L87 Difference]: Start difference. First operand 9863 states and 14085 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:13,463 INFO L93 Difference]: Finished difference Result 9994 states and 14087 transitions. [2024-11-10 15:33:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 15:33:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:13,482 INFO L225 Difference]: With dead ends: 9994 [2024-11-10 15:33:13,482 INFO L226 Difference]: Without dead ends: 9994 [2024-11-10 15:33:13,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:13,483 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 186 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-10 15:33:13,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9994 states. [2024-11-10 15:33:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9994 to 9991. [2024-11-10 15:33:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9991 states, 9990 states have (on average 1.40990990990991) internal successors, (14085), 9990 states have internal predecessors, (14085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9991 states to 9991 states and 14085 transitions. [2024-11-10 15:33:13,628 INFO L78 Accepts]: Start accepts. Automaton has 9991 states and 14085 transitions. Word has length 30 [2024-11-10 15:33:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:13,628 INFO L471 AbstractCegarLoop]: Abstraction has 9991 states and 14085 transitions. [2024-11-10 15:33:13,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9991 states and 14085 transitions. [2024-11-10 15:33:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:33:13,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:13,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:13,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 15:33:13,638 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1874782765, now seen corresponding path program 1 times [2024-11-10 15:33:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:13,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138298288] [2024-11-10 15:33:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:13,667 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-10 15:33:13,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:13,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138298288] [2024-11-10 15:33:13,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138298288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:13,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:13,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117634752] [2024-11-10 15:33:13,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:13,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:13,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:13,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:13,669 INFO L87 Difference]: Start difference. First operand 9991 states and 14085 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:13,778 INFO L93 Difference]: Finished difference Result 17418 states and 24839 transitions. [2024-11-10 15:33:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 15:33:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:13,811 INFO L225 Difference]: With dead ends: 17418 [2024-11-10 15:33:13,811 INFO L226 Difference]: Without dead ends: 17418 [2024-11-10 15:33:13,812 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-10 15:33:13,813 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 153 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-10 15:33:13,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2024-11-10 15:33:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 14599. [2024-11-10 15:33:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14599 states, 14598 states have (on average 1.3682011234415674) internal successors, (19973), 14598 states have internal predecessors, (19973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14599 states to 14599 states and 19973 transitions. [2024-11-10 15:33:14,015 INFO L78 Accepts]: Start accepts. Automaton has 14599 states and 19973 transitions. Word has length 30 [2024-11-10 15:33:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:14,015 INFO L471 AbstractCegarLoop]: Abstraction has 14599 states and 19973 transitions. [2024-11-10 15:33:14,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 14599 states and 19973 transitions. [2024-11-10 15:33:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:33:14,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:14,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:14,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 15:33:14,032 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1066874834, now seen corresponding path program 1 times [2024-11-10 15:33:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527292496] [2024-11-10 15:33:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:14,055 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-10 15:33:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527292496] [2024-11-10 15:33:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527292496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:14,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:14,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109263180] [2024-11-10 15:33:14,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:14,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:14,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:14,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:14,056 INFO L87 Difference]: Start difference. First operand 14599 states and 19973 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:14,191 INFO L93 Difference]: Finished difference Result 19466 states and 26375 transitions. [2024-11-10 15:33:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 15:33:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:14,220 INFO L225 Difference]: With dead ends: 19466 [2024-11-10 15:33:14,220 INFO L226 Difference]: Without dead ends: 19466 [2024-11-10 15:33:14,221 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-10 15:33:14,222 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 198 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-10 15:33:14,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 198 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19466 states. [2024-11-10 15:33:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19466 to 19463. [2024-11-10 15:33:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19463 states, 19462 states have (on average 1.355102250539513) internal successors, (26373), 19462 states have internal predecessors, (26373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19463 states to 19463 states and 26373 transitions. [2024-11-10 15:33:14,533 INFO L78 Accepts]: Start accepts. Automaton has 19463 states and 26373 transitions. Word has length 30 [2024-11-10 15:33:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:14,533 INFO L471 AbstractCegarLoop]: Abstraction has 19463 states and 26373 transitions. [2024-11-10 15:33:14,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 19463 states and 26373 transitions. [2024-11-10 15:33:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:33:14,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:14,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:14,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 15:33:14,551 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:14,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2010447048, now seen corresponding path program 1 times [2024-11-10 15:33:14,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:14,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890890558] [2024-11-10 15:33:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:14,572 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-10 15:33:14,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890890558] [2024-11-10 15:33:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890890558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:14,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:14,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295661424] [2024-11-10 15:33:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:14,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:14,574 INFO L87 Difference]: Start difference. First operand 19463 states and 26373 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:14,639 INFO L93 Difference]: Finished difference Result 19722 states and 26375 transitions. [2024-11-10 15:33:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:14,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-10 15:33:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:14,671 INFO L225 Difference]: With dead ends: 19722 [2024-11-10 15:33:14,671 INFO L226 Difference]: Without dead ends: 19722 [2024-11-10 15:33:14,671 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-10 15:33:14,672 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 182 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-10 15:33:14,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19722 states. [2024-11-10 15:33:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19722 to 19719. [2024-11-10 15:33:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19719 states, 19718 states have (on average 1.3375088751394664) internal successors, (26373), 19718 states have internal predecessors, (26373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19719 states to 19719 states and 26373 transitions. [2024-11-10 15:33:15,048 INFO L78 Accepts]: Start accepts. Automaton has 19719 states and 26373 transitions. Word has length 31 [2024-11-10 15:33:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:15,048 INFO L471 AbstractCegarLoop]: Abstraction has 19719 states and 26373 transitions. [2024-11-10 15:33:15,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 19719 states and 26373 transitions. [2024-11-10 15:33:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:33:15,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:15,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:15,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 15:33:15,068 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:15,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1287447895, now seen corresponding path program 1 times [2024-11-10 15:33:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809790491] [2024-11-10 15:33:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:15,095 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-10 15:33:15,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809790491] [2024-11-10 15:33:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809790491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:15,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:15,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:15,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31342079] [2024-11-10 15:33:15,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:15,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:15,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:15,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:15,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:15,097 INFO L87 Difference]: Start difference. First operand 19719 states and 26373 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:15,331 INFO L93 Difference]: Finished difference Result 33802 states and 45575 transitions. [2024-11-10 15:33:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:15,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-10 15:33:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:15,388 INFO L225 Difference]: With dead ends: 33802 [2024-11-10 15:33:15,388 INFO L226 Difference]: Without dead ends: 33802 [2024-11-10 15:33:15,389 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-10 15:33:15,389 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 38 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 151 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-10 15:33:15,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33802 states. [2024-11-10 15:33:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33802 to 29191. [2024-11-10 15:33:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29191 states, 29190 states have (on average 1.2981500513874615) internal successors, (37893), 29190 states have internal predecessors, (37893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29191 states to 29191 states and 37893 transitions. [2024-11-10 15:33:15,814 INFO L78 Accepts]: Start accepts. Automaton has 29191 states and 37893 transitions. Word has length 31 [2024-11-10 15:33:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:15,815 INFO L471 AbstractCegarLoop]: Abstraction has 29191 states and 37893 transitions. [2024-11-10 15:33:15,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 29191 states and 37893 transitions. [2024-11-10 15:33:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:33:15,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:15,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:15,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 15:33:15,839 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:15,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1654209704, now seen corresponding path program 1 times [2024-11-10 15:33:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:15,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041745752] [2024-11-10 15:33:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:15,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:15,862 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-10 15:33:15,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041745752] [2024-11-10 15:33:15,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041745752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:15,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:15,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425219938] [2024-11-10 15:33:15,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:15,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:15,864 INFO L87 Difference]: Start difference. First operand 29191 states and 37893 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:15,964 INFO L93 Difference]: Finished difference Result 38410 states and 49159 transitions. [2024-11-10 15:33:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:15,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-10 15:33:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:16,026 INFO L225 Difference]: With dead ends: 38410 [2024-11-10 15:33:16,027 INFO L226 Difference]: Without dead ends: 38410 [2024-11-10 15:33:16,027 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-10 15:33:16,027 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 199 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-10 15:33:16,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38410 states. [2024-11-10 15:33:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38410 to 38407. [2024-11-10 15:33:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38407 states, 38406 states have (on average 1.2799302192365776) internal successors, (49157), 38406 states have internal predecessors, (49157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38407 states to 38407 states and 49157 transitions. [2024-11-10 15:33:16,792 INFO L78 Accepts]: Start accepts. Automaton has 38407 states and 49157 transitions. Word has length 31 [2024-11-10 15:33:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:16,792 INFO L471 AbstractCegarLoop]: Abstraction has 38407 states and 49157 transitions. [2024-11-10 15:33:16,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 38407 states and 49157 transitions. [2024-11-10 15:33:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:33:16,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:16,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:16,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 15:33:16,806 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:16,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1257001735, now seen corresponding path program 1 times [2024-11-10 15:33:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:16,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211394876] [2024-11-10 15:33:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211394876] [2024-11-10 15:33:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211394876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:16,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:16,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:16,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061795762] [2024-11-10 15:33:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:16,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:16,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:16,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:16,831 INFO L87 Difference]: Start difference. First operand 38407 states and 49157 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:17,143 INFO L93 Difference]: Finished difference Result 38922 states and 49159 transitions. [2024-11-10 15:33:17,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:17,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:33:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:17,247 INFO L225 Difference]: With dead ends: 38922 [2024-11-10 15:33:17,247 INFO L226 Difference]: Without dead ends: 38922 [2024-11-10 15:33:17,249 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-10 15:33:17,249 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 178 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:17,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:33:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2024-11-10 15:33:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 38919. [2024-11-10 15:33:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38919 states, 38918 states have (on average 1.2630916285523408) internal successors, (49157), 38918 states have internal predecessors, (49157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38919 states to 38919 states and 49157 transitions. [2024-11-10 15:33:17,677 INFO L78 Accepts]: Start accepts. Automaton has 38919 states and 49157 transitions. Word has length 32 [2024-11-10 15:33:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:17,677 INFO L471 AbstractCegarLoop]: Abstraction has 38919 states and 49157 transitions. [2024-11-10 15:33:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 38919 states and 49157 transitions. [2024-11-10 15:33:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:33:17,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:17,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:17,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 15:33:17,834 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:17,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:17,836 INFO L85 PathProgramCache]: Analyzing trace with hash 259929382, now seen corresponding path program 1 times [2024-11-10 15:33:17,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852673592] [2024-11-10 15:33:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:17,873 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-10 15:33:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852673592] [2024-11-10 15:33:17,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852673592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:17,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:17,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:17,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542593721] [2024-11-10 15:33:17,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:17,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:17,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:17,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:17,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:17,875 INFO L87 Difference]: Start difference. First operand 38919 states and 49157 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:18,092 INFO L93 Difference]: Finished difference Result 65546 states and 82951 transitions. [2024-11-10 15:33:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:18,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:33:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:18,197 INFO L225 Difference]: With dead ends: 65546 [2024-11-10 15:33:18,197 INFO L226 Difference]: Without dead ends: 65546 [2024-11-10 15:33:18,197 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-10 15:33:18,198 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 149 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-10 15:33:18,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65546 states. [2024-11-10 15:33:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65546 to 58375. [2024-11-10 15:33:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58375 states, 58374 states have (on average 1.2280296022201664) internal successors, (71685), 58374 states have internal predecessors, (71685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58375 states to 58375 states and 71685 transitions. [2024-11-10 15:33:18,940 INFO L78 Accepts]: Start accepts. Automaton has 58375 states and 71685 transitions. Word has length 32 [2024-11-10 15:33:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:18,940 INFO L471 AbstractCegarLoop]: Abstraction has 58375 states and 71685 transitions. [2024-11-10 15:33:18,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 58375 states and 71685 transitions. [2024-11-10 15:33:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:33:18,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:18,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:18,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 15:33:18,976 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:18,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:18,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1613239079, now seen corresponding path program 1 times [2024-11-10 15:33:18,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:18,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231137569] [2024-11-10 15:33:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:18,996 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-10 15:33:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231137569] [2024-11-10 15:33:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231137569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612970247] [2024-11-10 15:33:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:18,999 INFO L87 Difference]: Start difference. First operand 58375 states and 71685 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:19,453 INFO L93 Difference]: Finished difference Result 75786 states and 91143 transitions. [2024-11-10 15:33:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:19,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:33:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:19,564 INFO L225 Difference]: With dead ends: 75786 [2024-11-10 15:33:19,564 INFO L226 Difference]: Without dead ends: 75786 [2024-11-10 15:33:19,564 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-10 15:33:19,565 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 200 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-10 15:33:19,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 200 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2024-11-10 15:33:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 75783. [2024-11-10 15:33:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75783 states, 75782 states have (on average 1.202673458077116) internal successors, (91141), 75782 states have internal predecessors, (91141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75783 states to 75783 states and 91141 transitions. [2024-11-10 15:33:20,575 INFO L78 Accepts]: Start accepts. Automaton has 75783 states and 91141 transitions. Word has length 32 [2024-11-10 15:33:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:20,575 INFO L471 AbstractCegarLoop]: Abstraction has 75783 states and 91141 transitions. [2024-11-10 15:33:20,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 75783 states and 91141 transitions. [2024-11-10 15:33:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:33:20,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:20,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:20,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 15:33:20,623 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:20,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash -531307823, now seen corresponding path program 1 times [2024-11-10 15:33:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:20,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159085451] [2024-11-10 15:33:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:20,658 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-10 15:33:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159085451] [2024-11-10 15:33:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159085451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341522284] [2024-11-10 15:33:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:20,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:20,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:20,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:20,661 INFO L87 Difference]: Start difference. First operand 75783 states and 91141 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:21,183 INFO L93 Difference]: Finished difference Result 76810 states and 91143 transitions. [2024-11-10 15:33:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-10 15:33:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:21,272 INFO L225 Difference]: With dead ends: 76810 [2024-11-10 15:33:21,272 INFO L226 Difference]: Without dead ends: 76810 [2024-11-10 15:33:21,272 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-10 15:33:21,273 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 174 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-10 15:33:21,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76810 states. [2024-11-10 15:33:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76810 to 76807. [2024-11-10 15:33:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76807 states, 76806 states have (on average 1.1866390646564071) internal successors, (91141), 76806 states have internal predecessors, (91141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76807 states to 76807 states and 91141 transitions. [2024-11-10 15:33:22,110 INFO L78 Accepts]: Start accepts. Automaton has 76807 states and 91141 transitions. Word has length 33 [2024-11-10 15:33:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:22,110 INFO L471 AbstractCegarLoop]: Abstraction has 76807 states and 91141 transitions. [2024-11-10 15:33:22,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 76807 states and 91141 transitions. [2024-11-10 15:33:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:33:22,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:22,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:22,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 15:33:22,140 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:22,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1528380176, now seen corresponding path program 1 times [2024-11-10 15:33:22,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:22,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815396160] [2024-11-10 15:33:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815396160] [2024-11-10 15:33:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815396160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:22,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:22,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008064149] [2024-11-10 15:33:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:22,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:22,166 INFO L87 Difference]: Start difference. First operand 76807 states and 91141 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:22,389 INFO L93 Difference]: Finished difference Result 126986 states and 149511 transitions. [2024-11-10 15:33:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:22,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-10 15:33:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:22,538 INFO L225 Difference]: With dead ends: 126986 [2024-11-10 15:33:22,538 INFO L226 Difference]: Without dead ends: 126986 [2024-11-10 15:33:22,538 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-10 15:33:22,538 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 32 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 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-10 15:33:22,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126986 states. [2024-11-10 15:33:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126986 to 116743. [2024-11-10 15:33:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116743 states, 116742 states have (on average 1.157878055883915) internal successors, (135173), 116742 states have internal predecessors, (135173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116743 states to 116743 states and 135173 transitions. [2024-11-10 15:33:24,357 INFO L78 Accepts]: Start accepts. Automaton has 116743 states and 135173 transitions. Word has length 33 [2024-11-10 15:33:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:24,358 INFO L471 AbstractCegarLoop]: Abstraction has 116743 states and 135173 transitions. [2024-11-10 15:33:24,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 116743 states and 135173 transitions. [2024-11-10 15:33:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:33:24,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:24,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:24,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 15:33:24,449 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash -175070479, now seen corresponding path program 1 times [2024-11-10 15:33:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:24,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835421009] [2024-11-10 15:33:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:24,473 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-10 15:33:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835421009] [2024-11-10 15:33:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835421009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:24,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:24,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72155208] [2024-11-10 15:33:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:24,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:24,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:24,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:24,476 INFO L87 Difference]: Start difference. First operand 116743 states and 135173 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,381 INFO L93 Difference]: Finished difference Result 149514 states and 167943 transitions. [2024-11-10 15:33:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-10 15:33:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,683 INFO L225 Difference]: With dead ends: 149514 [2024-11-10 15:33:25,683 INFO L226 Difference]: Without dead ends: 149514 [2024-11-10 15:33:25,683 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-10 15:33:25,684 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149514 states. [2024-11-10 15:33:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149514 to 149511. [2024-11-10 15:33:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149511 states, 149510 states have (on average 1.1232760350478228) internal successors, (167941), 149510 states have internal predecessors, (167941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149511 states to 149511 states and 167941 transitions. [2024-11-10 15:33:27,590 INFO L78 Accepts]: Start accepts. Automaton has 149511 states and 167941 transitions. Word has length 33 [2024-11-10 15:33:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:27,590 INFO L471 AbstractCegarLoop]: Abstraction has 149511 states and 167941 transitions. [2024-11-10 15:33:27,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 149511 states and 167941 transitions. [2024-11-10 15:33:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:33:27,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:27,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:27,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 15:33:27,707 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:27,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:27,707 INFO L85 PathProgramCache]: Analyzing trace with hash -134336000, now seen corresponding path program 1 times [2024-11-10 15:33:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:27,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090377474] [2024-11-10 15:33:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090377474] [2024-11-10 15:33:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090377474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:27,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:27,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652377910] [2024-11-10 15:33:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:27,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:27,750 INFO L87 Difference]: Start difference. First operand 149511 states and 167941 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:28,160 INFO L93 Difference]: Finished difference Result 151562 states and 167943 transitions. [2024-11-10 15:33:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:28,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-10 15:33:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:28,320 INFO L225 Difference]: With dead ends: 151562 [2024-11-10 15:33:28,320 INFO L226 Difference]: Without dead ends: 151562 [2024-11-10 15:33:28,321 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-10 15:33:28,321 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 170 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-10 15:33:28,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151562 states. [2024-11-10 15:33:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151562 to 151559. [2024-11-10 15:33:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151559 states, 151558 states have (on average 1.1080972301033267) internal successors, (167941), 151558 states have internal predecessors, (167941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151559 states to 151559 states and 167941 transitions. [2024-11-10 15:33:30,798 INFO L78 Accepts]: Start accepts. Automaton has 151559 states and 167941 transitions. Word has length 34 [2024-11-10 15:33:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:30,798 INFO L471 AbstractCegarLoop]: Abstraction has 151559 states and 167941 transitions. [2024-11-10 15:33:30,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 151559 states and 167941 transitions. [2024-11-10 15:33:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:33:30,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:30,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:30,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 15:33:30,858 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:30,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1131408353, now seen corresponding path program 1 times [2024-11-10 15:33:30,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:30,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664030178] [2024-11-10 15:33:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:30,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:30,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664030178] [2024-11-10 15:33:30,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664030178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:30,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:30,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379832653] [2024-11-10 15:33:30,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:30,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:30,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:30,881 INFO L87 Difference]: Start difference. First operand 151559 states and 167941 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:31,297 INFO L93 Difference]: Finished difference Result 245767 states and 266245 transitions. [2024-11-10 15:33:31,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:31,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-10 15:33:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:31,623 INFO L225 Difference]: With dead ends: 245767 [2024-11-10 15:33:31,624 INFO L226 Difference]: Without dead ends: 245767 [2024-11-10 15:33:31,624 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-10 15:33:31,624 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 27 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 143 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-10 15:33:31,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245767 states. [2024-11-10 15:33:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245767 to 233479. [2024-11-10 15:33:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233479 states, 233478 states have (on average 1.0877127609453567) internal successors, (253957), 233478 states have internal predecessors, (253957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233479 states to 233479 states and 253957 transitions. [2024-11-10 15:33:35,096 INFO L78 Accepts]: Start accepts. Automaton has 233479 states and 253957 transitions. Word has length 34 [2024-11-10 15:33:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:35,097 INFO L471 AbstractCegarLoop]: Abstraction has 233479 states and 253957 transitions. [2024-11-10 15:33:35,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 233479 states and 253957 transitions. [2024-11-10 15:33:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:33:35,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:35,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:35,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 15:33:35,340 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:35,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash 221901344, now seen corresponding path program 1 times [2024-11-10 15:33:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:35,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798769696] [2024-11-10 15:33:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:35,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798769696] [2024-11-10 15:33:35,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798769696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:35,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636305487] [2024-11-10 15:33:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:35,365 INFO L87 Difference]: Start difference. First operand 233479 states and 253957 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:37,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:37,036 INFO L93 Difference]: Finished difference Result 294916 states and 307203 transitions. [2024-11-10 15:33:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:37,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-10 15:33:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:37,039 INFO L225 Difference]: With dead ends: 294916 [2024-11-10 15:33:37,039 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:33:37,039 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-10 15:33:37,039 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 51 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 198 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-10 15:33:37,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 198 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:33:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:33:37,040 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-10 15:33:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:33:37,040 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-11-10 15:33:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:37,040 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:33:37,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:33:37,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:33:37,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-10 15:33:37,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-10 15:33:37,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 15:33:37,059 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:37,065 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:33:37,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:33:37 BoogieIcfgContainer [2024-11-10 15:33:37,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:33:37,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:33:37,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:33:37,074 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:33:37,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:10" (3/4) ... [2024-11-10 15:33:37,077 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:33:37,097 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-10 15:33:37,099 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 15:33:37,099 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 15:33:37,100 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 15:33:37,217 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:33:37,218 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:33:37,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:33:37,219 INFO L158 Benchmark]: Toolchain (without parser) took 28025.31ms. Allocated memory was 186.6MB in the beginning and 14.6GB in the end (delta: 14.5GB). Free memory was 113.5MB in the beginning and 11.8GB in the end (delta: -11.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-10 15:33:37,219 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:33:37,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.55ms. Allocated memory is still 186.6MB. Free memory was 113.3MB in the beginning and 156.7MB in the end (delta: -43.5MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-10 15:33:37,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.17ms. Allocated memory is still 186.6MB. Free memory was 156.7MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:33:37,220 INFO L158 Benchmark]: Boogie Preprocessor took 31.31ms. Allocated memory is still 186.6MB. Free memory was 154.7MB in the beginning and 153.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:33:37,220 INFO L158 Benchmark]: IcfgBuilder took 462.28ms. Allocated memory is still 186.6MB. Free memory was 153.6MB in the beginning and 134.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 15:33:37,220 INFO L158 Benchmark]: TraceAbstraction took 27043.56ms. Allocated memory was 186.6MB in the beginning and 14.6GB in the end (delta: 14.5GB). Free memory was 134.8MB in the beginning and 11.8GB in the end (delta: -11.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-10 15:33:37,220 INFO L158 Benchmark]: Witness Printer took 144.29ms. Allocated memory is still 14.6GB. Free memory was 11.8GB in the beginning and 11.8GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:33:37,222 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.55ms. Allocated memory is still 186.6MB. Free memory was 113.3MB in the beginning and 156.7MB in the end (delta: -43.5MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.17ms. Allocated memory is still 186.6MB. Free memory was 156.7MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.31ms. Allocated memory is still 186.6MB. Free memory was 154.7MB in the beginning and 153.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 462.28ms. Allocated memory is still 186.6MB. Free memory was 153.6MB in the beginning and 134.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27043.56ms. Allocated memory was 186.6MB in the beginning and 14.6GB in the end (delta: 14.5GB). Free memory was 134.8MB in the beginning and 11.8GB in the end (delta: -11.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 144.29ms. Allocated memory is still 14.6GB. Free memory was 11.8GB in the beginning and 11.8GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 27.0s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.9s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2193 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2193 mSDsluCounter, 7067 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2779 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 4288 mSDtfsCounter, 204 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233479occurred in iteration=39, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.9s AutomataMinimizationTime, 40 MinimizatonAttempts, 41037 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1084 NumberOfCodeBlocks, 1084 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1044 ConstructedInterpolants, 0 QuantifiedInterpolants, 2226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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-10 15:33:37,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE