/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:15,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:16,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:09:16,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:16,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:16,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:16,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:16,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:16,150 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:16,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:16,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:16,155 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:16,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:16,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:16,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:16,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:16,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:16,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:16,157 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:16,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:16,158 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:16,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:16,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:16,159 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:16,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:16,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:16,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:16,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:16,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:16,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:16,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:16,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:16,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:16,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:09:16,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:09:16,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:09:16,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:09:16,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:09:16,548 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:09:16,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2023-12-05 21:09:17,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:09:17,854 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:09:17,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2023-12-05 21:09:17,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035ca120c/32843f16723b4bb598b08bf3953b8cb8/FLAGa50fe0171 [2023-12-05 21:09:17,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035ca120c/32843f16723b4bb598b08bf3953b8cb8 [2023-12-05 21:09:17,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:09:17,913 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:09:17,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:17,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:09:17,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:09:17,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:17" (1/1) ... [2023-12-05 21:09:17,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1d773b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:17, skipping insertion in model container [2023-12-05 21:09:17,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:17" (1/1) ... [2023-12-05 21:09:17,981 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:09:18,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:18,277 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:09:18,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:18,366 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:18,366 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:18,371 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:09:18,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18 WrapperNode [2023-12-05 21:09:18,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:18,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:18,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:09:18,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:09:18,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,428 INFO L138 Inliner]: procedures = 176, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 187 [2023-12-05 21:09:18,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:18,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:09:18,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:09:18,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:09:18,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:09:18,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:09:18,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:09:18,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:09:18,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (1/1) ... [2023-12-05 21:09:18,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:18,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:09:18,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:09:18,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:09:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:09:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:09:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:09:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:09:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:09:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:09:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:09:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:09:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:09:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:09:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:09:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:09:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:09:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:09:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:09:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:09:18,523 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:09:18,628 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:09:18,630 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:09:19,077 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:09:19,329 WARN L1821 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-12-05 21:09:19,399 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:09:19,400 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:09:19,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:19 BoogieIcfgContainer [2023-12-05 21:09:19,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:09:19,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:09:19,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:09:19,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:09:19,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:09:17" (1/3) ... [2023-12-05 21:09:19,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d82eb04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:19, skipping insertion in model container [2023-12-05 21:09:19,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:18" (2/3) ... [2023-12-05 21:09:19,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d82eb04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:19, skipping insertion in model container [2023-12-05 21:09:19,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:19" (3/3) ... [2023-12-05 21:09:19,407 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2023-12-05 21:09:19,420 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:09:19,421 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-12-05 21:09:19,421 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:09:19,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:09:19,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 197 transitions, 406 flow [2023-12-05 21:09:19,622 INFO L124 PetriNetUnfolderBase]: 30/194 cut-off events. [2023-12-05 21:09:19,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:19,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 30/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 282 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 137. Up to 4 conditions per place. [2023-12-05 21:09:19,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 197 transitions, 406 flow [2023-12-05 21:09:19,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 194 transitions, 397 flow [2023-12-05 21:09:19,655 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:09:19,661 INFO L362 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@784b66e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:09:19,661 INFO L363 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2023-12-05 21:09:19,673 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:09:19,673 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2023-12-05 21:09:19,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:19,673 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:19,674 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:19,675 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:19,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1007369923, now seen corresponding path program 1 times [2023-12-05 21:09:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929510615] [2023-12-05 21:09:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:20,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929510615] [2023-12-05 21:09:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929510615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:20,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:20,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:20,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992040025] [2023-12-05 21:09:20,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:20,022 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:20,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:20,049 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-12-05 21:09:20,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 194 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:20,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:20,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-12-05 21:09:20,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:21,128 INFO L124 PetriNetUnfolderBase]: 1796/3930 cut-off events. [2023-12-05 21:09:21,128 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-12-05 21:09:21,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6671 conditions, 3930 events. 1796/3930 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 29941 event pairs, 952 based on Foata normal form. 133/2143 useless extension candidates. Maximal degree in co-relation 6595. Up to 1743 conditions per place. [2023-12-05 21:09:21,164 INFO L140 encePairwiseOnDemand]: 153/197 looper letters, 62 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-12-05 21:09:21,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 166 transitions, 469 flow [2023-12-05 21:09:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-12-05 21:09:21,177 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7868020304568528 [2023-12-05 21:09:21,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-12-05 21:09:21,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-12-05 21:09:21,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:21,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-12-05 21:09:21,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:21,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:21,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:21,189 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -16 predicate places. [2023-12-05 21:09:21,189 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 166 transitions, 469 flow [2023-12-05 21:09:21,190 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:21,190 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:21,190 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:21,190 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:09:21,190 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:21,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:21,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1007369924, now seen corresponding path program 1 times [2023-12-05 21:09:21,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:21,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780207424] [2023-12-05 21:09:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:21,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780207424] [2023-12-05 21:09:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780207424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:21,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359329565] [2023-12-05 21:09:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:21,377 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:21,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:21,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:21,379 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 197 [2023-12-05 21:09:21,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 166 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:21,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:21,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 197 [2023-12-05 21:09:21,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:22,182 INFO L124 PetriNetUnfolderBase]: 1802/3943 cut-off events. [2023-12-05 21:09:22,182 INFO L125 PetriNetUnfolderBase]: For 327/861 co-relation queries the response was YES. [2023-12-05 21:09:22,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9286 conditions, 3943 events. 1802/3943 cut-off events. For 327/861 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30011 event pairs, 958 based on Foata normal form. 0/2018 useless extension candidates. Maximal degree in co-relation 9204. Up to 1942 conditions per place. [2023-12-05 21:09:22,220 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 75 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2023-12-05 21:09:22,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 182 transitions, 687 flow [2023-12-05 21:09:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-12-05 21:09:22,223 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6615905245346869 [2023-12-05 21:09:22,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-12-05 21:09:22,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-12-05 21:09:22,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:22,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-12-05 21:09:22,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,229 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -15 predicate places. [2023-12-05 21:09:22,229 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 182 transitions, 687 flow [2023-12-05 21:09:22,230 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,230 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:22,230 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:22,230 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:09:22,230 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:22,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash -628274324, now seen corresponding path program 1 times [2023-12-05 21:09:22,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:22,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528060680] [2023-12-05 21:09:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:22,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528060680] [2023-12-05 21:09:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528060680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:22,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:22,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056758035] [2023-12-05 21:09:22,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:22,318 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:22,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:22,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:22,321 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-12-05 21:09:22,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 182 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:22,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:22,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-12-05 21:09:22,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:23,131 INFO L124 PetriNetUnfolderBase]: 1933/4073 cut-off events. [2023-12-05 21:09:23,131 INFO L125 PetriNetUnfolderBase]: For 976/2074 co-relation queries the response was YES. [2023-12-05 21:09:23,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12532 conditions, 4073 events. 1933/4073 cut-off events. For 976/2074 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30467 event pairs, 958 based on Foata normal form. 1/2050 useless extension candidates. Maximal degree in co-relation 12441. Up to 1942 conditions per place. [2023-12-05 21:09:23,172 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 78 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2023-12-05 21:09:23,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 181 transitions, 843 flow [2023-12-05 21:09:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-12-05 21:09:23,173 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6514382402707276 [2023-12-05 21:09:23,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-12-05 21:09:23,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-12-05 21:09:23,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:23,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-12-05 21:09:23,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:23,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:23,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:23,177 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -14 predicate places. [2023-12-05 21:09:23,177 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 181 transitions, 843 flow [2023-12-05 21:09:23,177 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:23,177 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:23,177 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:23,177 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:09:23,178 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:23,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash -628274323, now seen corresponding path program 1 times [2023-12-05 21:09:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106960813] [2023-12-05 21:09:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:23,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:23,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106960813] [2023-12-05 21:09:23,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106960813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:23,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:23,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803274885] [2023-12-05 21:09:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:23,253 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:23,255 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 197 [2023-12-05 21:09:23,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 181 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:23,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:23,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 197 [2023-12-05 21:09:23,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:24,066 INFO L124 PetriNetUnfolderBase]: 1933/4072 cut-off events. [2023-12-05 21:09:24,067 INFO L125 PetriNetUnfolderBase]: For 1784/3446 co-relation queries the response was YES. [2023-12-05 21:09:24,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15256 conditions, 4072 events. 1933/4072 cut-off events. For 1784/3446 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30367 event pairs, 958 based on Foata normal form. 1/2049 useless extension candidates. Maximal degree in co-relation 15157. Up to 2200 conditions per place. [2023-12-05 21:09:24,105 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 91 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-12-05 21:09:24,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 197 transitions, 1159 flow [2023-12-05 21:09:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-12-05 21:09:24,107 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6598984771573604 [2023-12-05 21:09:24,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-12-05 21:09:24,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-12-05 21:09:24,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:24,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-12-05 21:09:24,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:24,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:24,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:24,110 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -13 predicate places. [2023-12-05 21:09:24,110 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 197 transitions, 1159 flow [2023-12-05 21:09:24,111 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:24,111 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:24,111 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:24,111 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:09:24,111 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:24,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1656632728, now seen corresponding path program 1 times [2023-12-05 21:09:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498402951] [2023-12-05 21:09:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:24,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498402951] [2023-12-05 21:09:24,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498402951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:24,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:24,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255087586] [2023-12-05 21:09:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:24,183 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:24,185 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 197 [2023-12-05 21:09:24,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 197 transitions, 1159 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:24,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:24,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 197 [2023-12-05 21:09:24,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:24,959 INFO L124 PetriNetUnfolderBase]: 2526/5043 cut-off events. [2023-12-05 21:09:24,959 INFO L125 PetriNetUnfolderBase]: For 3208/20932 co-relation queries the response was YES. [2023-12-05 21:09:24,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22937 conditions, 5043 events. 2526/5043 cut-off events. For 3208/20932 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 39078 event pairs, 515 based on Foata normal form. 0/2450 useless extension candidates. Maximal degree in co-relation 22834. Up to 2809 conditions per place. [2023-12-05 21:09:25,010 INFO L140 encePairwiseOnDemand]: 187/197 looper letters, 117 selfloop transitions, 25 changer transitions 0/258 dead transitions. [2023-12-05 21:09:25,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 258 transitions, 2056 flow [2023-12-05 21:09:25,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-12-05 21:09:25,012 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.727580372250423 [2023-12-05 21:09:25,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-12-05 21:09:25,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-12-05 21:09:25,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:25,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-12-05 21:09:25,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,015 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -11 predicate places. [2023-12-05 21:09:25,015 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 258 transitions, 2056 flow [2023-12-05 21:09:25,015 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,015 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:25,016 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:25,016 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:09:25,016 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:25,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1656632726, now seen corresponding path program 1 times [2023-12-05 21:09:25,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:25,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492143772] [2023-12-05 21:09:25,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:25,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492143772] [2023-12-05 21:09:25,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492143772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:25,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:25,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:09:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118226117] [2023-12-05 21:09:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:25,255 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:09:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:09:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:09:25,256 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 197 [2023-12-05 21:09:25,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 258 transitions, 2056 flow. Second operand has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:25,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 197 [2023-12-05 21:09:25,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:25,923 INFO L124 PetriNetUnfolderBase]: 1608/3423 cut-off events. [2023-12-05 21:09:25,923 INFO L125 PetriNetUnfolderBase]: For 3784/8594 co-relation queries the response was YES. [2023-12-05 21:09:25,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17323 conditions, 3423 events. 1608/3423 cut-off events. For 3784/8594 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24673 event pairs, 231 based on Foata normal form. 0/2004 useless extension candidates. Maximal degree in co-relation 17209. Up to 1642 conditions per place. [2023-12-05 21:09:25,959 INFO L140 encePairwiseOnDemand]: 177/197 looper letters, 166 selfloop transitions, 30 changer transitions 0/294 dead transitions. [2023-12-05 21:09:25,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 294 transitions, 2866 flow [2023-12-05 21:09:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:09:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:09:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2023-12-05 21:09:25,962 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6091370558375635 [2023-12-05 21:09:25,962 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2023-12-05 21:09:25,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2023-12-05 21:09:25,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:25,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2023-12-05 21:09:25,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,966 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,967 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2023-12-05 21:09:25,967 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 294 transitions, 2866 flow [2023-12-05 21:09:25,967 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:25,967 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:25,967 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:25,967 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:09:25,968 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:25,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1656632725, now seen corresponding path program 1 times [2023-12-05 21:09:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:25,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011764653] [2023-12-05 21:09:25,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011764653] [2023-12-05 21:09:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011764653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:09:26,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86055070] [2023-12-05 21:09:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:26,146 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:09:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:26,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:09:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:09:26,148 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 197 [2023-12-05 21:09:26,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 294 transitions, 2866 flow. Second operand has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:26,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 197 [2023-12-05 21:09:26,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:26,524 INFO L124 PetriNetUnfolderBase]: 568/1379 cut-off events. [2023-12-05 21:09:26,524 INFO L125 PetriNetUnfolderBase]: For 2822/3444 co-relation queries the response was YES. [2023-12-05 21:09:26,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7176 conditions, 1379 events. 568/1379 cut-off events. For 2822/3444 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8013 event pairs, 56 based on Foata normal form. 26/1037 useless extension candidates. Maximal degree in co-relation 7051. Up to 687 conditions per place. [2023-12-05 21:09:26,534 INFO L140 encePairwiseOnDemand]: 178/197 looper letters, 102 selfloop transitions, 28 changer transitions 0/229 dead transitions. [2023-12-05 21:09:26,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 229 transitions, 2216 flow [2023-12-05 21:09:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:09:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:09:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-12-05 21:09:26,536 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.583756345177665 [2023-12-05 21:09:26,536 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-12-05 21:09:26,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-12-05 21:09:26,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:26,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-12-05 21:09:26,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,540 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,540 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -8 predicate places. [2023-12-05 21:09:26,540 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 229 transitions, 2216 flow [2023-12-05 21:09:26,541 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,541 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:26,541 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:26,541 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:09:26,541 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:26,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:26,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1875888069, now seen corresponding path program 1 times [2023-12-05 21:09:26,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:26,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022730256] [2023-12-05 21:09:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022730256] [2023-12-05 21:09:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022730256] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:26,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:26,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309906304] [2023-12-05 21:09:26,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:26,603 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:26,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:26,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:26,604 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 197 [2023-12-05 21:09:26,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 229 transitions, 2216 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:26,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 197 [2023-12-05 21:09:26,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:26,874 INFO L124 PetriNetUnfolderBase]: 672/1501 cut-off events. [2023-12-05 21:09:26,875 INFO L125 PetriNetUnfolderBase]: For 5159/5459 co-relation queries the response was YES. [2023-12-05 21:09:26,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8990 conditions, 1501 events. 672/1501 cut-off events. For 5159/5459 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8618 event pairs, 31 based on Foata normal form. 3/1080 useless extension candidates. Maximal degree in co-relation 8857. Up to 793 conditions per place. [2023-12-05 21:09:26,888 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 146 selfloop transitions, 2 changer transitions 8/260 dead transitions. [2023-12-05 21:09:26,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 260 transitions, 3032 flow [2023-12-05 21:09:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-12-05 21:09:26,889 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6362098138747885 [2023-12-05 21:09:26,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-12-05 21:09:26,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-12-05 21:09:26,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:26,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-12-05 21:09:26,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,893 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -7 predicate places. [2023-12-05 21:09:26,894 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 260 transitions, 3032 flow [2023-12-05 21:09:26,894 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,894 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:26,894 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:26,894 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:09:26,894 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:26,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:26,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1875888068, now seen corresponding path program 1 times [2023-12-05 21:09:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:26,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910236324] [2023-12-05 21:09:26,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:26,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910236324] [2023-12-05 21:09:26,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910236324] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:26,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:26,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:26,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272984420] [2023-12-05 21:09:26,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:26,939 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:26,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:26,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:26,940 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-12-05 21:09:26,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 260 transitions, 3032 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:26,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:26,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-12-05 21:09:26,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:27,235 INFO L124 PetriNetUnfolderBase]: 670/1491 cut-off events. [2023-12-05 21:09:27,236 INFO L125 PetriNetUnfolderBase]: For 6471/6835 co-relation queries the response was YES. [2023-12-05 21:09:27,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9942 conditions, 1491 events. 670/1491 cut-off events. For 6471/6835 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8531 event pairs, 31 based on Foata normal form. 3/1070 useless extension candidates. Maximal degree in co-relation 9800. Up to 798 conditions per place. [2023-12-05 21:09:27,250 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 148 selfloop transitions, 2 changer transitions 8/259 dead transitions. [2023-12-05 21:09:27,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 259 transitions, 3336 flow [2023-12-05 21:09:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-12-05 21:09:27,252 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6159052453468697 [2023-12-05 21:09:27,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-12-05 21:09:27,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-12-05 21:09:27,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:27,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-12-05 21:09:27,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,255 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2023-12-05 21:09:27,255 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 259 transitions, 3336 flow [2023-12-05 21:09:27,255 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,255 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:27,255 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:27,255 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:09:27,255 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:27,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash -983351531, now seen corresponding path program 1 times [2023-12-05 21:09:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:27,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831960211] [2023-12-05 21:09:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:27,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:27,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831960211] [2023-12-05 21:09:27,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831960211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:27,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:27,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510151847] [2023-12-05 21:09:27,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:27,381 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:27,382 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 197 [2023-12-05 21:09:27,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 259 transitions, 3336 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:27,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 197 [2023-12-05 21:09:27,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:27,713 INFO L124 PetriNetUnfolderBase]: 634/1408 cut-off events. [2023-12-05 21:09:27,713 INFO L125 PetriNetUnfolderBase]: For 7930/8532 co-relation queries the response was YES. [2023-12-05 21:09:27,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10200 conditions, 1408 events. 634/1408 cut-off events. For 7930/8532 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8046 event pairs, 15 based on Foata normal form. 3/1019 useless extension candidates. Maximal degree in co-relation 10055. Up to 798 conditions per place. [2023-12-05 21:09:27,730 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 113 selfloop transitions, 51 changer transitions 8/290 dead transitions. [2023-12-05 21:09:27,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 290 transitions, 4300 flow [2023-12-05 21:09:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-12-05 21:09:27,732 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6869712351945855 [2023-12-05 21:09:27,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-12-05 21:09:27,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-12-05 21:09:27,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:27,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-12-05 21:09:27,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,734 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -4 predicate places. [2023-12-05 21:09:27,734 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 290 transitions, 4300 flow [2023-12-05 21:09:27,735 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,735 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:27,735 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:27,735 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:09:27,735 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:27,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash -107792965, now seen corresponding path program 1 times [2023-12-05 21:09:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194304466] [2023-12-05 21:09:27,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194304466] [2023-12-05 21:09:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194304466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:09:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359888831] [2023-12-05 21:09:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:27,843 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:27,844 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 197 [2023-12-05 21:09:27,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 290 transitions, 4300 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:27,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:27,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 197 [2023-12-05 21:09:27,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:28,149 INFO L124 PetriNetUnfolderBase]: 575/1379 cut-off events. [2023-12-05 21:09:28,150 INFO L125 PetriNetUnfolderBase]: For 9412/9922 co-relation queries the response was YES. [2023-12-05 21:09:28,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10259 conditions, 1379 events. 575/1379 cut-off events. For 9412/9922 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8273 event pairs, 19 based on Foata normal form. 3/1049 useless extension candidates. Maximal degree in co-relation 10111. Up to 750 conditions per place. [2023-12-05 21:09:28,167 INFO L140 encePairwiseOnDemand]: 195/197 looper letters, 149 selfloop transitions, 1 changer transitions 7/275 dead transitions. [2023-12-05 21:09:28,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 275 transitions, 4284 flow [2023-12-05 21:09:28,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-12-05 21:09:28,169 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6734348561759729 [2023-12-05 21:09:28,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-12-05 21:09:28,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-12-05 21:09:28,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:28,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-12-05 21:09:28,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,172 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2023-12-05 21:09:28,172 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 275 transitions, 4284 flow [2023-12-05 21:09:28,172 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,172 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:28,173 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:28,173 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:28,173 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:28,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash -309657518, now seen corresponding path program 1 times [2023-12-05 21:09:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:28,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543289601] [2023-12-05 21:09:28,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543289601] [2023-12-05 21:09:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543289601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:28,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:28,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:09:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243764883] [2023-12-05 21:09:28,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:28,263 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:28,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:28,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:28,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:28,264 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 197 [2023-12-05 21:09:28,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 275 transitions, 4284 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:28,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 197 [2023-12-05 21:09:28,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:28,689 INFO L124 PetriNetUnfolderBase]: 704/1860 cut-off events. [2023-12-05 21:09:28,690 INFO L125 PetriNetUnfolderBase]: For 14913/15677 co-relation queries the response was YES. [2023-12-05 21:09:28,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14004 conditions, 1860 events. 704/1860 cut-off events. For 14913/15677 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13262 event pairs, 32 based on Foata normal form. 8/1462 useless extension candidates. Maximal degree in co-relation 13853. Up to 980 conditions per place. [2023-12-05 21:09:28,712 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 170 selfloop transitions, 24 changer transitions 9/321 dead transitions. [2023-12-05 21:09:28,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 321 transitions, 5797 flow [2023-12-05 21:09:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-12-05 21:09:28,714 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6971235194585449 [2023-12-05 21:09:28,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-12-05 21:09:28,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-12-05 21:09:28,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:28,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-12-05 21:09:28,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,719 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-12-05 21:09:28,719 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 321 transitions, 5797 flow [2023-12-05 21:09:28,719 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,719 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:28,719 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:28,719 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:28,720 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:28,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:28,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1661820836, now seen corresponding path program 1 times [2023-12-05 21:09:28,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:28,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779892202] [2023-12-05 21:09:28,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:28,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:28,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:28,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779892202] [2023-12-05 21:09:28,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779892202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:28,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:28,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:28,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847216639] [2023-12-05 21:09:28,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:28,894 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:28,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:28,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:28,895 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 197 [2023-12-05 21:09:28,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 321 transitions, 5797 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:28,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:28,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 197 [2023-12-05 21:09:28,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,235 INFO L124 PetriNetUnfolderBase]: 690/1834 cut-off events. [2023-12-05 21:09:29,235 INFO L125 PetriNetUnfolderBase]: For 17688/18482 co-relation queries the response was YES. [2023-12-05 21:09:29,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14502 conditions, 1834 events. 690/1834 cut-off events. For 17688/18482 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13070 event pairs, 27 based on Foata normal form. 20/1460 useless extension candidates. Maximal degree in co-relation 14341. Up to 980 conditions per place. [2023-12-05 21:09:29,255 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 160 selfloop transitions, 42 changer transitions 9/318 dead transitions. [2023-12-05 21:09:29,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 318 transitions, 6141 flow [2023-12-05 21:09:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-12-05 21:09:29,257 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6142131979695431 [2023-12-05 21:09:29,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-12-05 21:09:29,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-12-05 21:09:29,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-12-05 21:09:29,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,259 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,260 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, 2 predicate places. [2023-12-05 21:09:29,260 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 318 transitions, 6141 flow [2023-12-05 21:09:29,260 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,260 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,260 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:29,260 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:09:29,261 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:29,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1661820835, now seen corresponding path program 1 times [2023-12-05 21:09:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862831882] [2023-12-05 21:09:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:29,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862831882] [2023-12-05 21:09:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862831882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:09:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117700524] [2023-12-05 21:09:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:09:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:09:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:09:29,327 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 197 [2023-12-05 21:09:29,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 318 transitions, 6141 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 197 [2023-12-05 21:09:29,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,737 INFO L124 PetriNetUnfolderBase]: 722/2070 cut-off events. [2023-12-05 21:09:29,738 INFO L125 PetriNetUnfolderBase]: For 22865/23775 co-relation queries the response was YES. [2023-12-05 21:09:29,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16511 conditions, 2070 events. 722/2070 cut-off events. For 22865/23775 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16441 event pairs, 20 based on Foata normal form. 20/1709 useless extension candidates. Maximal degree in co-relation 16339. Up to 1086 conditions per place. [2023-12-05 21:09:29,758 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 179 selfloop transitions, 44 changer transitions 25/350 dead transitions. [2023-12-05 21:09:29,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 350 transitions, 7491 flow [2023-12-05 21:09:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-12-05 21:09:29,760 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6175972927241963 [2023-12-05 21:09:29,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-12-05 21:09:29,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-12-05 21:09:29,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-12-05 21:09:29,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,762 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, 3 predicate places. [2023-12-05 21:09:29,762 INFO L500 AbstractCegarLoop]: Abstraction has has 177 places, 350 transitions, 7491 flow [2023-12-05 21:09:29,762 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:29,762 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,762 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:29,762 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:09:29,763 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:29,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1540706259, now seen corresponding path program 1 times [2023-12-05 21:09:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051335355] [2023-12-05 21:09:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:30,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051335355] [2023-12-05 21:09:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051335355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:30,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:30,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:09:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056417937] [2023-12-05 21:09:30,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:30,002 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:09:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:30,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:09:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:09:30,004 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 197 [2023-12-05 21:09:30,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 350 transitions, 7491 flow. Second operand has 11 states, 11 states have (on average 103.0909090909091) internal successors, (1134), 11 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:30,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:30,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 197 [2023-12-05 21:09:30,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,180 INFO L124 PetriNetUnfolderBase]: 1895/4982 cut-off events. [2023-12-05 21:09:31,181 INFO L125 PetriNetUnfolderBase]: For 66807/71626 co-relation queries the response was YES. [2023-12-05 21:09:31,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38294 conditions, 4982 events. 1895/4982 cut-off events. For 66807/71626 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 45097 event pairs, 40 based on Foata normal form. 43/4335 useless extension candidates. Maximal degree in co-relation 38110. Up to 2180 conditions per place. [2023-12-05 21:09:31,239 INFO L140 encePairwiseOnDemand]: 175/197 looper letters, 467 selfloop transitions, 137 changer transitions 80/779 dead transitions. [2023-12-05 21:09:31,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 779 transitions, 21142 flow [2023-12-05 21:09:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-05 21:09:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-12-05 21:09:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1572 transitions. [2023-12-05 21:09:31,244 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5699782451051486 [2023-12-05 21:09:31,244 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1572 transitions. [2023-12-05 21:09:31,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1572 transitions. [2023-12-05 21:09:31,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1572 transitions. [2023-12-05 21:09:31,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 112.28571428571429) internal successors, (1572), 14 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 197.0) internal successors, (2955), 15 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,250 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 197.0) internal successors, (2955), 15 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,251 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, 16 predicate places. [2023-12-05 21:09:31,251 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 779 transitions, 21142 flow [2023-12-05 21:09:31,251 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.0909090909091) internal successors, (1134), 11 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,251 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,251 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:31,252 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:09:31,252 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:31,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash -990346146, now seen corresponding path program 1 times [2023-12-05 21:09:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487872030] [2023-12-05 21:09:31,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:31,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487872030] [2023-12-05 21:09:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487872030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:09:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124296437] [2023-12-05 21:09:31,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,447 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:09:31,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:09:31,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:09:31,449 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 197 [2023-12-05 21:09:31,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 779 transitions, 21142 flow. Second operand has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:31,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 197 [2023-12-05 21:09:31,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:32,544 INFO L124 PetriNetUnfolderBase]: 1729/4596 cut-off events. [2023-12-05 21:09:32,544 INFO L125 PetriNetUnfolderBase]: For 69330/74550 co-relation queries the response was YES. [2023-12-05 21:09:32,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37001 conditions, 4596 events. 1729/4596 cut-off events. For 69330/74550 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 40458 event pairs, 42 based on Foata normal form. 14/4034 useless extension candidates. Maximal degree in co-relation 36806. Up to 1955 conditions per place. [2023-12-05 21:09:32,598 INFO L140 encePairwiseOnDemand]: 180/197 looper letters, 522 selfloop transitions, 74 changer transitions 95/794 dead transitions. [2023-12-05 21:09:32,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 794 transitions, 23004 flow [2023-12-05 21:09:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:09:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:09:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions. [2023-12-05 21:09:32,601 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.567258883248731 [2023-12-05 21:09:32,601 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 894 transitions. [2023-12-05 21:09:32,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions. [2023-12-05 21:09:32,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:32,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions. [2023-12-05 21:09:32,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,605 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,605 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, 23 predicate places. [2023-12-05 21:09:32,605 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 794 transitions, 23004 flow [2023-12-05 21:09:32,606 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,606 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:32,606 INFO L233 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:32,606 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:09:32,606 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-12-05 21:09:32,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1150785868, now seen corresponding path program 1 times [2023-12-05 21:09:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282406684] [2023-12-05 21:09:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:32,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:32,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282406684] [2023-12-05 21:09:32,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282406684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:32,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:32,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:09:32,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138775334] [2023-12-05 21:09:32,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:32,883 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:09:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:09:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:09:32,884 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 197 [2023-12-05 21:09:32,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 794 transitions, 23004 flow. Second operand has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:32,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 197 [2023-12-05 21:09:32,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:33,874 INFO L124 PetriNetUnfolderBase]: 1231/3390 cut-off events. [2023-12-05 21:09:33,874 INFO L125 PetriNetUnfolderBase]: For 63226/69850 co-relation queries the response was YES. [2023-12-05 21:09:33,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28042 conditions, 3390 events. 1231/3390 cut-off events. For 63226/69850 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27632 event pairs, 14 based on Foata normal form. 14/3191 useless extension candidates. Maximal degree in co-relation 27836. Up to 1248 conditions per place. [2023-12-05 21:09:33,889 INFO L140 encePairwiseOnDemand]: 184/197 looper letters, 0 selfloop transitions, 0 changer transitions 726/726 dead transitions. [2023-12-05 21:09:33,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 726 transitions, 21940 flow [2023-12-05 21:09:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:09:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:09:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 970 transitions. [2023-12-05 21:09:33,891 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5470953186689227 [2023-12-05 21:09:33,891 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 970 transitions. [2023-12-05 21:09:33,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 970 transitions. [2023-12-05 21:09:33,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:33,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 970 transitions. [2023-12-05 21:09:33,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:33,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:33,896 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:33,896 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, 26 predicate places. [2023-12-05 21:09:33,896 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 726 transitions, 21940 flow [2023-12-05 21:09:33,896 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:33,913 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe012_power.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:33,947 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 63 remaining) [2023-12-05 21:09:33,948 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 63 remaining) [2023-12-05 21:09:33,948 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 63 remaining) [2023-12-05 21:09:33,948 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 63 remaining) [2023-12-05 21:09:33,948 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 63 remaining) [2023-12-05 21:09:33,949 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 63 remaining) [2023-12-05 21:09:33,950 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 63 remaining) [2023-12-05 21:09:33,951 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 63 remaining) [2023-12-05 21:09:33,952 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 63 remaining) [2023-12-05 21:09:33,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 63 remaining) [2023-12-05 21:09:33,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 63 remaining) [2023-12-05 21:09:33,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 63 remaining) [2023-12-05 21:09:33,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 63 remaining) [2023-12-05 21:09:33,953 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 63 remaining) [2023-12-05 21:09:33,953 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:09:33,953 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:33,958 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:33,958 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:33,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:33 BasicIcfg [2023-12-05 21:09:33,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:33,964 INFO L158 Benchmark]: Toolchain (without parser) took 16051.39ms. Allocated memory was 362.8MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 307.2MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-05 21:09:33,964 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 213.9MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:33,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.64ms. Allocated memory is still 362.8MB. Free memory was 306.9MB in the beginning and 282.6MB in the end (delta: 24.2MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:33,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.58ms. Allocated memory is still 362.8MB. Free memory was 282.6MB in the beginning and 280.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:33,965 INFO L158 Benchmark]: Boogie Preprocessor took 43.47ms. Allocated memory is still 362.8MB. Free memory was 280.0MB in the beginning and 277.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:33,965 INFO L158 Benchmark]: RCFGBuilder took 927.96ms. Allocated memory is still 362.8MB. Free memory was 277.5MB in the beginning and 207.7MB in the end (delta: 69.8MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. [2023-12-05 21:09:33,965 INFO L158 Benchmark]: TraceAbstraction took 14561.08ms. Allocated memory was 362.8MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 207.2MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-05 21:09:33,966 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 213.9MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 458.64ms. Allocated memory is still 362.8MB. Free memory was 306.9MB in the beginning and 282.6MB in the end (delta: 24.2MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.58ms. Allocated memory is still 362.8MB. Free memory was 282.6MB in the beginning and 280.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.47ms. Allocated memory is still 362.8MB. Free memory was 280.0MB in the beginning and 277.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 927.96ms. Allocated memory is still 362.8MB. Free memory was 277.5MB in the beginning and 207.7MB in the end (delta: 69.8MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. * TraceAbstraction took 14561.08ms. Allocated memory was 362.8MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 207.2MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 219 locations, 63 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1474 IncrementalHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 150 mSDtfsCounter, 1474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23004occurred in iteration=16, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1320 NumberOfCodeBlocks, 1320 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1303 ConstructedInterpolants, 0 QuantifiedInterpolants, 5542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:33,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...