./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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_15-2.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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:45:59,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:45:59,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:45:59,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:45:59,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:45:59,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:45:59,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:45:59,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:45:59,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:45:59,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:45:59,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:45:59,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:45:59,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:45:59,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:45:59,929 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:45:59,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:45:59,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:45:59,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:45:59,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:45:59,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:45:59,931 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:45:59,933 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:45:59,933 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:45:59,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:45:59,934 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:45:59,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:45:59,934 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:45:59,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:45:59,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:45:59,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:45:59,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:45:59,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:45:59,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:45:59,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:45:59,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:45:59,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:45:59,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:45:59,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:45:59,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:45:59,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:45:59,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:45:59,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:45:59,937 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-11-12 13:46:00,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:46:00,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:46:00,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:46:00,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:46:00,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:46:00,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-12 13:46:01,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:46:01,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:46:01,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-12 13:46:01,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad6c7087/abba843bd3c449c1b0596d7e73a02ec2/FLAGed41ce7cc [2024-11-12 13:46:01,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad6c7087/abba843bd3c449c1b0596d7e73a02ec2 [2024-11-12 13:46:01,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:46:01,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:46:01,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:46:01,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:46:01,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:46:01,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c07463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01, skipping insertion in model container [2024-11-12 13:46:01,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:46:01,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:46:01,720 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:46:01,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:46:01,783 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:46:01,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01 WrapperNode [2024-11-12 13:46:01,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:46:01,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:46:01,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:46:01,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:46:01,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,812 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 209 [2024-11-12 13:46:01,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:46:01,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:46:01,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:46:01,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:46:01,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,833 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-12 13:46:01,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:46:01,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:46:01,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:46:01,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:46:01,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (1/1) ... [2024-11-12 13:46:01,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:46:01,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:46:01,874 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-12 13:46:01,876 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-12 13:46:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:46:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:46:01,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:46:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:46:01,962 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:46:01,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:46:02,179 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-12 13:46:02,179 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:46:02,191 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:46:02,192 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 13:46:02,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:46:02 BoogieIcfgContainer [2024-11-12 13:46:02,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:46:02,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:46:02,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:46:02,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:46:02,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:46:01" (1/3) ... [2024-11-12 13:46:02,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e06cf8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:46:02, skipping insertion in model container [2024-11-12 13:46:02,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:46:01" (2/3) ... [2024-11-12 13:46:02,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e06cf8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:46:02, skipping insertion in model container [2024-11-12 13:46:02,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:46:02" (3/3) ... [2024-11-12 13:46:02,199 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2024-11-12 13:46:02,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:46:02,213 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 13:46:02,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:46:02,249 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;@716d78b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:46:02,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 13:46:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:46:02,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:02,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:46:02,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:02,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash 28959894, now seen corresponding path program 1 times [2024-11-12 13:46:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758114551] [2024-11-12 13:46:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:02,377 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-12 13:46:02,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:02,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758114551] [2024-11-12 13:46:02,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758114551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:02,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:02,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:46:02,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3704653] [2024-11-12 13:46:02,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:02,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:46:02,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:46:02,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:46:02,416 INFO L87 Difference]: Start difference. First operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:02,431 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2024-11-12 13:46:02,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:46:02,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:46:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:02,439 INFO L225 Difference]: With dead ends: 57 [2024-11-12 13:46:02,439 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 13:46:02,441 INFO L434 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-12 13:46:02,445 INFO L435 NwaCegarLoop]: 101 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, 101 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-12 13:46:02,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 13:46:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-12 13:46:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 99 transitions. [2024-11-12 13:46:02,470 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 99 transitions. Word has length 5 [2024-11-12 13:46:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:02,470 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 99 transitions. [2024-11-12 13:46:02,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2024-11-12 13:46:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:46:02,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:02,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:46:02,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:46:02,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:02,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash 889700686, now seen corresponding path program 1 times [2024-11-12 13:46:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247907462] [2024-11-12 13:46:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:02,543 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-12 13:46:02,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247907462] [2024-11-12 13:46:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247907462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:02,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:46:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142209563] [2024-11-12 13:46:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:02,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:02,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:02,547 INFO L87 Difference]: Start difference. First operand 55 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:02,559 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2024-11-12 13:46:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:46:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:02,562 INFO L225 Difference]: With dead ends: 54 [2024-11-12 13:46:02,562 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 13:46:02,563 INFO L434 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-12 13:46:02,563 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 98 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-12 13:46:02,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 13:46:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-12 13:46:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 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-12 13:46:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 96 transitions. [2024-11-12 13:46:02,572 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 96 transitions. Word has length 6 [2024-11-12 13:46:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:02,573 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 96 transitions. [2024-11-12 13:46:02,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 96 transitions. [2024-11-12 13:46:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:46:02,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:02,574 INFO L218 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-12 13:46:02,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:46:02,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:02,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1809331837, now seen corresponding path program 1 times [2024-11-12 13:46:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:02,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826814559] [2024-11-12 13:46:02,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:02,669 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-12 13:46:02,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:02,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826814559] [2024-11-12 13:46:02,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826814559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:02,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:02,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:02,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19921234] [2024-11-12 13:46:02,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:02,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:02,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:02,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:02,673 INFO L87 Difference]: Start difference. First operand 52 states and 96 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-12 13:46:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:02,695 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2024-11-12 13:46:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:02,696 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-12 13:46:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:02,697 INFO L225 Difference]: With dead ends: 101 [2024-11-12 13:46:02,697 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 13:46:02,697 INFO L434 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-12 13:46:02,698 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 74 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 190 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-12 13:46:02,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 190 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 13:46:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 68. [2024-11-12 13:46:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 127 transitions. [2024-11-12 13:46:02,710 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 127 transitions. Word has length 23 [2024-11-12 13:46:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:02,710 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 127 transitions. [2024-11-12 13:46:02,710 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-12 13:46:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 127 transitions. [2024-11-12 13:46:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:46:02,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:02,711 INFO L218 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-12 13:46:02,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:46:02,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:02,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash 120388095, now seen corresponding path program 1 times [2024-11-12 13:46:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:02,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913338172] [2024-11-12 13:46:02,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:02,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:02,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913338172] [2024-11-12 13:46:02,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913338172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:02,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:02,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777463557] [2024-11-12 13:46:02,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:02,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:02,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:02,817 INFO L87 Difference]: Start difference. First operand 68 states and 127 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-12 13:46:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:02,841 INFO L93 Difference]: Finished difference Result 101 states and 185 transitions. [2024-11-12 13:46:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:02,842 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-12 13:46:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:02,842 INFO L225 Difference]: With dead ends: 101 [2024-11-12 13:46:02,842 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 13:46:02,843 INFO L434 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-12 13:46:02,843 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 74 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 215 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-12 13:46:02,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 215 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 13:46:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-12 13:46:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 183 transitions. [2024-11-12 13:46:02,852 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 183 transitions. Word has length 23 [2024-11-12 13:46:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:02,853 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 183 transitions. [2024-11-12 13:46:02,853 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-12 13:46:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2024-11-12 13:46:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:46:02,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:02,853 INFO L218 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-12 13:46:02,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:46:02,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:02,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash 261267327, now seen corresponding path program 1 times [2024-11-12 13:46:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:02,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016034706] [2024-11-12 13:46:02,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016034706] [2024-11-12 13:46:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016034706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:02,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375922987] [2024-11-12 13:46:02,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:02,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:02,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:02,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:02,916 INFO L87 Difference]: Start difference. First operand 98 states and 183 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-12 13:46:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:02,935 INFO L93 Difference]: Finished difference Result 104 states and 187 transitions. [2024-11-12 13:46:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:02,936 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-12 13:46:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:02,937 INFO L225 Difference]: With dead ends: 104 [2024-11-12 13:46:02,937 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 13:46:02,937 INFO L434 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-12 13:46:02,938 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 76 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 243 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-12 13:46:02,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 13:46:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-12 13:46:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 185 transitions. [2024-11-12 13:46:02,948 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 185 transitions. Word has length 24 [2024-11-12 13:46:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:02,948 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 185 transitions. [2024-11-12 13:46:02,948 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-12 13:46:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 185 transitions. [2024-11-12 13:46:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:46:02,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:02,952 INFO L218 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-12 13:46:02,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:46:02,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:02,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash -556381123, now seen corresponding path program 1 times [2024-11-12 13:46:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:02,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202955922] [2024-11-12 13:46:02,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:02,988 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-12 13:46:02,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202955922] [2024-11-12 13:46:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202955922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:02,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:02,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166122191] [2024-11-12 13:46:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:02,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:02,990 INFO L87 Difference]: Start difference. First operand 101 states and 185 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-12 13:46:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,005 INFO L93 Difference]: Finished difference Result 193 states and 356 transitions. [2024-11-12 13:46:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,006 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-12 13:46:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,007 INFO L225 Difference]: With dead ends: 193 [2024-11-12 13:46:03,008 INFO L226 Difference]: Without dead ends: 193 [2024-11-12 13:46:03,009 INFO L434 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-12 13:46:03,009 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:03,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-12 13:46:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2024-11-12 13:46:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.849624060150376) internal successors, (246), 133 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 246 transitions. [2024-11-12 13:46:03,018 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 246 transitions. Word has length 24 [2024-11-12 13:46:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,019 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 246 transitions. [2024-11-12 13:46:03,019 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-12 13:46:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 246 transitions. [2024-11-12 13:46:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:46:03,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,020 INFO L218 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-12 13:46:03,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:46:03,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2049642431, now seen corresponding path program 1 times [2024-11-12 13:46:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668785682] [2024-11-12 13:46:03,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:03,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668785682] [2024-11-12 13:46:03,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668785682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440111101] [2024-11-12 13:46:03,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,046 INFO L87 Difference]: Start difference. First operand 134 states and 246 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-12 13:46:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,055 INFO L93 Difference]: Finished difference Result 195 states and 354 transitions. [2024-11-12 13:46:03,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,055 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-12 13:46:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,056 INFO L225 Difference]: With dead ends: 195 [2024-11-12 13:46:03,056 INFO L226 Difference]: Without dead ends: 195 [2024-11-12 13:46:03,056 INFO L434 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-12 13:46:03,057 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 216 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-12 13:46:03,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-12 13:46:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-12 13:46:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 352 transitions. [2024-11-12 13:46:03,063 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 352 transitions. Word has length 24 [2024-11-12 13:46:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,063 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 352 transitions. [2024-11-12 13:46:03,063 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-12 13:46:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 352 transitions. [2024-11-12 13:46:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:46:03,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,064 INFO L218 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-12 13:46:03,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:46:03,064 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash -61379830, now seen corresponding path program 1 times [2024-11-12 13:46:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676536432] [2024-11-12 13:46:03,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,089 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-12 13:46:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676536432] [2024-11-12 13:46:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676536432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042085215] [2024-11-12 13:46:03,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,090 INFO L87 Difference]: Start difference. First operand 192 states and 352 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-12 13:46:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,105 INFO L93 Difference]: Finished difference Result 197 states and 354 transitions. [2024-11-12 13:46:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,105 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-12 13:46:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,106 INFO L225 Difference]: With dead ends: 197 [2024-11-12 13:46:03,106 INFO L226 Difference]: Without dead ends: 197 [2024-11-12 13:46:03,106 INFO L434 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-12 13:46:03,107 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 239 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-12 13:46:03,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 239 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-12 13:46:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-11-12 13:46:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.8238341968911918) internal successors, (352), 193 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 352 transitions. [2024-11-12 13:46:03,115 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 352 transitions. Word has length 25 [2024-11-12 13:46:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,116 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 352 transitions. [2024-11-12 13:46:03,116 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-12 13:46:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 352 transitions. [2024-11-12 13:46:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:46:03,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,121 INFO L218 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-12 13:46:03,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:46:03,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash -879028280, now seen corresponding path program 1 times [2024-11-12 13:46:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13528068] [2024-11-12 13:46:03,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,155 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-12 13:46:03,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13528068] [2024-11-12 13:46:03,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13528068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776469219] [2024-11-12 13:46:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,157 INFO L87 Difference]: Start difference. First operand 194 states and 352 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-12 13:46:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,168 INFO L93 Difference]: Finished difference Result 377 states and 678 transitions. [2024-11-12 13:46:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,169 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-12 13:46:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,170 INFO L225 Difference]: With dead ends: 377 [2024-11-12 13:46:03,170 INFO L226 Difference]: Without dead ends: 377 [2024-11-12 13:46:03,170 INFO L434 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-12 13:46:03,170 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 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-12 13:46:03,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-12 13:46:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2024-11-12 13:46:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.8123324396782843) internal successors, (676), 373 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 676 transitions. [2024-11-12 13:46:03,182 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 676 transitions. Word has length 25 [2024-11-12 13:46:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,183 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 676 transitions. [2024-11-12 13:46:03,183 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-12 13:46:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 676 transitions. [2024-11-12 13:46:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:46:03,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,184 INFO L218 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-12 13:46:03,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:46:03,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash 809915462, now seen corresponding path program 1 times [2024-11-12 13:46:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084183338] [2024-11-12 13:46:03,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,215 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-12 13:46:03,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084183338] [2024-11-12 13:46:03,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084183338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528367968] [2024-11-12 13:46:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,217 INFO L87 Difference]: Start difference. First operand 374 states and 676 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-12 13:46:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,225 INFO L93 Difference]: Finished difference Result 481 states and 874 transitions. [2024-11-12 13:46:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,226 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-12 13:46:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,227 INFO L225 Difference]: With dead ends: 481 [2024-11-12 13:46:03,227 INFO L226 Difference]: Without dead ends: 481 [2024-11-12 13:46:03,227 INFO L434 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-12 13:46:03,228 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 68 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:03,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 263 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-12 13:46:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 374. [2024-11-12 13:46:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.801608579088472) internal successors, (672), 373 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 672 transitions. [2024-11-12 13:46:03,234 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 672 transitions. Word has length 25 [2024-11-12 13:46:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,234 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 672 transitions. [2024-11-12 13:46:03,234 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-12 13:46:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 672 transitions. [2024-11-12 13:46:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:46:03,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,235 INFO L218 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-12 13:46:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:46:03,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1473496534, now seen corresponding path program 1 times [2024-11-12 13:46:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156955137] [2024-11-12 13:46:03,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,270 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-12 13:46:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156955137] [2024-11-12 13:46:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156955137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978404760] [2024-11-12 13:46:03,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,272 INFO L87 Difference]: Start difference. First operand 374 states and 672 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-12 13:46:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,281 INFO L93 Difference]: Finished difference Result 709 states and 1282 transitions. [2024-11-12 13:46:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,281 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-12 13:46:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,284 INFO L225 Difference]: With dead ends: 709 [2024-11-12 13:46:03,284 INFO L226 Difference]: Without dead ends: 709 [2024-11-12 13:46:03,284 INFO L434 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-12 13:46:03,284 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 184 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-12 13:46:03,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-12 13:46:03,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 514. [2024-11-12 13:46:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 1.7777777777777777) internal successors, (912), 513 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 912 transitions. [2024-11-12 13:46:03,293 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 912 transitions. Word has length 26 [2024-11-12 13:46:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,294 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 912 transitions. [2024-11-12 13:46:03,294 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-12 13:46:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 912 transitions. [2024-11-12 13:46:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:46:03,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,296 INFO L218 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-12 13:46:03,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:46:03,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1132527020, now seen corresponding path program 1 times [2024-11-12 13:46:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647772976] [2024-11-12 13:46:03,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647772976] [2024-11-12 13:46:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647772976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281459991] [2024-11-12 13:46:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,316 INFO L87 Difference]: Start difference. First operand 514 states and 912 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-12 13:46:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,328 INFO L93 Difference]: Finished difference Result 733 states and 1294 transitions. [2024-11-12 13:46:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,328 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-12 13:46:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,330 INFO L225 Difference]: With dead ends: 733 [2024-11-12 13:46:03,330 INFO L226 Difference]: Without dead ends: 733 [2024-11-12 13:46:03,330 INFO L434 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-12 13:46:03,331 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 218 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-12 13:46:03,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-12 13:46:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2024-11-12 13:46:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.7722908093278464) internal successors, (1292), 729 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1292 transitions. [2024-11-12 13:46:03,343 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1292 transitions. Word has length 26 [2024-11-12 13:46:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,343 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1292 transitions. [2024-11-12 13:46:03,343 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-12 13:46:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1292 transitions. [2024-11-12 13:46:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:46:03,344 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,344 INFO L218 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-12 13:46:03,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:46:03,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1572834643, now seen corresponding path program 1 times [2024-11-12 13:46:03,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017727037] [2024-11-12 13:46:03,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,372 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-12 13:46:03,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017727037] [2024-11-12 13:46:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017727037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460536294] [2024-11-12 13:46:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,373 INFO L87 Difference]: Start difference. First operand 730 states and 1292 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-12 13:46:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,386 INFO L93 Difference]: Finished difference Result 745 states and 1302 transitions. [2024-11-12 13:46:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,387 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-12 13:46:03,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,389 INFO L225 Difference]: With dead ends: 745 [2024-11-12 13:46:03,389 INFO L226 Difference]: Without dead ends: 745 [2024-11-12 13:46:03,389 INFO L434 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-12 13:46:03,389 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 73 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 231 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-12 13:46:03,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-12 13:46:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 742. [2024-11-12 13:46:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1300 transitions. [2024-11-12 13:46:03,399 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1300 transitions. Word has length 27 [2024-11-12 13:46:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,400 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1300 transitions. [2024-11-12 13:46:03,400 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-12 13:46:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1300 transitions. [2024-11-12 13:46:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:46:03,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,400 INFO L218 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-12 13:46:03,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:46:03,401 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 755186193, now seen corresponding path program 1 times [2024-11-12 13:46:03,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221310993] [2024-11-12 13:46:03,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,428 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-12 13:46:03,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221310993] [2024-11-12 13:46:03,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221310993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967761889] [2024-11-12 13:46:03,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,430 INFO L87 Difference]: Start difference. First operand 742 states and 1300 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-12 13:46:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,444 INFO L93 Difference]: Finished difference Result 1385 states and 2446 transitions. [2024-11-12 13:46:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,445 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-12 13:46:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,448 INFO L225 Difference]: With dead ends: 1385 [2024-11-12 13:46:03,449 INFO L226 Difference]: Without dead ends: 1385 [2024-11-12 13:46:03,449 INFO L434 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-12 13:46:03,450 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 182 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-12 13:46:03,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-12 13:46:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1030. [2024-11-12 13:46:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1772 transitions. [2024-11-12 13:46:03,467 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1772 transitions. Word has length 27 [2024-11-12 13:46:03,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,467 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1772 transitions. [2024-11-12 13:46:03,467 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-12 13:46:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1772 transitions. [2024-11-12 13:46:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:46:03,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,468 INFO L218 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-12 13:46:03,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:46:03,469 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash -933757549, now seen corresponding path program 1 times [2024-11-12 13:46:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096230227] [2024-11-12 13:46:03,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,486 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-12 13:46:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096230227] [2024-11-12 13:46:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096230227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311414890] [2024-11-12 13:46:03,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,488 INFO L87 Difference]: Start difference. First operand 1030 states and 1772 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-12 13:46:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,501 INFO L93 Difference]: Finished difference Result 1449 states and 2486 transitions. [2024-11-12 13:46:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,501 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-12 13:46:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,505 INFO L225 Difference]: With dead ends: 1449 [2024-11-12 13:46:03,505 INFO L226 Difference]: Without dead ends: 1449 [2024-11-12 13:46:03,505 INFO L434 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-12 13:46:03,506 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 219 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-12 13:46:03,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-11-12 13:46:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1446. [2024-11-12 13:46:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2484 transitions. [2024-11-12 13:46:03,545 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2484 transitions. Word has length 27 [2024-11-12 13:46:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,545 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 2484 transitions. [2024-11-12 13:46:03,546 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-12 13:46:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2484 transitions. [2024-11-12 13:46:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:46:03,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,547 INFO L218 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-12 13:46:03,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:46:03,547 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1942533015, now seen corresponding path program 1 times [2024-11-12 13:46:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932939595] [2024-11-12 13:46:03,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,569 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-12 13:46:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932939595] [2024-11-12 13:46:03,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932939595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68863520] [2024-11-12 13:46:03,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,572 INFO L87 Difference]: Start difference. First operand 1446 states and 2484 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-12 13:46:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,587 INFO L93 Difference]: Finished difference Result 1465 states and 2486 transitions. [2024-11-12 13:46:03,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,588 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-12 13:46:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,591 INFO L225 Difference]: With dead ends: 1465 [2024-11-12 13:46:03,591 INFO L226 Difference]: Without dead ends: 1465 [2024-11-12 13:46:03,591 INFO L434 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-12 13:46:03,592 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:03,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2024-11-12 13:46:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1462. [2024-11-12 13:46:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2484 transitions. [2024-11-12 13:46:03,615 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2484 transitions. Word has length 28 [2024-11-12 13:46:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,616 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 2484 transitions. [2024-11-12 13:46:03,616 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-12 13:46:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2484 transitions. [2024-11-12 13:46:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:46:03,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,618 INFO L218 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-12 13:46:03,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:46:03,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1124884565, now seen corresponding path program 1 times [2024-11-12 13:46:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086747214] [2024-11-12 13:46:03,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,643 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-12 13:46:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086747214] [2024-11-12 13:46:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086747214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832666990] [2024-11-12 13:46:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,644 INFO L87 Difference]: Start difference. First operand 1462 states and 2484 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-12 13:46:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,658 INFO L93 Difference]: Finished difference Result 2697 states and 4630 transitions. [2024-11-12 13:46:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,659 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-12 13:46:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,665 INFO L225 Difference]: With dead ends: 2697 [2024-11-12 13:46:03,665 INFO L226 Difference]: Without dead ends: 2697 [2024-11-12 13:46:03,665 INFO L434 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-12 13:46:03,667 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 59 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 180 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-12 13:46:03,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2024-11-12 13:46:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2054. [2024-11-12 13:46:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 3412 transitions. [2024-11-12 13:46:03,697 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 3412 transitions. Word has length 28 [2024-11-12 13:46:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,697 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 3412 transitions. [2024-11-12 13:46:03,698 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-12 13:46:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 3412 transitions. [2024-11-12 13:46:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:46:03,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,699 INFO L218 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-12 13:46:03,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:46:03,700 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash -564059177, now seen corresponding path program 1 times [2024-11-12 13:46:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238718119] [2024-11-12 13:46:03,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,722 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-12 13:46:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238718119] [2024-11-12 13:46:03,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238718119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454469795] [2024-11-12 13:46:03,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,724 INFO L87 Difference]: Start difference. First operand 2054 states and 3412 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-12 13:46:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,739 INFO L93 Difference]: Finished difference Result 2857 states and 4742 transitions. [2024-11-12 13:46:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,740 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-12 13:46:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,746 INFO L225 Difference]: With dead ends: 2857 [2024-11-12 13:46:03,746 INFO L226 Difference]: Without dead ends: 2857 [2024-11-12 13:46:03,747 INFO L434 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-12 13:46:03,747 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 220 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-12 13:46:03,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2024-11-12 13:46:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2854. [2024-11-12 13:46:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4740 transitions. [2024-11-12 13:46:03,808 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4740 transitions. Word has length 28 [2024-11-12 13:46:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,808 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 4740 transitions. [2024-11-12 13:46:03,808 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-12 13:46:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4740 transitions. [2024-11-12 13:46:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:46:03,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,810 INFO L218 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-12 13:46:03,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:46:03,810 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash 518291230, now seen corresponding path program 1 times [2024-11-12 13:46:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740774860] [2024-11-12 13:46:03,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,830 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-12 13:46:03,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740774860] [2024-11-12 13:46:03,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740774860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180079578] [2024-11-12 13:46:03,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,832 INFO L87 Difference]: Start difference. First operand 2854 states and 4740 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-12 13:46:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,849 INFO L93 Difference]: Finished difference Result 2889 states and 4742 transitions. [2024-11-12 13:46:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,850 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-12 13:46:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,856 INFO L225 Difference]: With dead ends: 2889 [2024-11-12 13:46:03,856 INFO L226 Difference]: Without dead ends: 2889 [2024-11-12 13:46:03,856 INFO L434 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-12 13:46:03,857 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:03,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2024-11-12 13:46:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2886. [2024-11-12 13:46:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4740 transitions. [2024-11-12 13:46:03,897 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4740 transitions. Word has length 29 [2024-11-12 13:46:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:03,897 INFO L471 AbstractCegarLoop]: Abstraction has 2886 states and 4740 transitions. [2024-11-12 13:46:03,897 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-12 13:46:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4740 transitions. [2024-11-12 13:46:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:46:03,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:03,899 INFO L218 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-12 13:46:03,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:46:03,899 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash -299357220, now seen corresponding path program 1 times [2024-11-12 13:46:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68383764] [2024-11-12 13:46:03,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:03,925 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-12 13:46:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68383764] [2024-11-12 13:46:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68383764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984222377] [2024-11-12 13:46:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:03,927 INFO L87 Difference]: Start difference. First operand 2886 states and 4740 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-12 13:46:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,948 INFO L93 Difference]: Finished difference Result 5257 states and 8742 transitions. [2024-11-12 13:46:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,948 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-12 13:46:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,960 INFO L225 Difference]: With dead ends: 5257 [2024-11-12 13:46:03,960 INFO L226 Difference]: Without dead ends: 5257 [2024-11-12 13:46:03,960 INFO L434 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-12 13:46:03,961 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 56 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:03,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2024-11-12 13:46:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 4102. [2024-11-12 13:46:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 6564 transitions. [2024-11-12 13:46:04,021 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 6564 transitions. Word has length 29 [2024-11-12 13:46:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:04,021 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 6564 transitions. [2024-11-12 13:46:04,021 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-12 13:46:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 6564 transitions. [2024-11-12 13:46:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:46:04,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:04,025 INFO L218 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-12 13:46:04,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:46:04,026 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:04,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1988300962, now seen corresponding path program 1 times [2024-11-12 13:46:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818462161] [2024-11-12 13:46:04,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:04,071 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-12 13:46:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818462161] [2024-11-12 13:46:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818462161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908146202] [2024-11-12 13:46:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:04,072 INFO L87 Difference]: Start difference. First operand 4102 states and 6564 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-12 13:46:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:04,093 INFO L93 Difference]: Finished difference Result 5641 states and 9030 transitions. [2024-11-12 13:46:04,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:04,094 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-12 13:46:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:04,112 INFO L225 Difference]: With dead ends: 5641 [2024-11-12 13:46:04,115 INFO L226 Difference]: Without dead ends: 5641 [2024-11-12 13:46:04,116 INFO L434 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-12 13:46:04,116 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 221 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-12 13:46:04,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2024-11-12 13:46:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5638. [2024-11-12 13:46:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 9028 transitions. [2024-11-12 13:46:04,194 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 9028 transitions. Word has length 29 [2024-11-12 13:46:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:04,194 INFO L471 AbstractCegarLoop]: Abstraction has 5638 states and 9028 transitions. [2024-11-12 13:46:04,194 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-12 13:46:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 9028 transitions. [2024-11-12 13:46:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:46:04,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:04,198 INFO L218 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-12 13:46:04,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:46:04,198 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:04,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash -683520574, now seen corresponding path program 1 times [2024-11-12 13:46:04,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:04,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036860764] [2024-11-12 13:46:04,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:04,215 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-12 13:46:04,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036860764] [2024-11-12 13:46:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036860764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:04,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:04,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:04,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261099583] [2024-11-12 13:46:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:04,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:04,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:04,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:04,217 INFO L87 Difference]: Start difference. First operand 5638 states and 9028 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-12 13:46:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:04,239 INFO L93 Difference]: Finished difference Result 5705 states and 9030 transitions. [2024-11-12 13:46:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:04,240 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-12 13:46:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:04,247 INFO L225 Difference]: With dead ends: 5705 [2024-11-12 13:46:04,247 INFO L226 Difference]: Without dead ends: 5705 [2024-11-12 13:46:04,247 INFO L434 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-12 13:46:04,247 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 219 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-12 13:46:04,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 219 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2024-11-12 13:46:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 5702. [2024-11-12 13:46:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5702 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 9028 transitions. [2024-11-12 13:46:04,334 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 9028 transitions. Word has length 30 [2024-11-12 13:46:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:04,334 INFO L471 AbstractCegarLoop]: Abstraction has 5702 states and 9028 transitions. [2024-11-12 13:46:04,334 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-12 13:46:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 9028 transitions. [2024-11-12 13:46:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:46:04,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:04,338 INFO L218 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-12 13:46:04,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:46:04,338 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:04,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1501169024, now seen corresponding path program 1 times [2024-11-12 13:46:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:04,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827387145] [2024-11-12 13:46:04,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:04,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:04,361 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-12 13:46:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827387145] [2024-11-12 13:46:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827387145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:04,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:04,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:04,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213804427] [2024-11-12 13:46:04,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:04,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:04,362 INFO L87 Difference]: Start difference. First operand 5702 states and 9028 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-12 13:46:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:04,390 INFO L93 Difference]: Finished difference Result 10249 states and 16454 transitions. [2024-11-12 13:46:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:04,390 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-12 13:46:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:04,405 INFO L225 Difference]: With dead ends: 10249 [2024-11-12 13:46:04,405 INFO L226 Difference]: Without dead ends: 10249 [2024-11-12 13:46:04,405 INFO L434 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-12 13:46:04,406 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:04,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10249 states. [2024-11-12 13:46:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10249 to 8198. [2024-11-12 13:46:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8198 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8198 states to 8198 states and 12612 transitions. [2024-11-12 13:46:04,552 INFO L78 Accepts]: Start accepts. Automaton has 8198 states and 12612 transitions. Word has length 30 [2024-11-12 13:46:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:04,552 INFO L471 AbstractCegarLoop]: Abstraction has 8198 states and 12612 transitions. [2024-11-12 13:46:04,553 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-12 13:46:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8198 states and 12612 transitions. [2024-11-12 13:46:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:46:04,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:04,561 INFO L218 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-12 13:46:04,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:46:04,561 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1104854530, now seen corresponding path program 1 times [2024-11-12 13:46:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:04,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45451245] [2024-11-12 13:46:04,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:04,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:04,580 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-12 13:46:04,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:04,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45451245] [2024-11-12 13:46:04,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45451245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:04,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:04,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:04,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482597248] [2024-11-12 13:46:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:04,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:04,583 INFO L87 Difference]: Start difference. First operand 8198 states and 12612 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-12 13:46:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:04,619 INFO L93 Difference]: Finished difference Result 11145 states and 17158 transitions. [2024-11-12 13:46:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:04,620 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-12 13:46:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:04,636 INFO L225 Difference]: With dead ends: 11145 [2024-11-12 13:46:04,636 INFO L226 Difference]: Without dead ends: 11145 [2024-11-12 13:46:04,636 INFO L434 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-12 13:46:04,637 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 222 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-12 13:46:04,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11145 states. [2024-11-12 13:46:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11145 to 11142. [2024-11-12 13:46:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11142 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11142 states to 11142 states and 17156 transitions. [2024-11-12 13:46:04,768 INFO L78 Accepts]: Start accepts. Automaton has 11142 states and 17156 transitions. Word has length 30 [2024-11-12 13:46:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:04,768 INFO L471 AbstractCegarLoop]: Abstraction has 11142 states and 17156 transitions. [2024-11-12 13:46:04,768 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-12 13:46:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 11142 states and 17156 transitions. [2024-11-12 13:46:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:46:04,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:04,775 INFO L218 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-12 13:46:04,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:46:04,775 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:04,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash 715029737, now seen corresponding path program 1 times [2024-11-12 13:46:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:04,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218014499] [2024-11-12 13:46:04,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:04,791 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-12 13:46:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:04,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218014499] [2024-11-12 13:46:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218014499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:04,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:04,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809994829] [2024-11-12 13:46:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:04,792 INFO L87 Difference]: Start difference. First operand 11142 states and 17156 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-12 13:46:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:04,871 INFO L93 Difference]: Finished difference Result 11273 states and 17158 transitions. [2024-11-12 13:46:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:04,872 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-12 13:46:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:04,887 INFO L225 Difference]: With dead ends: 11273 [2024-11-12 13:46:04,887 INFO L226 Difference]: Without dead ends: 11273 [2024-11-12 13:46:04,887 INFO L434 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-12 13:46:04,888 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:04,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2024-11-12 13:46:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 11270. [2024-11-12 13:46:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11270 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 17156 transitions. [2024-11-12 13:46:04,989 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 17156 transitions. Word has length 31 [2024-11-12 13:46:04,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:04,989 INFO L471 AbstractCegarLoop]: Abstraction has 11270 states and 17156 transitions. [2024-11-12 13:46:04,992 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-12 13:46:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 17156 transitions. [2024-11-12 13:46:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:46:04,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:04,999 INFO L218 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-12 13:46:04,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 13:46:04,999 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:05,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash -102618713, now seen corresponding path program 1 times [2024-11-12 13:46:05,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:05,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289473167] [2024-11-12 13:46:05,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:05,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289473167] [2024-11-12 13:46:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289473167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:05,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:05,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440412851] [2024-11-12 13:46:05,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:05,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:05,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:05,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:05,026 INFO L87 Difference]: Start difference. First operand 11270 states and 17156 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-12 13:46:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:05,122 INFO L93 Difference]: Finished difference Result 19977 states and 30854 transitions. [2024-11-12 13:46:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:05,122 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-12 13:46:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:05,141 INFO L225 Difference]: With dead ends: 19977 [2024-11-12 13:46:05,141 INFO L226 Difference]: Without dead ends: 19977 [2024-11-12 13:46:05,142 INFO L434 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-12 13:46:05,142 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 50 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 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-12 13:46:05,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19977 states. [2024-11-12 13:46:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19977 to 16390. [2024-11-12 13:46:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16390 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16390 states to 16390 states and 24196 transitions. [2024-11-12 13:46:05,318 INFO L78 Accepts]: Start accepts. Automaton has 16390 states and 24196 transitions. Word has length 31 [2024-11-12 13:46:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:05,318 INFO L471 AbstractCegarLoop]: Abstraction has 16390 states and 24196 transitions. [2024-11-12 13:46:05,318 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-12 13:46:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 16390 states and 24196 transitions. [2024-11-12 13:46:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:46:05,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:05,405 INFO L218 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-12 13:46:05,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 13:46:05,405 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:05,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1791562455, now seen corresponding path program 1 times [2024-11-12 13:46:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467637856] [2024-11-12 13:46:05,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:05,441 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-12 13:46:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:05,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467637856] [2024-11-12 13:46:05,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467637856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:05,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:05,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:05,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759036967] [2024-11-12 13:46:05,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:05,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:05,443 INFO L87 Difference]: Start difference. First operand 16390 states and 24196 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-12 13:46:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:05,496 INFO L93 Difference]: Finished difference Result 22025 states and 32518 transitions. [2024-11-12 13:46:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:05,497 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-12 13:46:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:05,519 INFO L225 Difference]: With dead ends: 22025 [2024-11-12 13:46:05,520 INFO L226 Difference]: Without dead ends: 22025 [2024-11-12 13:46:05,520 INFO L434 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-12 13:46:05,521 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 223 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-12 13:46:05,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22025 states. [2024-11-12 13:46:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22025 to 22022. [2024-11-12 13:46:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22022 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22022 states to 22022 states and 32516 transitions. [2024-11-12 13:46:05,806 INFO L78 Accepts]: Start accepts. Automaton has 22022 states and 32516 transitions. Word has length 31 [2024-11-12 13:46:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:05,806 INFO L471 AbstractCegarLoop]: Abstraction has 22022 states and 32516 transitions. [2024-11-12 13:46:05,806 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-12 13:46:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 22022 states and 32516 transitions. [2024-11-12 13:46:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:46:05,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:05,825 INFO L218 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-12 13:46:05,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 13:46:05,826 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:05,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1120426989, now seen corresponding path program 1 times [2024-11-12 13:46:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124505892] [2024-11-12 13:46:05,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:05,845 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-12 13:46:05,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:05,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124505892] [2024-11-12 13:46:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124505892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:05,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:05,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4804934] [2024-11-12 13:46:05,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:05,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:05,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:05,846 INFO L87 Difference]: Start difference. First operand 22022 states and 32516 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-12 13:46:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:05,902 INFO L93 Difference]: Finished difference Result 22281 states and 32518 transitions. [2024-11-12 13:46:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:05,902 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-12 13:46:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:06,001 INFO L225 Difference]: With dead ends: 22281 [2024-11-12 13:46:06,001 INFO L226 Difference]: Without dead ends: 22281 [2024-11-12 13:46:06,001 INFO L434 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-12 13:46:06,001 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:06,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22281 states. [2024-11-12 13:46:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22281 to 22278. [2024-11-12 13:46:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22278 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22278 states to 22278 states and 32516 transitions. [2024-11-12 13:46:06,249 INFO L78 Accepts]: Start accepts. Automaton has 22278 states and 32516 transitions. Word has length 32 [2024-11-12 13:46:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:06,250 INFO L471 AbstractCegarLoop]: Abstraction has 22278 states and 32516 transitions. [2024-11-12 13:46:06,250 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-12 13:46:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 22278 states and 32516 transitions. [2024-11-12 13:46:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:46:06,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:06,260 INFO L218 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-12 13:46:06,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 13:46:06,261 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:06,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash 302778539, now seen corresponding path program 1 times [2024-11-12 13:46:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612938209] [2024-11-12 13:46:06,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:06,275 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-12 13:46:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:06,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612938209] [2024-11-12 13:46:06,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612938209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:06,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:06,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662811499] [2024-11-12 13:46:06,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:06,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:06,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:06,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:06,276 INFO L87 Difference]: Start difference. First operand 22278 states and 32516 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-12 13:46:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:06,344 INFO L93 Difference]: Finished difference Result 38921 states and 57606 transitions. [2024-11-12 13:46:06,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:06,344 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-12 13:46:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:06,394 INFO L225 Difference]: With dead ends: 38921 [2024-11-12 13:46:06,394 INFO L226 Difference]: Without dead ends: 38921 [2024-11-12 13:46:06,395 INFO L434 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-12 13:46:06,395 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:06,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38921 states. [2024-11-12 13:46:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38921 to 32774. [2024-11-12 13:46:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32774 states, 32773 states have (on average 1.4139688157934884) internal successors, (46340), 32773 states have internal predecessors, (46340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32774 states to 32774 states and 46340 transitions. [2024-11-12 13:46:06,969 INFO L78 Accepts]: Start accepts. Automaton has 32774 states and 46340 transitions. Word has length 32 [2024-11-12 13:46:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:06,969 INFO L471 AbstractCegarLoop]: Abstraction has 32774 states and 46340 transitions. [2024-11-12 13:46:06,969 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-12 13:46:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 32774 states and 46340 transitions. [2024-11-12 13:46:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:46:06,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:06,985 INFO L218 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-12 13:46:06,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 13:46:06,985 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:06,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1386165203, now seen corresponding path program 1 times [2024-11-12 13:46:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903525659] [2024-11-12 13:46:06,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:07,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903525659] [2024-11-12 13:46:07,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903525659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920078554] [2024-11-12 13:46:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,002 INFO L87 Difference]: Start difference. First operand 32774 states and 46340 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-12 13:46:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,079 INFO L93 Difference]: Finished difference Result 43529 states and 61446 transitions. [2024-11-12 13:46:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,079 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-12 13:46:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,124 INFO L225 Difference]: With dead ends: 43529 [2024-11-12 13:46:07,124 INFO L226 Difference]: Without dead ends: 43529 [2024-11-12 13:46:07,125 INFO L434 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-12 13:46:07,125 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 224 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-12 13:46:07,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43529 states. [2024-11-12 13:46:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43529 to 43526. [2024-11-12 13:46:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43526 states, 43525 states have (on average 1.411694428489374) internal successors, (61444), 43525 states have internal predecessors, (61444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43526 states to 43526 states and 61444 transitions. [2024-11-12 13:46:07,733 INFO L78 Accepts]: Start accepts. Automaton has 43526 states and 61444 transitions. Word has length 32 [2024-11-12 13:46:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:07,733 INFO L471 AbstractCegarLoop]: Abstraction has 43526 states and 61444 transitions. [2024-11-12 13:46:07,733 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-12 13:46:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 43526 states and 61444 transitions. [2024-11-12 13:46:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:46:07,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:07,752 INFO L218 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-12 13:46:07,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 13:46:07,752 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:07,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 802850484, now seen corresponding path program 1 times [2024-11-12 13:46:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:07,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059881596] [2024-11-12 13:46:07,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:07,770 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-12 13:46:07,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:07,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059881596] [2024-11-12 13:46:07,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059881596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:07,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:07,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:07,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47783822] [2024-11-12 13:46:07,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:07,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:07,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:07,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:07,772 INFO L87 Difference]: Start difference. First operand 43526 states and 61444 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-12 13:46:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:07,856 INFO L93 Difference]: Finished difference Result 44041 states and 61446 transitions. [2024-11-12 13:46:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:07,857 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-12 13:46:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:07,899 INFO L225 Difference]: With dead ends: 44041 [2024-11-12 13:46:07,900 INFO L226 Difference]: Without dead ends: 44041 [2024-11-12 13:46:07,900 INFO L434 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-12 13:46:07,900 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 67 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:07,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44041 states. [2024-11-12 13:46:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44041 to 44038. [2024-11-12 13:46:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44038 states, 44037 states have (on average 1.395281240774803) internal successors, (61444), 44037 states have internal predecessors, (61444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44038 states to 44038 states and 61444 transitions. [2024-11-12 13:46:08,620 INFO L78 Accepts]: Start accepts. Automaton has 44038 states and 61444 transitions. Word has length 33 [2024-11-12 13:46:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,620 INFO L471 AbstractCegarLoop]: Abstraction has 44038 states and 61444 transitions. [2024-11-12 13:46:08,620 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-12 13:46:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 44038 states and 61444 transitions. [2024-11-12 13:46:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:46:08,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,639 INFO L218 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-12 13:46:08,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 13:46:08,639 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash -14797966, now seen corresponding path program 1 times [2024-11-12 13:46:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034888589] [2024-11-12 13:46:08,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,654 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-12 13:46:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034888589] [2024-11-12 13:46:08,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034888589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981572595] [2024-11-12 13:46:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,656 INFO L87 Difference]: Start difference. First operand 44038 states and 61444 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-12 13:46:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:08,793 INFO L93 Difference]: Finished difference Result 86025 states and 116742 transitions. [2024-11-12 13:46:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:08,794 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-12 13:46:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:09,030 INFO L225 Difference]: With dead ends: 86025 [2024-11-12 13:46:09,031 INFO L226 Difference]: Without dead ends: 86025 [2024-11-12 13:46:09,033 INFO L434 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-12 13:46:09,034 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 65 mSDsluCounter, 81 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-12 13:46:09,034 INFO L436 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-12 13:46:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86025 states. [2024-11-12 13:46:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86025 to 86022. [2024-11-12 13:46:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86022 states, 86021 states have (on average 1.357110473024029) internal successors, (116740), 86021 states have internal predecessors, (116740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86022 states to 86022 states and 116740 transitions. [2024-11-12 13:46:09,881 INFO L78 Accepts]: Start accepts. Automaton has 86022 states and 116740 transitions. Word has length 33 [2024-11-12 13:46:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:09,881 INFO L471 AbstractCegarLoop]: Abstraction has 86022 states and 116740 transitions. [2024-11-12 13:46:09,881 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-12 13:46:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 86022 states and 116740 transitions. [2024-11-12 13:46:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:46:09,922 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:09,922 INFO L218 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-12 13:46:09,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-12 13:46:09,923 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:09,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1674145776, now seen corresponding path program 1 times [2024-11-12 13:46:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073993635] [2024-11-12 13:46:09,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:09,954 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-12 13:46:09,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:09,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073993635] [2024-11-12 13:46:09,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073993635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:09,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:09,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:09,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482352834] [2024-11-12 13:46:09,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:09,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:09,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:09,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:09,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:09,956 INFO L87 Difference]: Start difference. First operand 86022 states and 116740 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-12 13:46:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:10,172 INFO L93 Difference]: Finished difference Result 96265 states and 134150 transitions. [2024-11-12 13:46:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:10,176 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-12 13:46:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:10,281 INFO L225 Difference]: With dead ends: 96265 [2024-11-12 13:46:10,281 INFO L226 Difference]: Without dead ends: 96265 [2024-11-12 13:46:10,281 INFO L434 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-12 13:46:10,282 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 44 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:10,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 223 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96265 states. [2024-11-12 13:46:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96265 to 86022. [2024-11-12 13:46:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86022 states, 86021 states have (on average 1.345206403087618) internal successors, (115716), 86021 states have internal predecessors, (115716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86022 states to 86022 states and 115716 transitions. [2024-11-12 13:46:11,490 INFO L78 Accepts]: Start accepts. Automaton has 86022 states and 115716 transitions. Word has length 33 [2024-11-12 13:46:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:11,490 INFO L471 AbstractCegarLoop]: Abstraction has 86022 states and 115716 transitions. [2024-11-12 13:46:11,491 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-12 13:46:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 86022 states and 115716 transitions. [2024-11-12 13:46:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 13:46:11,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:11,520 INFO L218 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-12 13:46:11,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-12 13:46:11,521 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash -452076008, now seen corresponding path program 1 times [2024-11-12 13:46:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256028617] [2024-11-12 13:46:11,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:11,546 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-12 13:46:11,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:11,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256028617] [2024-11-12 13:46:11,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256028617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:11,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:11,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022275769] [2024-11-12 13:46:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:11,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:11,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:11,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:11,547 INFO L87 Difference]: Start difference. First operand 86022 states and 115716 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-12 13:46:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:11,770 INFO L93 Difference]: Finished difference Result 146441 states and 198662 transitions. [2024-11-12 13:46:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:11,770 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-12 13:46:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:12,311 INFO L225 Difference]: With dead ends: 146441 [2024-11-12 13:46:12,311 INFO L226 Difference]: Without dead ends: 146441 [2024-11-12 13:46:12,311 INFO L434 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-12 13:46:12,316 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 41 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:12,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146441 states. [2024-11-12 13:46:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146441 to 130054. [2024-11-12 13:46:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130054 states, 130053 states have (on average 1.3070671187900318) internal successors, (169988), 130053 states have internal predecessors, (169988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130054 states to 130054 states and 169988 transitions. [2024-11-12 13:46:14,232 INFO L78 Accepts]: Start accepts. Automaton has 130054 states and 169988 transitions. Word has length 34 [2024-11-12 13:46:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 130054 states and 169988 transitions. [2024-11-12 13:46:14,236 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-12 13:46:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 130054 states and 169988 transitions. [2024-11-12 13:46:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 13:46:14,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:14,299 INFO L218 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-12 13:46:14,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-12 13:46:14,300 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:14,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2141019750, now seen corresponding path program 1 times [2024-11-12 13:46:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502547382] [2024-11-12 13:46:14,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:14,317 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-12 13:46:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502547382] [2024-11-12 13:46:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502547382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:14,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401877792] [2024-11-12 13:46:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:14,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:14,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:14,318 INFO L87 Difference]: Start difference. First operand 130054 states and 169988 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-12 13:46:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:14,583 INFO L93 Difference]: Finished difference Result 168969 states and 219142 transitions. [2024-11-12 13:46:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:14,583 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-12 13:46:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:14,744 INFO L225 Difference]: With dead ends: 168969 [2024-11-12 13:46:14,744 INFO L226 Difference]: Without dead ends: 168969 [2024-11-12 13:46:14,744 INFO L434 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-12 13:46:14,745 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 226 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-12 13:46:14,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 226 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168969 states. [2024-11-12 13:46:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168969 to 168966. [2024-11-12 13:46:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168966 states, 168965 states have (on average 1.296954990678543) internal successors, (219140), 168965 states have internal predecessors, (219140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168966 states to 168966 states and 219140 transitions. [2024-11-12 13:46:16,514 INFO L78 Accepts]: Start accepts. Automaton has 168966 states and 219140 transitions. Word has length 34 [2024-11-12 13:46:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:16,514 INFO L471 AbstractCegarLoop]: Abstraction has 168966 states and 219140 transitions. [2024-11-12 13:46:16,515 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-12 13:46:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 168966 states and 219140 transitions. [2024-11-12 13:46:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:46:16,573 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:16,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:16,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-12 13:46:16,573 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:16,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:16,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1122782851, now seen corresponding path program 1 times [2024-11-12 13:46:16,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211775513] [2024-11-12 13:46:16,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:16,586 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-12 13:46:16,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:16,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211775513] [2024-11-12 13:46:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211775513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:16,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544311380] [2024-11-12 13:46:16,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:16,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:16,588 INFO L87 Difference]: Start difference. First operand 168966 states and 219140 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:17,455 INFO L93 Difference]: Finished difference Result 172041 states and 221190 transitions. [2024-11-12 13:46:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:17,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-12 13:46:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:17,648 INFO L225 Difference]: With dead ends: 172041 [2024-11-12 13:46:17,648 INFO L226 Difference]: Without dead ends: 172041 [2024-11-12 13:46:17,648 INFO L434 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-12 13:46:17,648 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 65 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:17,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172041 states. [2024-11-12 13:46:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172041 to 172038. [2024-11-12 13:46:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172038 states, 172037 states have (on average 1.2857001691496597) internal successors, (221188), 172037 states have internal predecessors, (221188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172038 states to 172038 states and 221188 transitions. [2024-11-12 13:46:19,811 INFO L78 Accepts]: Start accepts. Automaton has 172038 states and 221188 transitions. Word has length 35 [2024-11-12 13:46:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:19,812 INFO L471 AbstractCegarLoop]: Abstraction has 172038 states and 221188 transitions. [2024-11-12 13:46:19,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 172038 states and 221188 transitions. [2024-11-12 13:46:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:46:19,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:19,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:19,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-12 13:46:19,870 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:19,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1940431301, now seen corresponding path program 1 times [2024-11-12 13:46:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:19,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108316029] [2024-11-12 13:46:19,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:19,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:46:19,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:19,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108316029] [2024-11-12 13:46:19,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108316029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:19,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:19,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461592479] [2024-11-12 13:46:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:19,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:19,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:19,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:19,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:19,887 INFO L87 Difference]: Start difference. First operand 172038 states and 221188 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:20,883 INFO L93 Difference]: Finished difference Result 286729 states and 368646 transitions. [2024-11-12 13:46:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-12 13:46:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:21,190 INFO L225 Difference]: With dead ends: 286729 [2024-11-12 13:46:21,191 INFO L226 Difference]: Without dead ends: 286729 [2024-11-12 13:46:21,191 INFO L434 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-12 13:46:21,191 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:21,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286729 states. [2024-11-12 13:46:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286729 to 262150. [2024-11-12 13:46:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262150 states, 262149 states have (on average 1.2499914170948583) internal successors, (327684), 262149 states have internal predecessors, (327684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262150 states to 262150 states and 327684 transitions. [2024-11-12 13:46:24,886 INFO L78 Accepts]: Start accepts. Automaton has 262150 states and 327684 transitions. Word has length 35 [2024-11-12 13:46:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:24,886 INFO L471 AbstractCegarLoop]: Abstraction has 262150 states and 327684 transitions. [2024-11-12 13:46:24,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 262150 states and 327684 transitions. [2024-11-12 13:46:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:46:25,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:25,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:25,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-12 13:46:25,023 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:25,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:25,023 INFO L85 PathProgramCache]: Analyzing trace with hash 665592253, now seen corresponding path program 1 times [2024-11-12 13:46:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:25,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313752353] [2024-11-12 13:46:25,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:25,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:25,039 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-12 13:46:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313752353] [2024-11-12 13:46:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313752353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:25,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092490085] [2024-11-12 13:46:25,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:25,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:25,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:25,040 INFO L87 Difference]: Start difference. First operand 262150 states and 327684 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:26,336 INFO L93 Difference]: Finished difference Result 335881 states and 413702 transitions. [2024-11-12 13:46:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:26,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-12 13:46:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:26,690 INFO L225 Difference]: With dead ends: 335881 [2024-11-12 13:46:26,690 INFO L226 Difference]: Without dead ends: 335881 [2024-11-12 13:46:26,690 INFO L434 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-12 13:46:26,691 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 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-12 13:46:26,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335881 states. [2024-11-12 13:46:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335881 to 335878. [2024-11-12 13:46:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335878 states, 335877 states have (on average 1.2317008905045597) internal successors, (413700), 335877 states have internal predecessors, (413700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335878 states to 335878 states and 413700 transitions. [2024-11-12 13:46:30,338 INFO L78 Accepts]: Start accepts. Automaton has 335878 states and 413700 transitions. Word has length 35 [2024-11-12 13:46:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:30,339 INFO L471 AbstractCegarLoop]: Abstraction has 335878 states and 413700 transitions. [2024-11-12 13:46:30,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 335878 states and 413700 transitions. [2024-11-12 13:46:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:46:30,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:30,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:46:30,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-12 13:46:30,465 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:30,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:30,465 INFO L85 PathProgramCache]: Analyzing trace with hash -17146107, now seen corresponding path program 1 times [2024-11-12 13:46:30,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:30,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14832867] [2024-11-12 13:46:30,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:30,478 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-12 13:46:30,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:30,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14832867] [2024-11-12 13:46:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14832867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:30,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:30,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342237684] [2024-11-12 13:46:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:30,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:30,479 INFO L87 Difference]: Start difference. First operand 335878 states and 413700 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:46:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:31,887 INFO L93 Difference]: Finished difference Result 339977 states and 413702 transitions. [2024-11-12 13:46:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:31,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-12 13:46:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:32,229 INFO L225 Difference]: With dead ends: 339977 [2024-11-12 13:46:32,229 INFO L226 Difference]: Without dead ends: 339977 [2024-11-12 13:46:32,229 INFO L434 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-12 13:46:32,229 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:32,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339977 states.