/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/safe025_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:10:18,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:10:18,570 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:10:18,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:10:18,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:10:18,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:10:18,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:10:18,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:10:18,598 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:10:18,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:10:18,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:10:18,601 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:10:18,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:10:18,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:10:18,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:10:18,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:10:18,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:10:18,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:10:18,602 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:10:18,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:10:18,602 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:10:18,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:10:18,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:10:18,603 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:10:18,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:10:18,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:18,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:10:18,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:10:18,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:10:18,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:10:18,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:10:18,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:10:18,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:10:18,605 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:10:18,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:10:18,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:10:18,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:10:18,808 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:10:18,808 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:10:18,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2023-12-05 21:10:19,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:10:20,056 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:10:20,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2023-12-05 21:10:20,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba2373b0/b2e2fd1602614662a6ed8c9b5020872a/FLAGae4d20881 [2023-12-05 21:10:20,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba2373b0/b2e2fd1602614662a6ed8c9b5020872a [2023-12-05 21:10:20,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:10:20,082 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:10:20,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:20,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:10:20,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:10:20,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed576df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20, skipping insertion in model container [2023-12-05 21:10:20,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,142 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:10:20,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:20,395 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:10:20,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:20,503 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:20,503 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:20,508 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:10:20,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20 WrapperNode [2023-12-05 21:10:20,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:20,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:20,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:10:20,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:10:20,515 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:10:20" (1/1) ... [2023-12-05 21:10:20,546 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:10:20" (1/1) ... [2023-12-05 21:10:20,576 INFO L138 Inliner]: procedures = 176, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2023-12-05 21:10:20,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:20,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:10:20,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:10:20,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:10:20,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:10:20,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:10:20,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:10:20,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:10:20,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (1/1) ... [2023-12-05 21:10:20,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:20,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:10:20,657 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:10:20,713 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:10:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:10:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:10:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:10:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:10:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:10:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:10:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:10:20,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:10:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:10:20,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:10:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:10:20,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:10:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:10:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:10:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:10:20,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:10:20,719 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:10:20,852 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:10:20,854 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:10:21,347 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:10:21,641 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:10:21,642 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:10:21,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:21 BoogieIcfgContainer [2023-12-05 21:10:21,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:10:21,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:10:21,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:10:21,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:10:21,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:10:20" (1/3) ... [2023-12-05 21:10:21,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66060341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:21, skipping insertion in model container [2023-12-05 21:10:21,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:20" (2/3) ... [2023-12-05 21:10:21,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66060341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:21, skipping insertion in model container [2023-12-05 21:10:21,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:21" (3/3) ... [2023-12-05 21:10:21,649 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_rmo.i [2023-12-05 21:10:21,661 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:10:21,662 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-12-05 21:10:21,662 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:10:21,783 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:10:21,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 194 transitions, 400 flow [2023-12-05 21:10:21,894 INFO L124 PetriNetUnfolderBase]: 3/191 cut-off events. [2023-12-05 21:10:21,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:21,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 3/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-12-05 21:10:21,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 194 transitions, 400 flow [2023-12-05 21:10:21,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 191 transitions, 391 flow [2023-12-05 21:10:21,915 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:10:21,919 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;@1d127db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:10:21,919 INFO L363 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2023-12-05 21:10:21,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:10:21,926 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-12-05 21:10:21,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:21,926 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:21,926 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] [2023-12-05 21:10:21,926 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:21,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1295086291, now seen corresponding path program 1 times [2023-12-05 21:10:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553460579] [2023-12-05 21:10:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:22,212 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:10:22,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:22,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553460579] [2023-12-05 21:10:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553460579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:22,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:22,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581130402] [2023-12-05 21:10:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:22,223 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:22,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:22,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:22,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:22,251 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 194 [2023-12-05 21:10:22,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 191 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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:10:22,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:22,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 194 [2023-12-05 21:10:22,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:26,285 INFO L124 PetriNetUnfolderBase]: 17565/32564 cut-off events. [2023-12-05 21:10:26,285 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-12-05 21:10:26,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57368 conditions, 32564 events. 17565/32564 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 2844. Compared 331581 event pairs, 12045 based on Foata normal form. 912/16175 useless extension candidates. Maximal degree in co-relation 57293. Up to 17008 conditions per place. [2023-12-05 21:10:26,553 INFO L140 encePairwiseOnDemand]: 158/194 looper letters, 74 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2023-12-05 21:10:26,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 176 transitions, 513 flow [2023-12-05 21:10:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-12-05 21:10:26,563 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7646048109965635 [2023-12-05 21:10:26,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-12-05 21:10:26,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-12-05 21:10:26,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:26,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-12-05 21:10:26,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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:10:26,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:26,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:26,576 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -32 predicate places. [2023-12-05 21:10:26,576 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 176 transitions, 513 flow [2023-12-05 21:10:26,576 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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:10:26,577 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:26,577 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] [2023-12-05 21:10:26,577 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:10:26,577 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:26,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1295086290, now seen corresponding path program 1 times [2023-12-05 21:10:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011892453] [2023-12-05 21:10:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:26,707 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:10:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:26,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011892453] [2023-12-05 21:10:26,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011892453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:26,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:26,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105706049] [2023-12-05 21:10:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:26,709 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:26,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:26,710 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 194 [2023-12-05 21:10:26,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 176 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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:10:26,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:26,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 194 [2023-12-05 21:10:26,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:30,568 INFO L124 PetriNetUnfolderBase]: 17648/32702 cut-off events. [2023-12-05 21:10:30,569 INFO L125 PetriNetUnfolderBase]: For 2359/5911 co-relation queries the response was YES. [2023-12-05 21:10:30,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81499 conditions, 32702 events. 17648/32702 cut-off events. For 2359/5911 co-relation queries the response was YES. Maximal size of possible extension queue 2844. Compared 333438 event pairs, 12128 based on Foata normal form. 0/15372 useless extension candidates. Maximal degree in co-relation 81418. Up to 18626 conditions per place. [2023-12-05 21:10:30,796 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 92 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-12-05 21:10:30,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 197 transitions, 785 flow [2023-12-05 21:10:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-12-05 21:10:30,799 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6821305841924399 [2023-12-05 21:10:30,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-12-05 21:10:30,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-12-05 21:10:30,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:30,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-12-05 21:10:30,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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:10:30,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:30,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:30,804 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -31 predicate places. [2023-12-05 21:10:30,804 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 197 transitions, 785 flow [2023-12-05 21:10:30,804 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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:10:30,804 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:30,805 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] [2023-12-05 21:10:30,805 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:10:30,805 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:30,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash -43682749, now seen corresponding path program 1 times [2023-12-05 21:10:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:30,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563681636] [2023-12-05 21:10:30,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:30,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:30,988 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:10:30,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563681636] [2023-12-05 21:10:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563681636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:30,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:30,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821284612] [2023-12-05 21:10:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:30,995 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:31,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:31,002 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 194 [2023-12-05 21:10:31,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 197 transitions, 785 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 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:10:31,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:31,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 194 [2023-12-05 21:10:31,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:33,625 INFO L124 PetriNetUnfolderBase]: 10588/21343 cut-off events. [2023-12-05 21:10:33,625 INFO L125 PetriNetUnfolderBase]: For 4886/7520 co-relation queries the response was YES. [2023-12-05 21:10:33,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67034 conditions, 21343 events. 10588/21343 cut-off events. For 4886/7520 co-relation queries the response was YES. Maximal size of possible extension queue 1630. Compared 217550 event pairs, 3052 based on Foata normal form. 0/12993 useless extension candidates. Maximal degree in co-relation 66942. Up to 11676 conditions per place. [2023-12-05 21:10:33,775 INFO L140 encePairwiseOnDemand]: 171/194 looper letters, 101 selfloop transitions, 19 changer transitions 0/218 dead transitions. [2023-12-05 21:10:33,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 218 transitions, 1147 flow [2023-12-05 21:10:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:10:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:10:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-12-05 21:10:33,779 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6391752577319587 [2023-12-05 21:10:33,779 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-12-05 21:10:33,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-12-05 21:10:33,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:33,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-12-05 21:10:33,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 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:10:33,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 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:10:33,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 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:10:33,787 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -28 predicate places. [2023-12-05 21:10:33,787 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 218 transitions, 1147 flow [2023-12-05 21:10:33,787 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 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:10:33,787 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:33,787 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] [2023-12-05 21:10:33,788 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:10:33,788 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:33,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash -43682748, now seen corresponding path program 1 times [2023-12-05 21:10:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:33,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228923142] [2023-12-05 21:10:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:33,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:33,923 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:10:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228923142] [2023-12-05 21:10:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228923142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:33,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:33,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:10:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273605220] [2023-12-05 21:10:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:33,924 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:10:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:33,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:10:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:10:33,928 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 194 [2023-12-05 21:10:33,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 218 transitions, 1147 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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:10:33,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:33,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 194 [2023-12-05 21:10:33,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:34,651 INFO L124 PetriNetUnfolderBase]: 2308/5856 cut-off events. [2023-12-05 21:10:34,652 INFO L125 PetriNetUnfolderBase]: For 3326/3874 co-relation queries the response was YES. [2023-12-05 21:10:34,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19235 conditions, 5856 events. 2308/5856 cut-off events. For 3326/3874 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 55739 event pairs, 334 based on Foata normal form. 0/4783 useless extension candidates. Maximal degree in co-relation 19134. Up to 3292 conditions per place. [2023-12-05 21:10:34,686 INFO L140 encePairwiseOnDemand]: 181/194 looper letters, 64 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-12-05 21:10:34,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 935 flow [2023-12-05 21:10:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-12-05 21:10:34,688 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6301546391752577 [2023-12-05 21:10:34,688 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-12-05 21:10:34,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-12-05 21:10:34,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:34,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-12-05 21:10:34,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 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:10:34,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 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:10:34,691 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 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:10:34,692 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -36 predicate places. [2023-12-05 21:10:34,692 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 175 transitions, 935 flow [2023-12-05 21:10:34,692 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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:10:34,692 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:34,692 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] [2023-12-05 21:10:34,692 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:10:34,692 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:34,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:34,693 INFO L85 PathProgramCache]: Analyzing trace with hash -157452824, now seen corresponding path program 1 times [2023-12-05 21:10:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:34,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248536632] [2023-12-05 21:10:34,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:34,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:34,733 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:10:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248536632] [2023-12-05 21:10:34,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248536632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:34,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:34,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839450252] [2023-12-05 21:10:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:34,735 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:34,736 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 194 [2023-12-05 21:10:34,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 175 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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:10:34,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:34,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 194 [2023-12-05 21:10:34,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:35,665 INFO L124 PetriNetUnfolderBase]: 2761/6415 cut-off events. [2023-12-05 21:10:35,665 INFO L125 PetriNetUnfolderBase]: For 7288/8082 co-relation queries the response was YES. [2023-12-05 21:10:35,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25771 conditions, 6415 events. 2761/6415 cut-off events. For 7288/8082 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 59154 event pairs, 354 based on Foata normal form. 2/5152 useless extension candidates. Maximal degree in co-relation 25661. Up to 3750 conditions per place. [2023-12-05 21:10:35,708 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 73 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-12-05 21:10:35,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 175 transitions, 1089 flow [2023-12-05 21:10:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-12-05 21:10:35,710 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6202749140893471 [2023-12-05 21:10:35,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-12-05 21:10:35,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-12-05 21:10:35,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:35,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-12-05 21:10:35,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:10:35,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:35,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:35,713 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -35 predicate places. [2023-12-05 21:10:35,713 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 175 transitions, 1089 flow [2023-12-05 21:10:35,713 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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:10:35,713 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:35,714 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] [2023-12-05 21:10:35,714 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:10:35,714 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:35,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -157452823, now seen corresponding path program 1 times [2023-12-05 21:10:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337091798] [2023-12-05 21:10:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:35,785 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:10:35,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:35,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337091798] [2023-12-05 21:10:35,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337091798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:35,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:35,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:35,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675731167] [2023-12-05 21:10:35,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:35,788 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:35,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:35,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:35,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:35,789 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 194 [2023-12-05 21:10:35,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 175 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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:10:35,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:35,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 194 [2023-12-05 21:10:35,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:36,654 INFO L124 PetriNetUnfolderBase]: 2760/6196 cut-off events. [2023-12-05 21:10:36,654 INFO L125 PetriNetUnfolderBase]: For 10747/11973 co-relation queries the response was YES. [2023-12-05 21:10:36,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29434 conditions, 6196 events. 2760/6196 cut-off events. For 10747/11973 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 55878 event pairs, 250 based on Foata normal form. 2/4933 useless extension candidates. Maximal degree in co-relation 29316. Up to 3750 conditions per place. [2023-12-05 21:10:36,694 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 88 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-12-05 21:10:36,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 194 transitions, 1501 flow [2023-12-05 21:10:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-12-05 21:10:36,697 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6426116838487973 [2023-12-05 21:10:36,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-12-05 21:10:36,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-12-05 21:10:36,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:36,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-12-05 21:10:36,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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:10:36,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:36,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:36,700 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -34 predicate places. [2023-12-05 21:10:36,700 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 194 transitions, 1501 flow [2023-12-05 21:10:36,700 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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:10:36,700 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:36,700 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] [2023-12-05 21:10:36,700 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:10:36,700 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:36,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:36,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2038814828, now seen corresponding path program 1 times [2023-12-05 21:10:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286251423] [2023-12-05 21:10:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:36,735 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:10:36,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286251423] [2023-12-05 21:10:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286251423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:36,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893118475] [2023-12-05 21:10:36,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:36,736 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:36,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:36,737 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 194 [2023-12-05 21:10:36,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 194 transitions, 1501 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:10:36,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:36,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 194 [2023-12-05 21:10:36,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:37,680 INFO L124 PetriNetUnfolderBase]: 3204/6996 cut-off events. [2023-12-05 21:10:37,681 INFO L125 PetriNetUnfolderBase]: For 20850/21330 co-relation queries the response was YES. [2023-12-05 21:10:37,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37484 conditions, 6996 events. 3204/6996 cut-off events. For 20850/21330 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 63157 event pairs, 240 based on Foata normal form. 8/5562 useless extension candidates. Maximal degree in co-relation 37357. Up to 4222 conditions per place. [2023-12-05 21:10:37,728 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 96 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-12-05 21:10:37,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 197 transitions, 1745 flow [2023-12-05 21:10:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-12-05 21:10:37,730 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6185567010309279 [2023-12-05 21:10:37,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-12-05 21:10:37,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-12-05 21:10:37,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:37,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-12-05 21:10:37,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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:10:37,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:37,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:37,732 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -33 predicate places. [2023-12-05 21:10:37,733 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 197 transitions, 1745 flow [2023-12-05 21:10:37,733 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:10:37,733 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:37,733 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] [2023-12-05 21:10:37,733 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:10:37,733 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:37,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2038814827, now seen corresponding path program 1 times [2023-12-05 21:10:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137362370] [2023-12-05 21:10:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:37,784 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:10:37,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:37,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137362370] [2023-12-05 21:10:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137362370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:37,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:37,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924100750] [2023-12-05 21:10:37,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:37,785 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:37,785 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 194 [2023-12-05 21:10:37,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 197 transitions, 1745 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:10:37,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:37,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 194 [2023-12-05 21:10:37,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:38,732 INFO L124 PetriNetUnfolderBase]: 3194/6810 cut-off events. [2023-12-05 21:10:38,732 INFO L125 PetriNetUnfolderBase]: For 28240/28604 co-relation queries the response was YES. [2023-12-05 21:10:38,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41515 conditions, 6810 events. 3194/6810 cut-off events. For 28240/28604 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 60948 event pairs, 136 based on Foata normal form. 8/5376 useless extension candidates. Maximal degree in co-relation 41380. Up to 4222 conditions per place. [2023-12-05 21:10:38,781 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 111 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2023-12-05 21:10:38,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 216 transitions, 2281 flow [2023-12-05 21:10:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-12-05 21:10:38,783 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6408934707903781 [2023-12-05 21:10:38,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-12-05 21:10:38,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-12-05 21:10:38,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:38,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-12-05 21:10:38,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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:10:38,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:38,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:38,785 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -32 predicate places. [2023-12-05 21:10:38,785 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 216 transitions, 2281 flow [2023-12-05 21:10:38,786 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:10:38,786 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:38,786 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] [2023-12-05 21:10:38,786 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:10:38,786 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:38,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1886378719, now seen corresponding path program 1 times [2023-12-05 21:10:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28835288] [2023-12-05 21:10:38,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:38,896 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:10:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28835288] [2023-12-05 21:10:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28835288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:38,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367516682] [2023-12-05 21:10:38,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:38,897 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:38,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:38,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:38,898 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 194 [2023-12-05 21:10:38,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 216 transitions, 2281 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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:10:38,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:38,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 194 [2023-12-05 21:10:38,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:39,860 INFO L124 PetriNetUnfolderBase]: 3158/6796 cut-off events. [2023-12-05 21:10:39,860 INFO L125 PetriNetUnfolderBase]: For 35491/35903 co-relation queries the response was YES. [2023-12-05 21:10:39,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44583 conditions, 6796 events. 3158/6796 cut-off events. For 35491/35903 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 61350 event pairs, 104 based on Foata normal form. 0/5378 useless extension candidates. Maximal degree in co-relation 44445. Up to 4222 conditions per place. [2023-12-05 21:10:39,915 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 147 selfloop transitions, 10 changer transitions 0/274 dead transitions. [2023-12-05 21:10:39,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 274 transitions, 3639 flow [2023-12-05 21:10:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-12-05 21:10:39,918 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6993127147766323 [2023-12-05 21:10:39,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-12-05 21:10:39,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-12-05 21:10:39,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:39,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-12-05 21:10:39,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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:10:39,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:39,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:39,920 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -30 predicate places. [2023-12-05 21:10:39,920 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 274 transitions, 3639 flow [2023-12-05 21:10:39,921 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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:10:39,921 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:39,921 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] [2023-12-05 21:10:39,921 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:10:39,921 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:39,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash -332039603, now seen corresponding path program 1 times [2023-12-05 21:10:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916942731] [2023-12-05 21:10:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:40,003 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:10:40,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:40,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916942731] [2023-12-05 21:10:40,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916942731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:40,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:40,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060051407] [2023-12-05 21:10:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:40,005 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:40,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:40,007 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 194 [2023-12-05 21:10:40,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 274 transitions, 3639 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:10:40,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:40,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 194 [2023-12-05 21:10:40,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:41,146 INFO L124 PetriNetUnfolderBase]: 3379/7774 cut-off events. [2023-12-05 21:10:41,146 INFO L125 PetriNetUnfolderBase]: For 48852/49316 co-relation queries the response was YES. [2023-12-05 21:10:41,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53025 conditions, 7774 events. 3379/7774 cut-off events. For 48852/49316 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 76579 event pairs, 96 based on Foata normal form. 16/6388 useless extension candidates. Maximal degree in co-relation 52876. Up to 4661 conditions per place. [2023-12-05 21:10:41,335 INFO L140 encePairwiseOnDemand]: 189/194 looper letters, 184 selfloop transitions, 12 changer transitions 0/296 dead transitions. [2023-12-05 21:10:41,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 296 transitions, 4447 flow [2023-12-05 21:10:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-12-05 21:10:41,337 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.627147766323024 [2023-12-05 21:10:41,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-12-05 21:10:41,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-12-05 21:10:41,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:41,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-12-05 21:10:41,338 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:10:41,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:41,339 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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:10:41,340 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -29 predicate places. [2023-12-05 21:10:41,340 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 296 transitions, 4447 flow [2023-12-05 21:10:41,341 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:10:41,341 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:41,341 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] [2023-12-05 21:10:41,341 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:10:41,341 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:41,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1014871212, now seen corresponding path program 1 times [2023-12-05 21:10:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400985612] [2023-12-05 21:10:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:41,533 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:10:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400985612] [2023-12-05 21:10:41,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400985612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:41,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:41,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:10:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576115383] [2023-12-05 21:10:41,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:41,534 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:10:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:41,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:10:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:10:41,535 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 194 [2023-12-05 21:10:41,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 296 transitions, 4447 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 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:10:41,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:41,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 194 [2023-12-05 21:10:41,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:42,589 INFO L124 PetriNetUnfolderBase]: 3351/7514 cut-off events. [2023-12-05 21:10:42,589 INFO L125 PetriNetUnfolderBase]: For 61576/62300 co-relation queries the response was YES. [2023-12-05 21:10:42,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56049 conditions, 7514 events. 3351/7514 cut-off events. For 61576/62300 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 72891 event pairs, 72 based on Foata normal form. 16/6152 useless extension candidates. Maximal degree in co-relation 55890. Up to 4661 conditions per place. [2023-12-05 21:10:42,662 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 176 selfloop transitions, 10 changer transitions 0/295 dead transitions. [2023-12-05 21:10:42,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 295 transitions, 4797 flow [2023-12-05 21:10:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-12-05 21:10:42,664 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6224226804123711 [2023-12-05 21:10:42,664 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-12-05 21:10:42,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-12-05 21:10:42,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:42,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-12-05 21:10:42,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:42,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 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:10:42,666 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 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:10:42,666 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -27 predicate places. [2023-12-05 21:10:42,666 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 295 transitions, 4797 flow [2023-12-05 21:10:42,667 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 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:10:42,667 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:42,667 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] [2023-12-05 21:10:42,667 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:10:42,667 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:42,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:42,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1874602417, now seen corresponding path program 1 times [2023-12-05 21:10:42,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:42,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084767147] [2023-12-05 21:10:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:42,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:42,921 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:10:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:42,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084767147] [2023-12-05 21:10:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084767147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:10:42,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323553860] [2023-12-05 21:10:42,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:42,922 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:10:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:10:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:10:42,923 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 194 [2023-12-05 21:10:42,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 295 transitions, 4797 flow. Second operand has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 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:10:42,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:42,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 194 [2023-12-05 21:10:42,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:43,872 INFO L124 PetriNetUnfolderBase]: 2589/6082 cut-off events. [2023-12-05 21:10:43,872 INFO L125 PetriNetUnfolderBase]: For 62824/63328 co-relation queries the response was YES. [2023-12-05 21:10:43,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47902 conditions, 6082 events. 2589/6082 cut-off events. For 62824/63328 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 57450 event pairs, 88 based on Foata normal form. 0/5080 useless extension candidates. Maximal degree in co-relation 47732. Up to 3675 conditions per place. [2023-12-05 21:10:43,928 INFO L140 encePairwiseOnDemand]: 174/194 looper letters, 171 selfloop transitions, 40 changer transitions 0/307 dead transitions. [2023-12-05 21:10:43,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 307 transitions, 5507 flow [2023-12-05 21:10:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:10:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:10:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 691 transitions. [2023-12-05 21:10:43,930 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5936426116838488 [2023-12-05 21:10:43,930 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 691 transitions. [2023-12-05 21:10:43,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 691 transitions. [2023-12-05 21:10:43,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:43,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 691 transitions. [2023-12-05 21:10:43,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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:10:43,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 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:10:43,933 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 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:10:43,933 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -22 predicate places. [2023-12-05 21:10:43,934 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 307 transitions, 5507 flow [2023-12-05 21:10:43,934 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 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:10:43,934 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:43,934 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] [2023-12-05 21:10:43,934 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:10:43,934 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:43,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1903340937, now seen corresponding path program 1 times [2023-12-05 21:10:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:43,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103741310] [2023-12-05 21:10:43,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:43,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:44,379 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:10:44,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:44,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103741310] [2023-12-05 21:10:44,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103741310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:44,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:44,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-05 21:10:44,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650173602] [2023-12-05 21:10:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:44,380 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:10:44,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:44,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:10:44,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:10:44,382 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 194 [2023-12-05 21:10:44,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 307 transitions, 5507 flow. Second operand has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 13 states have internal predecessors, (1323), 0 states have call successors, (0), 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:10:44,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:44,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 194 [2023-12-05 21:10:44,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:45,313 INFO L124 PetriNetUnfolderBase]: 1827/4540 cut-off events. [2023-12-05 21:10:45,313 INFO L125 PetriNetUnfolderBase]: For 54679/55667 co-relation queries the response was YES. [2023-12-05 21:10:45,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37960 conditions, 4540 events. 1827/4540 cut-off events. For 54679/55667 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 41293 event pairs, 72 based on Foata normal form. 32/3962 useless extension candidates. Maximal degree in co-relation 37778. Up to 2689 conditions per place. [2023-12-05 21:10:45,358 INFO L140 encePairwiseOnDemand]: 171/194 looper letters, 176 selfloop transitions, 48 changer transitions 0/318 dead transitions. [2023-12-05 21:10:45,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 318 transitions, 6133 flow [2023-12-05 21:10:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:10:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:10:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1420 transitions. [2023-12-05 21:10:45,362 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.56304520222046 [2023-12-05 21:10:45,362 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1420 transitions. [2023-12-05 21:10:45,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1420 transitions. [2023-12-05 21:10:45,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:45,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1420 transitions. [2023-12-05 21:10:45,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 109.23076923076923) internal successors, (1420), 13 states have internal predecessors, (1420), 0 states have call successors, (0), 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:10:45,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 194.0) internal successors, (2716), 14 states have internal predecessors, (2716), 0 states have call successors, (0), 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:10:45,367 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 194.0) internal successors, (2716), 14 states have internal predecessors, (2716), 0 states have call successors, (0), 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:10:45,368 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -10 predicate places. [2023-12-05 21:10:45,368 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 318 transitions, 6133 flow [2023-12-05 21:10:45,369 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 13 states have internal predecessors, (1323), 0 states have call successors, (0), 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:10:45,369 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:45,369 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] [2023-12-05 21:10:45,369 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:10:45,369 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-12-05 21:10:45,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash 542742766, now seen corresponding path program 1 times [2023-12-05 21:10:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394805715] [2023-12-05 21:10:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:45,719 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:10:45,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:45,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394805715] [2023-12-05 21:10:45,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394805715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:45,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:45,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:10:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124360990] [2023-12-05 21:10:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:45,721 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:10:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:10:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:10:45,722 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 194 [2023-12-05 21:10:45,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 318 transitions, 6133 flow. Second operand has 11 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 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:10:45,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:45,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 194 [2023-12-05 21:10:45,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:46,287 INFO L124 PetriNetUnfolderBase]: 908/2238 cut-off events. [2023-12-05 21:10:46,287 INFO L125 PetriNetUnfolderBase]: For 33253/34181 co-relation queries the response was YES. [2023-12-05 21:10:46,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19789 conditions, 2238 events. 908/2238 cut-off events. For 33253/34181 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15527 event pairs, 0 based on Foata normal form. 0/2204 useless extension candidates. Maximal degree in co-relation 19596. Up to 1098 conditions per place. [2023-12-05 21:10:46,298 INFO L140 encePairwiseOnDemand]: 178/194 looper letters, 0 selfloop transitions, 0 changer transitions 292/292 dead transitions. [2023-12-05 21:10:46,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 292 transitions, 5801 flow [2023-12-05 21:10:46,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:10:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:10:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 961 transitions. [2023-12-05 21:10:46,301 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5504009163802979 [2023-12-05 21:10:46,301 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 961 transitions. [2023-12-05 21:10:46,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 961 transitions. [2023-12-05 21:10:46,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:46,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 961 transitions. [2023-12-05 21:10:46,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 0 states have call successors, (0), 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:10:46,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 0 states have call successors, (0), 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:10:46,305 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 0 states have call successors, (0), 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:10:46,305 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, -10 predicate places. [2023-12-05 21:10:46,305 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 292 transitions, 5801 flow [2023-12-05 21:10:46,305 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 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:10:46,317 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe025_rmo.i_BEv2_AllErrorsAtOnce [2023-12-05 21:10:46,368 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 99 remaining) [2023-12-05 21:10:46,368 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 99 remaining) [2023-12-05 21:10:46,369 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 99 remaining) [2023-12-05 21:10:46,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 99 remaining) [2023-12-05 21:10:46,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 99 remaining) [2023-12-05 21:10:46,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 99 remaining) [2023-12-05 21:10:46,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 99 remaining) [2023-12-05 21:10:46,374 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 99 remaining) [2023-12-05 21:10:46,375 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 99 remaining) [2023-12-05 21:10:46,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 99 remaining) [2023-12-05 21:10:46,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 99 remaining) [2023-12-05 21:10:46,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 99 remaining) [2023-12-05 21:10:46,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 99 remaining) [2023-12-05 21:10:46,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 99 remaining) [2023-12-05 21:10:46,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 99 remaining) [2023-12-05 21:10:46,377 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:10:46,377 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:46,382 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:10:46,382 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:10:46,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:10:46 BasicIcfg [2023-12-05 21:10:46,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:10:46,389 INFO L158 Benchmark]: Toolchain (without parser) took 26306.72ms. Allocated memory was 345.0MB in the beginning and 5.3GB in the end (delta: 4.9GB). Free memory was 298.8MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2023-12-05 21:10:46,389 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:10:46,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.83ms. Allocated memory is still 345.0MB. Free memory was 298.8MB in the beginning and 273.0MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-05 21:10:46,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.76ms. Allocated memory is still 345.0MB. Free memory was 273.0MB in the beginning and 270.0MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:46,389 INFO L158 Benchmark]: Boogie Preprocessor took 38.77ms. Allocated memory is still 345.0MB. Free memory was 270.0MB in the beginning and 267.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:46,390 INFO L158 Benchmark]: RCFGBuilder took 1026.54ms. Allocated memory is still 345.0MB. Free memory was 267.3MB in the beginning and 191.2MB in the end (delta: 76.1MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2023-12-05 21:10:46,390 INFO L158 Benchmark]: TraceAbstraction took 24743.81ms. Allocated memory was 345.0MB in the beginning and 5.3GB in the end (delta: 4.9GB). Free memory was 190.2MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-12-05 21:10:46,391 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.09ms. Allocated memory is still 211.8MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.83ms. Allocated memory is still 345.0MB. Free memory was 298.8MB in the beginning and 273.0MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.76ms. Allocated memory is still 345.0MB. Free memory was 273.0MB in the beginning and 270.0MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.77ms. Allocated memory is still 345.0MB. Free memory was 270.0MB in the beginning and 267.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1026.54ms. Allocated memory is still 345.0MB. Free memory was 267.3MB in the beginning and 191.2MB in the end (delta: 76.1MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. * TraceAbstraction took 24743.81ms. Allocated memory was 345.0MB in the beginning and 5.3GB in the end (delta: 4.9GB). Free memory was 190.2MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 2.7GB. 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 - 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, 256 locations, 99 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: 24.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 712 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 712 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1112 IncrementalHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 134 mSDtfsCounter, 1112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6133occurred in iteration=13, InterpolantAutomatonStates: 67, 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.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1032 ConstructedInterpolants, 0 QuantifiedInterpolants, 4655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 60 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:10:46,407 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...