/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/thin002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:10:54,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:10:54,788 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:54,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:10:54,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:10:54,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:10:54,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:10:54,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:10:54,806 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:10:54,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:10:54,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:10:54,807 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:10:54,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:10:54,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:10:54,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:10:54,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:10:54,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:10:54,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:10:54,809 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:10:54,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:10:54,809 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:10:54,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:10:54,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:10:54,810 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:10:54,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:10:54,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:54,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:10:54,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:10:54,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:10:54,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:10:54,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:10:54,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:10:54,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:10:54,812 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:54,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:10:54,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:10:54,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:10:54,971 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:10:54,972 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:10:54,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-12-05 21:10:56,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:10:56,175 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:10:56,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-12-05 21:10:56,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93774b3f4/ba658ba63d9d489c839a30cd64eeddba/FLAGbfb40bca0 [2023-12-05 21:10:56,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93774b3f4/ba658ba63d9d489c839a30cd64eeddba [2023-12-05 21:10:56,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:10:56,203 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:10:56,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:56,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:10:56,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:10:56,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ebcea18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56, skipping insertion in model container [2023-12-05 21:10:56,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,241 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:10:56,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:56,546 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:10:56,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:56,616 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:56,616 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:56,621 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:10:56,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56 WrapperNode [2023-12-05 21:10:56,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:56,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:56,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:10:56,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:10:56,630 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:56" (1/1) ... [2023-12-05 21:10:56,642 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:56" (1/1) ... [2023-12-05 21:10:56,660 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 205 [2023-12-05 21:10:56,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:56,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:10:56,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:10:56,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:10:56,679 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:56" (1/1) ... [2023-12-05 21:10:56,679 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:56" (1/1) ... [2023-12-05 21:10:56,683 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:56" (1/1) ... [2023-12-05 21:10:56,683 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:56" (1/1) ... [2023-12-05 21:10:56,691 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:56" (1/1) ... [2023-12-05 21:10:56,705 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:56" (1/1) ... [2023-12-05 21:10:56,707 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:56" (1/1) ... [2023-12-05 21:10:56,709 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:56" (1/1) ... [2023-12-05 21:10:56,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:10:56,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:10:56,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:10:56,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:10:56,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:56,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:10:56,736 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:56,769 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:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:10:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:10:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:10:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:10:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:10:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:10:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:10:56,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:10:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:10:56,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:10:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:10:56,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:10:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:10:56,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:10:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:10:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:10:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:10:56,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:10:56,776 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:56,931 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:10:56,933 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:10:57,376 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:10:57,633 WARN L1821 r$LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-12-05 21:10:57,680 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:10:57,681 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:10:57,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:57 BoogieIcfgContainer [2023-12-05 21:10:57,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:10:57,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:10:57,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:10:57,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:10:57,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:10:56" (1/3) ... [2023-12-05 21:10:57,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2054d7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:57, skipping insertion in model container [2023-12-05 21:10:57,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (2/3) ... [2023-12-05 21:10:57,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2054d7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:57, skipping insertion in model container [2023-12-05 21:10:57,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:57" (3/3) ... [2023-12-05 21:10:57,688 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2023-12-05 21:10:57,701 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:10:57,701 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-12-05 21:10:57,701 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:10:57,843 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:10:57,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 204 transitions, 424 flow [2023-12-05 21:10:57,955 INFO L124 PetriNetUnfolderBase]: 12/200 cut-off events. [2023-12-05 21:10:57,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:57,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 200 events. 12/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 272 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-12-05 21:10:57,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 204 transitions, 424 flow [2023-12-05 21:10:57,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 200 transitions, 412 flow [2023-12-05 21:10:57,983 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:10:57,990 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;@4a683506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:10:57,990 INFO L363 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-12-05 21:10:58,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:10:58,005 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2023-12-05 21:10:58,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:58,006 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:58,006 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:58,007 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:10:58,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 487010810, now seen corresponding path program 1 times [2023-12-05 21:10:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:58,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949610551] [2023-12-05 21:10:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:58,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:58,329 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:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:58,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949610551] [2023-12-05 21:10:58,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949610551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:58,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:58,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361864865] [2023-12-05 21:10:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:58,338 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:58,364 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 204 [2023-12-05 21:10:58,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 200 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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:58,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:58,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 204 [2023-12-05 21:10:58,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:59,412 INFO L124 PetriNetUnfolderBase]: 1717/3999 cut-off events. [2023-12-05 21:10:59,413 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-12-05 21:10:59,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6731 conditions, 3999 events. 1717/3999 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 31486 event pairs, 952 based on Foata normal form. 133/2322 useless extension candidates. Maximal degree in co-relation 6648. Up to 1621 conditions per place. [2023-12-05 21:10:59,448 INFO L140 encePairwiseOnDemand]: 176/204 looper letters, 63 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-12-05 21:10:59,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 186 transitions, 514 flow [2023-12-05 21:10:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-12-05 21:10:59,462 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8071895424836601 [2023-12-05 21:10:59,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-12-05 21:10:59,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-12-05 21:10:59,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:59,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-12-05 21:10:59,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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:59,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:59,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:59,478 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -16 predicate places. [2023-12-05 21:10:59,478 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 186 transitions, 514 flow [2023-12-05 21:10:59,479 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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:59,479 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:59,479 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:59,479 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:10:59,479 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:10:59,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 487010811, now seen corresponding path program 1 times [2023-12-05 21:10:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100763686] [2023-12-05 21:10:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:59,576 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:59,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:59,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100763686] [2023-12-05 21:10:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100763686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:59,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:59,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593459665] [2023-12-05 21:10:59,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:59,578 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:59,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:59,579 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2023-12-05 21:10:59,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 186 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:59,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:59,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2023-12-05 21:10:59,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:00,243 INFO L124 PetriNetUnfolderBase]: 1723/4012 cut-off events. [2023-12-05 21:11:00,244 INFO L125 PetriNetUnfolderBase]: For 361/895 co-relation queries the response was YES. [2023-12-05 21:11:00,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9271 conditions, 4012 events. 1723/4012 cut-off events. For 361/895 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 31650 event pairs, 958 based on Foata normal form. 0/2198 useless extension candidates. Maximal degree in co-relation 9182. Up to 1806 conditions per place. [2023-12-05 21:11:00,283 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 73 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2023-12-05 21:11:00,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 200 transitions, 720 flow [2023-12-05 21:11:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-12-05 21:11:00,285 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7418300653594772 [2023-12-05 21:11:00,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-12-05 21:11:00,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-12-05 21:11:00,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:00,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-12-05 21:11:00,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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:11:00,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:00,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:00,289 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -15 predicate places. [2023-12-05 21:11:00,289 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 200 transitions, 720 flow [2023-12-05 21:11:00,289 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:11:00,289 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:00,289 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:11:00,290 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:11:00,290 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:00,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1002834518, now seen corresponding path program 1 times [2023-12-05 21:11:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227355227] [2023-12-05 21:11:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:00,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:00,339 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:11:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227355227] [2023-12-05 21:11:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227355227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056401142] [2023-12-05 21:11:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:00,340 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:00,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 204 [2023-12-05 21:11:00,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 200 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:00,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:00,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 204 [2023-12-05 21:11:00,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:01,147 INFO L124 PetriNetUnfolderBase]: 1840/4128 cut-off events. [2023-12-05 21:11:01,147 INFO L125 PetriNetUnfolderBase]: For 1078/2176 co-relation queries the response was YES. [2023-12-05 21:11:01,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12449 conditions, 4128 events. 1840/4128 cut-off events. For 1078/2176 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32029 event pairs, 958 based on Foata normal form. 1/2230 useless extension candidates. Maximal degree in co-relation 12351. Up to 1806 conditions per place. [2023-12-05 21:11:01,190 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 77 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2023-12-05 21:11:01,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 199 transitions, 874 flow [2023-12-05 21:11:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-12-05 21:11:01,192 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7287581699346405 [2023-12-05 21:11:01,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-12-05 21:11:01,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-12-05 21:11:01,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:01,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-12-05 21:11:01,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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:11:01,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:01,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:01,195 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -14 predicate places. [2023-12-05 21:11:01,196 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 199 transitions, 874 flow [2023-12-05 21:11:01,196 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,196 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:01,196 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:11:01,196 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:11:01,196 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:01,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1002834519, now seen corresponding path program 1 times [2023-12-05 21:11:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690661675] [2023-12-05 21:11:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:01,262 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:11:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:01,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690661675] [2023-12-05 21:11:01,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690661675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:01,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:01,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535560853] [2023-12-05 21:11:01,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:01,264 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:01,265 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2023-12-05 21:11:01,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 199 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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:11:01,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:01,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2023-12-05 21:11:01,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:02,063 INFO L124 PetriNetUnfolderBase]: 1840/4127 cut-off events. [2023-12-05 21:11:02,063 INFO L125 PetriNetUnfolderBase]: For 1957/3619 co-relation queries the response was YES. [2023-12-05 21:11:02,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15084 conditions, 4127 events. 1840/4127 cut-off events. For 1957/3619 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32051 event pairs, 958 based on Foata normal form. 1/2229 useless extension candidates. Maximal degree in co-relation 14978. Up to 2036 conditions per place. [2023-12-05 21:11:02,104 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 87 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2023-12-05 21:11:02,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 213 transitions, 1166 flow [2023-12-05 21:11:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-12-05 21:11:02,106 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7401960784313726 [2023-12-05 21:11:02,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-12-05 21:11:02,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-12-05 21:11:02,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:02,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-12-05 21:11:02,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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:11:02,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:02,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:02,109 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -13 predicate places. [2023-12-05 21:11:02,109 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 213 transitions, 1166 flow [2023-12-05 21:11:02,110 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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:11:02,110 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:02,110 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] [2023-12-05 21:11:02,110 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:11:02,110 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:02,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash 717794565, now seen corresponding path program 1 times [2023-12-05 21:11:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:02,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012893263] [2023-12-05 21:11:02,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:02,216 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:11:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012893263] [2023-12-05 21:11:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012893263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:02,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103527461] [2023-12-05 21:11:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:02,218 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:02,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:02,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:02,219 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 204 [2023-12-05 21:11:02,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 213 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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:11:02,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:02,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 204 [2023-12-05 21:11:02,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:03,039 INFO L124 PetriNetUnfolderBase]: 1957/4243 cut-off events. [2023-12-05 21:11:03,039 INFO L125 PetriNetUnfolderBase]: For 3640/5866 co-relation queries the response was YES. [2023-12-05 21:11:03,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18611 conditions, 4243 events. 1957/4243 cut-off events. For 3640/5866 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32466 event pairs, 958 based on Foata normal form. 1/2260 useless extension candidates. Maximal degree in co-relation 18496. Up to 2036 conditions per place. [2023-12-05 21:11:03,082 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 91 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2023-12-05 21:11:03,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 212 transitions, 1346 flow [2023-12-05 21:11:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-12-05 21:11:03,084 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7271241830065359 [2023-12-05 21:11:03,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-12-05 21:11:03,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-12-05 21:11:03,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:03,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-12-05 21:11:03,085 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:11:03,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:03,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:03,087 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -12 predicate places. [2023-12-05 21:11:03,087 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 212 transitions, 1346 flow [2023-12-05 21:11:03,088 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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:11:03,088 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:03,088 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] [2023-12-05 21:11:03,088 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:11:03,088 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:03,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash 717794566, now seen corresponding path program 1 times [2023-12-05 21:11:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:03,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520814078] [2023-12-05 21:11:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:03,143 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:11:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:03,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520814078] [2023-12-05 21:11:03,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520814078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:03,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:03,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335258164] [2023-12-05 21:11:03,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:03,145 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:03,146 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2023-12-05 21:11:03,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 212 transitions, 1346 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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:11:03,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:03,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2023-12-05 21:11:03,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:03,925 INFO L124 PetriNetUnfolderBase]: 1957/4242 cut-off events. [2023-12-05 21:11:03,925 INFO L125 PetriNetUnfolderBase]: For 5231/8021 co-relation queries the response was YES. [2023-12-05 21:11:03,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21361 conditions, 4242 events. 1957/4242 cut-off events. For 5231/8021 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32406 event pairs, 958 based on Foata normal form. 1/2259 useless extension candidates. Maximal degree in co-relation 21238. Up to 2266 conditions per place. [2023-12-05 21:11:04,055 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 101 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2023-12-05 21:11:04,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 226 transitions, 1724 flow [2023-12-05 21:11:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-12-05 21:11:04,057 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2023-12-05 21:11:04,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-12-05 21:11:04,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-12-05 21:11:04,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:04,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-12-05 21:11:04,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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:11:04,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:04,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:04,062 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -11 predicate places. [2023-12-05 21:11:04,063 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 226 transitions, 1724 flow [2023-12-05 21:11:04,063 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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:11:04,063 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:04,063 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:11:04,063 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:11:04,063 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:04,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash -979816136, now seen corresponding path program 1 times [2023-12-05 21:11:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915787390] [2023-12-05 21:11:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:04,171 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:11:04,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915787390] [2023-12-05 21:11:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915787390] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202044589] [2023-12-05 21:11:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:04,176 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:04,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:04,177 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 204 [2023-12-05 21:11:04,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 226 transitions, 1724 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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:11:04,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:04,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 204 [2023-12-05 21:11:04,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:05,190 INFO L124 PetriNetUnfolderBase]: 2612/5329 cut-off events. [2023-12-05 21:11:05,192 INFO L125 PetriNetUnfolderBase]: For 8426/35030 co-relation queries the response was YES. [2023-12-05 21:11:05,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31420 conditions, 5329 events. 2612/5329 cut-off events. For 8426/35030 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 41966 event pairs, 515 based on Foata normal form. 0/2744 useless extension candidates. Maximal degree in co-relation 31293. Up to 2955 conditions per place. [2023-12-05 21:11:05,255 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 132 selfloop transitions, 21 changer transitions 0/290 dead transitions. [2023-12-05 21:11:05,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 290 transitions, 2929 flow [2023-12-05 21:11:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-12-05 21:11:05,258 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.815359477124183 [2023-12-05 21:11:05,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-12-05 21:11:05,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-12-05 21:11:05,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:05,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-12-05 21:11:05,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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:11:05,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:05,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:05,261 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -9 predicate places. [2023-12-05 21:11:05,261 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 290 transitions, 2929 flow [2023-12-05 21:11:05,261 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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:11:05,261 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:05,261 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:11:05,262 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:11:05,262 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:05,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -979816134, now seen corresponding path program 1 times [2023-12-05 21:11:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033151828] [2023-12-05 21:11:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:05,532 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:11:05,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:05,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033151828] [2023-12-05 21:11:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033151828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:05,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:11:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612109072] [2023-12-05 21:11:05,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:05,535 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:11:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:05,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:11:05,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:11:05,537 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 204 [2023-12-05 21:11:05,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 290 transitions, 2929 flow. Second operand has 7 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 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:11:05,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:05,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 204 [2023-12-05 21:11:05,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:06,427 INFO L124 PetriNetUnfolderBase]: 1856/3996 cut-off events. [2023-12-05 21:11:06,427 INFO L125 PetriNetUnfolderBase]: For 10469/17219 co-relation queries the response was YES. [2023-12-05 21:11:06,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25298 conditions, 3996 events. 1856/3996 cut-off events. For 10469/17219 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 29996 event pairs, 231 based on Foata normal form. 0/2467 useless extension candidates. Maximal degree in co-relation 25160. Up to 2104 conditions per place. [2023-12-05 21:11:06,476 INFO L140 encePairwiseOnDemand]: 186/204 looper letters, 190 selfloop transitions, 28 changer transitions 0/334 dead transitions. [2023-12-05 21:11:06,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 334 transitions, 4043 flow [2023-12-05 21:11:06,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:11:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:11:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2023-12-05 21:11:06,479 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6838235294117647 [2023-12-05 21:11:06,479 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2023-12-05 21:11:06,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2023-12-05 21:11:06,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:06,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2023-12-05 21:11:06,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 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:11:06,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 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:11:06,482 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 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:11:06,483 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -6 predicate places. [2023-12-05 21:11:06,483 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 334 transitions, 4043 flow [2023-12-05 21:11:06,483 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 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:11:06,483 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:06,483 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:11:06,483 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:11:06,483 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:06,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash -979816133, now seen corresponding path program 1 times [2023-12-05 21:11:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733682726] [2023-12-05 21:11:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:06,909 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:11:06,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:06,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733682726] [2023-12-05 21:11:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733682726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:06,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:06,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:11:06,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531553844] [2023-12-05 21:11:06,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:06,911 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:11:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:11:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:11:06,913 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 204 [2023-12-05 21:11:06,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 334 transitions, 4043 flow. Second operand has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 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:11:06,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:06,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 204 [2023-12-05 21:11:06,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:07,345 INFO L124 PetriNetUnfolderBase]: 630/1586 cut-off events. [2023-12-05 21:11:07,346 INFO L125 PetriNetUnfolderBase]: For 7346/8166 co-relation queries the response was YES. [2023-12-05 21:11:07,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10022 conditions, 1586 events. 630/1586 cut-off events. For 7346/8166 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9885 event pairs, 58 based on Foata normal form. 26/1272 useless extension candidates. Maximal degree in co-relation 9873. Up to 848 conditions per place. [2023-12-05 21:11:07,366 INFO L140 encePairwiseOnDemand]: 186/204 looper letters, 107 selfloop transitions, 28 changer transitions 0/252 dead transitions. [2023-12-05 21:11:07,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 252 transitions, 2837 flow [2023-12-05 21:11:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:11:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:11:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2023-12-05 21:11:07,368 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6560457516339869 [2023-12-05 21:11:07,369 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2023-12-05 21:11:07,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2023-12-05 21:11:07,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:07,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2023-12-05 21:11:07,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 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:11:07,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 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:11:07,372 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 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:11:07,373 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -8 predicate places. [2023-12-05 21:11:07,373 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 252 transitions, 2837 flow [2023-12-05 21:11:07,373 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 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:11:07,373 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:07,373 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:11:07,374 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:11:07,374 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:07,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1506409528, now seen corresponding path program 1 times [2023-12-05 21:11:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:07,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447411729] [2023-12-05 21:11:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:07,448 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:11:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447411729] [2023-12-05 21:11:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447411729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:07,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:07,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570623763] [2023-12-05 21:11:07,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:07,453 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:07,454 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2023-12-05 21:11:07,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 252 transitions, 2837 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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:11:07,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:07,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2023-12-05 21:11:07,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:07,879 INFO L124 PetriNetUnfolderBase]: 718/1710 cut-off events. [2023-12-05 21:11:07,880 INFO L125 PetriNetUnfolderBase]: For 11564/11934 co-relation queries the response was YES. [2023-12-05 21:11:07,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11948 conditions, 1710 events. 718/1710 cut-off events. For 11564/11934 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10672 event pairs, 31 based on Foata normal form. 3/1333 useless extension candidates. Maximal degree in co-relation 11791. Up to 938 conditions per place. [2023-12-05 21:11:07,905 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 145 selfloop transitions, 2 changer transitions 6/277 dead transitions. [2023-12-05 21:11:07,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 277 transitions, 3653 flow [2023-12-05 21:11:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-12-05 21:11:07,907 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2023-12-05 21:11:07,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-12-05 21:11:07,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-12-05 21:11:07,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:07,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-12-05 21:11:07,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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:11:07,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:07,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:07,912 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -7 predicate places. [2023-12-05 21:11:07,912 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 277 transitions, 3653 flow [2023-12-05 21:11:07,913 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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:11:07,913 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:07,913 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:11:07,913 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:11:07,913 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:07,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:07,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1506409527, now seen corresponding path program 1 times [2023-12-05 21:11:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:07,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681246004] [2023-12-05 21:11:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:08,051 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:11:08,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:08,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681246004] [2023-12-05 21:11:08,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681246004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:08,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818200006] [2023-12-05 21:11:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:08,053 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:08,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:08,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:08,054 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 204 [2023-12-05 21:11:08,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 277 transitions, 3653 flow. Second operand has 3 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:11:08,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:08,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 204 [2023-12-05 21:11:08,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:08,409 INFO L124 PetriNetUnfolderBase]: 716/1705 cut-off events. [2023-12-05 21:11:08,409 INFO L125 PetriNetUnfolderBase]: For 13997/14431 co-relation queries the response was YES. [2023-12-05 21:11:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13005 conditions, 1705 events. 716/1705 cut-off events. For 13997/14431 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10641 event pairs, 31 based on Foata normal form. 3/1328 useless extension candidates. Maximal degree in co-relation 12839. Up to 943 conditions per place. [2023-12-05 21:11:08,431 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 149 selfloop transitions, 2 changer transitions 6/276 dead transitions. [2023-12-05 21:11:08,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 276 transitions, 3953 flow [2023-12-05 21:11:08,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:11:08,437 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6928104575163399 [2023-12-05 21:11:08,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:11:08,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:11:08,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:08,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:11:08,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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:11:08,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:08,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:08,443 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -6 predicate places. [2023-12-05 21:11:08,443 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 276 transitions, 3953 flow [2023-12-05 21:11:08,443 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:11:08,443 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:08,456 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:11:08,456 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:11:08,456 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:08,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 442873037, now seen corresponding path program 1 times [2023-12-05 21:11:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:08,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414427555] [2023-12-05 21:11:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:08,555 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:11:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414427555] [2023-12-05 21:11:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414427555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:08,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682760309] [2023-12-05 21:11:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:08,556 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:08,557 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 204 [2023-12-05 21:11:08,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 276 transitions, 3953 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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:11:08,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:08,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 204 [2023-12-05 21:11:08,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:08,876 INFO L124 PetriNetUnfolderBase]: 696/1663 cut-off events. [2023-12-05 21:11:08,876 INFO L125 PetriNetUnfolderBase]: For 16301/16829 co-relation queries the response was YES. [2023-12-05 21:11:08,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13455 conditions, 1663 events. 696/1663 cut-off events. For 16301/16829 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10447 event pairs, 19 based on Foata normal form. 3/1302 useless extension candidates. Maximal degree in co-relation 13286. Up to 943 conditions per place. [2023-12-05 21:11:08,897 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 139 selfloop transitions, 28 changer transitions 6/313 dead transitions. [2023-12-05 21:11:08,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 313 transitions, 5187 flow [2023-12-05 21:11:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-12-05 21:11:08,900 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7794117647058824 [2023-12-05 21:11:08,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-12-05 21:11:08,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-12-05 21:11:08,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:08,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-12-05 21:11:08,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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:11:08,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:08,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:08,902 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -4 predicate places. [2023-12-05 21:11:08,903 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 313 transitions, 5187 flow [2023-12-05 21:11:08,903 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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:11:08,903 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:08,903 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:08,903 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:11:08,903 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:08,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash 403369982, now seen corresponding path program 1 times [2023-12-05 21:11:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292630688] [2023-12-05 21:11:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:09,065 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:11:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292630688] [2023-12-05 21:11:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292630688] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:11:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611797233] [2023-12-05 21:11:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:09,066 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:11:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:11:09,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:11:09,067 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 204 [2023-12-05 21:11:09,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 313 transitions, 5187 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 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:11:09,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:09,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 204 [2023-12-05 21:11:09,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:09,497 INFO L124 PetriNetUnfolderBase]: 686/1645 cut-off events. [2023-12-05 21:11:09,498 INFO L125 PetriNetUnfolderBase]: For 19157/19743 co-relation queries the response was YES. [2023-12-05 21:11:09,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14020 conditions, 1645 events. 686/1645 cut-off events. For 19157/19743 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10365 event pairs, 16 based on Foata normal form. 13/1302 useless extension candidates. Maximal degree in co-relation 13841. Up to 943 conditions per place. [2023-12-05 21:11:09,527 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 150 selfloop transitions, 28 changer transitions 6/311 dead transitions. [2023-12-05 21:11:09,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 311 transitions, 5503 flow [2023-12-05 21:11:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:11:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:11:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-12-05 21:11:09,529 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6985294117647058 [2023-12-05 21:11:09,529 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-12-05 21:11:09,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-12-05 21:11:09,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:09,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-12-05 21:11:09,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 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:11:09,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 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:11:09,532 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 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:11:09,532 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -2 predicate places. [2023-12-05 21:11:09,532 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 311 transitions, 5503 flow [2023-12-05 21:11:09,533 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 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:11:09,533 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:09,533 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:09,533 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:11:09,533 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:09,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash 453370427, now seen corresponding path program 1 times [2023-12-05 21:11:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:09,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452937643] [2023-12-05 21:11:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:09,612 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:11:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452937643] [2023-12-05 21:11:09,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452937643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:09,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:09,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:11:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078207759] [2023-12-05 21:11:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:09,613 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:11:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:09,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:11:09,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:11:09,614 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 204 [2023-12-05 21:11:09,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 311 transitions, 5503 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 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:11:09,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:09,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 204 [2023-12-05 21:11:09,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:10,016 INFO L124 PetriNetUnfolderBase]: 717/1818 cut-off events. [2023-12-05 21:11:10,016 INFO L125 PetriNetUnfolderBase]: For 24702/25330 co-relation queries the response was YES. [2023-12-05 21:11:10,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15880 conditions, 1818 events. 717/1818 cut-off events. For 24702/25330 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12488 event pairs, 13 based on Foata normal form. 13/1484 useless extension candidates. Maximal degree in co-relation 15690. Up to 1027 conditions per place. [2023-12-05 21:11:10,041 INFO L140 encePairwiseOnDemand]: 197/204 looper letters, 169 selfloop transitions, 31 changer transitions 19/339 dead transitions. [2023-12-05 21:11:10,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 339 transitions, 6677 flow [2023-12-05 21:11:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-12-05 21:11:10,057 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7009803921568627 [2023-12-05 21:11:10,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-12-05 21:11:10,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-12-05 21:11:10,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:10,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-12-05 21:11:10,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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:11:10,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:10,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:11:10,062 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, -1 predicate places. [2023-12-05 21:11:10,062 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 339 transitions, 6677 flow [2023-12-05 21:11:10,062 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 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:11:10,062 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:10,062 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:10,062 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:11:10,062 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:10,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash 293013172, now seen corresponding path program 1 times [2023-12-05 21:11:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165617640] [2023-12-05 21:11:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:10,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165617640] [2023-12-05 21:11:10,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165617640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:10,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:10,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:11:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003381853] [2023-12-05 21:11:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:10,252 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:11:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:10,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:11:10,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:11:10,253 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 204 [2023-12-05 21:11:10,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 339 transitions, 6677 flow. Second operand has 9 states, 9 states have (on average 125.77777777777777) internal successors, (1132), 9 states have internal predecessors, (1132), 0 states have call successors, (0), 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:11:10,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:10,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 204 [2023-12-05 21:11:10,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:10,766 INFO L124 PetriNetUnfolderBase]: 601/1571 cut-off events. [2023-12-05 21:11:10,767 INFO L125 PetriNetUnfolderBase]: For 25429/26339 co-relation queries the response was YES. [2023-12-05 21:11:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14567 conditions, 1571 events. 601/1571 cut-off events. For 25429/26339 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10438 event pairs, 9 based on Foata normal form. 3/1311 useless extension candidates. Maximal degree in co-relation 14366. Up to 872 conditions per place. [2023-12-05 21:11:10,794 INFO L140 encePairwiseOnDemand]: 187/204 looper letters, 173 selfloop transitions, 38 changer transitions 22/349 dead transitions. [2023-12-05 21:11:10,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 349 transitions, 7443 flow [2023-12-05 21:11:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:11:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:11:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1054 transitions. [2023-12-05 21:11:10,800 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2023-12-05 21:11:10,800 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1054 transitions. [2023-12-05 21:11:10,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1054 transitions. [2023-12-05 21:11:10,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:10,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1054 transitions. [2023-12-05 21:11:10,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.75) internal successors, (1054), 8 states have internal predecessors, (1054), 0 states have call successors, (0), 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:11:10,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 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:11:10,821 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 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:11:10,821 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, 6 predicate places. [2023-12-05 21:11:10,821 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 349 transitions, 7443 flow [2023-12-05 21:11:10,822 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 125.77777777777777) internal successors, (1132), 9 states have internal predecessors, (1132), 0 states have call successors, (0), 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:11:10,822 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:10,822 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:10,822 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:11:10,822 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:10,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1884793958, now seen corresponding path program 1 times [2023-12-05 21:11:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63073556] [2023-12-05 21:11:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:11,323 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:11:11,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:11,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63073556] [2023-12-05 21:11:11,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63073556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:11,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:11,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-05 21:11:11,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020413604] [2023-12-05 21:11:11,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:11,325 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:11:11,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:11,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:11:11,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:11:11,326 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 204 [2023-12-05 21:11:11,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 349 transitions, 7443 flow. Second operand has 14 states, 14 states have (on average 121.07142857142857) internal successors, (1695), 14 states have internal predecessors, (1695), 0 states have call successors, (0), 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:11:11,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:11,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 204 [2023-12-05 21:11:11,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:11,886 INFO L124 PetriNetUnfolderBase]: 485/1385 cut-off events. [2023-12-05 21:11:11,887 INFO L125 PetriNetUnfolderBase]: For 24437/25241 co-relation queries the response was YES. [2023-12-05 21:11:11,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12994 conditions, 1385 events. 485/1385 cut-off events. For 24437/25241 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8821 event pairs, 13 based on Foata normal form. 15/1217 useless extension candidates. Maximal degree in co-relation 12780. Up to 717 conditions per place. [2023-12-05 21:11:11,907 INFO L140 encePairwiseOnDemand]: 184/204 looper letters, 158 selfloop transitions, 67 changer transitions 24/361 dead transitions. [2023-12-05 21:11:11,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 361 transitions, 8157 flow [2023-12-05 21:11:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-05 21:11:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-05 21:11:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2005 transitions. [2023-12-05 21:11:11,911 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6142769607843137 [2023-12-05 21:11:11,912 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2005 transitions. [2023-12-05 21:11:11,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2005 transitions. [2023-12-05 21:11:11,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:11,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2005 transitions. [2023-12-05 21:11:11,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 125.3125) internal successors, (2005), 16 states have internal predecessors, (2005), 0 states have call successors, (0), 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:11:11,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 204.0) internal successors, (3468), 17 states have internal predecessors, (3468), 0 states have call successors, (0), 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:11:11,919 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 204.0) internal successors, (3468), 17 states have internal predecessors, (3468), 0 states have call successors, (0), 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:11:11,920 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, 21 predicate places. [2023-12-05 21:11:11,920 INFO L500 AbstractCegarLoop]: Abstraction has has 222 places, 361 transitions, 8157 flow [2023-12-05 21:11:11,920 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 121.07142857142857) internal successors, (1695), 14 states have internal predecessors, (1695), 0 states have call successors, (0), 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:11:11,921 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:11,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, 1, 1, 1, 1, 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:11:11,921 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:11:11,921 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:11,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1184703312, now seen corresponding path program 1 times [2023-12-05 21:11:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:11,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51554532] [2023-12-05 21:11:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:12,610 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:11:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51554532] [2023-12-05 21:11:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51554532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:12,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:12,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 21:11:12,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411668881] [2023-12-05 21:11:12,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:12,611 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 21:11:12,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 21:11:12,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-05 21:11:12,613 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 204 [2023-12-05 21:11:12,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 361 transitions, 8157 flow. Second operand has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 0 states have call successors, (0), 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:11:12,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:12,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 204 [2023-12-05 21:11:12,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:13,790 INFO L124 PetriNetUnfolderBase]: 1444/3577 cut-off events. [2023-12-05 21:11:13,791 INFO L125 PetriNetUnfolderBase]: For 60043/62367 co-relation queries the response was YES. [2023-12-05 21:11:13,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33202 conditions, 3577 events. 1444/3577 cut-off events. For 60043/62367 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 27260 event pairs, 22 based on Foata normal form. 9/3284 useless extension candidates. Maximal degree in co-relation 32976. Up to 1590 conditions per place. [2023-12-05 21:11:13,836 INFO L140 encePairwiseOnDemand]: 179/204 looper letters, 153 selfloop transitions, 92 changer transitions 433/789 dead transitions. [2023-12-05 21:11:13,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 789 transitions, 22896 flow [2023-12-05 21:11:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-05 21:11:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-12-05 21:11:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2146 transitions. [2023-12-05 21:11:13,858 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.618800461361015 [2023-12-05 21:11:13,858 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2146 transitions. [2023-12-05 21:11:13,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2146 transitions. [2023-12-05 21:11:13,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:13,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2146 transitions. [2023-12-05 21:11:13,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 126.23529411764706) internal successors, (2146), 17 states have internal predecessors, (2146), 0 states have call successors, (0), 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:11:13,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 204.0) internal successors, (3672), 18 states have internal predecessors, (3672), 0 states have call successors, (0), 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:11:13,866 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 204.0) internal successors, (3672), 18 states have internal predecessors, (3672), 0 states have call successors, (0), 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:11:13,866 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, 37 predicate places. [2023-12-05 21:11:13,866 INFO L500 AbstractCegarLoop]: Abstraction has has 238 places, 789 transitions, 22896 flow [2023-12-05 21:11:13,867 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 0 states have call successors, (0), 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:11:13,867 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:13,867 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:13,867 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:11:13,867 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-12-05 21:11:13,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1954366287, now seen corresponding path program 1 times [2023-12-05 21:11:13,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:13,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165368388] [2023-12-05 21:11:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:14,305 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:11:14,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:14,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165368388] [2023-12-05 21:11:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165368388] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:14,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:14,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:11:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782344297] [2023-12-05 21:11:14,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:14,306 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:11:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:14,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:11:14,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:11:14,307 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 204 [2023-12-05 21:11:14,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 789 transitions, 22896 flow. Second operand has 13 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 0 states have call successors, (0), 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:11:14,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:14,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 204 [2023-12-05 21:11:14,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:15,386 INFO L124 PetriNetUnfolderBase]: 1309/3268 cut-off events. [2023-12-05 21:11:15,386 INFO L125 PetriNetUnfolderBase]: For 68997/72367 co-relation queries the response was YES. [2023-12-05 21:11:15,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31149 conditions, 3268 events. 1309/3268 cut-off events. For 68997/72367 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 24402 event pairs, 5 based on Foata normal form. 9/3108 useless extension candidates. Maximal degree in co-relation 30912. Up to 1338 conditions per place. [2023-12-05 21:11:15,415 INFO L140 encePairwiseOnDemand]: 189/204 looper letters, 0 selfloop transitions, 0 changer transitions 765/765 dead transitions. [2023-12-05 21:11:15,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 765 transitions, 23324 flow [2023-12-05 21:11:15,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:11:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:11:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1376 transitions. [2023-12-05 21:11:15,423 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6131907308377896 [2023-12-05 21:11:15,423 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1376 transitions. [2023-12-05 21:11:15,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1376 transitions. [2023-12-05 21:11:15,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:15,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1376 transitions. [2023-12-05 21:11:15,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 125.0909090909091) internal successors, (1376), 11 states have internal predecessors, (1376), 0 states have call successors, (0), 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:11:15,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 204.0) internal successors, (2448), 12 states have internal predecessors, (2448), 0 states have call successors, (0), 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:11:15,428 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 204.0) internal successors, (2448), 12 states have internal predecessors, (2448), 0 states have call successors, (0), 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:11:15,428 INFO L308 CegarLoopForPetriNet]: 201 programPoint places, 42 predicate places. [2023-12-05 21:11:15,428 INFO L500 AbstractCegarLoop]: Abstraction has has 243 places, 765 transitions, 23324 flow [2023-12-05 21:11:15,429 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 0 states have call successors, (0), 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:11:15,440 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/thin002_power.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:11:15,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 66 remaining) [2023-12-05 21:11:15,483 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 66 remaining) [2023-12-05 21:11:15,483 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 66 remaining) [2023-12-05 21:11:15,484 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 66 remaining) [2023-12-05 21:11:15,485 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 66 remaining) [2023-12-05 21:11:15,486 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 66 remaining) [2023-12-05 21:11:15,487 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 66 remaining) [2023-12-05 21:11:15,488 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 66 remaining) [2023-12-05 21:11:15,488 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:11:15,489 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:15,495 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:11:15,495 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:11:15,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:11:15 BasicIcfg [2023-12-05 21:11:15,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:11:15,503 INFO L158 Benchmark]: Toolchain (without parser) took 19299.76ms. Allocated memory was 272.6MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 219.8MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-05 21:11:15,503 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:11:15,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.32ms. Allocated memory is still 272.6MB. Free memory was 219.4MB in the beginning and 194.7MB in the end (delta: 24.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:15,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.94ms. Allocated memory is still 272.6MB. Free memory was 194.7MB in the beginning and 191.8MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:15,503 INFO L158 Benchmark]: Boogie Preprocessor took 51.76ms. Allocated memory is still 272.6MB. Free memory was 191.8MB in the beginning and 189.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:15,504 INFO L158 Benchmark]: RCFGBuilder took 968.47ms. Allocated memory is still 272.6MB. Free memory was 189.4MB in the beginning and 123.9MB in the end (delta: 65.5MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2023-12-05 21:11:15,504 INFO L158 Benchmark]: TraceAbstraction took 17818.49ms. Allocated memory was 272.6MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 123.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-12-05 21:11:15,506 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.11ms. Allocated memory is still 188.7MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 418.32ms. Allocated memory is still 272.6MB. Free memory was 219.4MB in the beginning and 194.7MB in the end (delta: 24.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.94ms. Allocated memory is still 272.6MB. Free memory was 194.7MB in the beginning and 191.8MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.76ms. Allocated memory is still 272.6MB. Free memory was 191.8MB in the beginning and 189.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 968.47ms. Allocated memory is still 272.6MB. Free memory was 189.4MB in the beginning and 123.9MB in the end (delta: 65.5MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. * TraceAbstraction took 17818.49ms. Allocated memory was 272.6MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 123.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.8GB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 253 locations, 66 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: 17.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1800 IncrementalHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 205 mSDtfsCounter, 1800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23324occurred in iteration=18, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1570 ConstructedInterpolants, 0 QuantifiedInterpolants, 8206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 38 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:11:15,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...