/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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-175f719-m [2023-11-30 04:52:25,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:52:26,012 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-11-30 04:52:26,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:52:26,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:52:26,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:52:26,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:52:26,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:52:26,038 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:52:26,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:52:26,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:52:26,040 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:52:26,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:52:26,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:52:26,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:52:26,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:52:26,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:52:26,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:52:26,043 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:52:26,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:52:26,043 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:52:26,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:52:26,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:52:26,044 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:52:26,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:52:26,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:52:26,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:52:26,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:52:26,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:52:26,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:52:26,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:52:26,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:52:26,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:52:26,047 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-11-30 04:52:26,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:52:26,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:52:26,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:52:26,255 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:52:26,255 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:52:26,256 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-11-30 04:52:27,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:52:27,483 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:52:27,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-11-30 04:52:27,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06390550f/0c2b396e0de9467fac3f0b0633bbf54b/FLAG5d26eb1f6 [2023-11-30 04:52:27,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06390550f/0c2b396e0de9467fac3f0b0633bbf54b [2023-11-30 04:52:27,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:52:27,508 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:52:27,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:52:27,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:52:27,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:52:27,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:27,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d89164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27, skipping insertion in model container [2023-11-30 04:52:27,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:27,565 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:52:27,879 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:52:27,888 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:52:27,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:52:27,953 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:52:27,953 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:52:27,961 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:52:27,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27 WrapperNode [2023-11-30 04:52:27,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:52:27,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:52:27,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:52:27,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:52:27,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:27,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,001 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 205 [2023-11-30 04:52:28,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:52:28,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:52:28,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:52:28,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:52:28,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:52:28,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:52:28,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:52:28,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:52:28,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (1/1) ... [2023-11-30 04:52:28,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:52:28,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:52:28,051 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-11-30 04:52:28,053 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-11-30 04:52:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:52:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:52:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:52:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:52:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:52:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:52:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:52:28,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:52:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:52:28,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:52:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:52:28,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:52:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:52:28,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:52:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:52:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:52:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:52:28,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:52:28,072 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:52:28,174 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:52:28,176 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:52:28,567 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:52:28,845 WARN L1821 r$LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-30 04:52:28,881 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:52:28,881 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:52:28,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:52:28 BoogieIcfgContainer [2023-11-30 04:52:28,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:52:28,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:52:28,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:52:28,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:52:28,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:52:27" (1/3) ... [2023-11-30 04:52:28,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b18ed87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:52:28, skipping insertion in model container [2023-11-30 04:52:28,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:52:27" (2/3) ... [2023-11-30 04:52:28,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b18ed87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:52:28, skipping insertion in model container [2023-11-30 04:52:28,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:52:28" (3/3) ... [2023-11-30 04:52:28,888 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2023-11-30 04:52:28,900 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:52:28,901 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-11-30 04:52:28,901 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:52:28,995 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:52:29,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 204 transitions, 424 flow [2023-11-30 04:52:29,106 INFO L124 PetriNetUnfolderBase]: 12/200 cut-off events. [2023-11-30 04:52:29,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:52:29,113 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-11-30 04:52:29,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 204 transitions, 424 flow [2023-11-30 04:52:29,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 200 transitions, 412 flow [2023-11-30 04:52:29,131 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:52:29,136 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;@440ed1cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:52:29,136 INFO L363 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-11-30 04:52:29,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:52:29,151 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2023-11-30 04:52:29,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:52:29,152 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:29,152 INFO L232 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-11-30 04:52:29,153 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:29,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash 487010810, now seen corresponding path program 1 times [2023-11-30 04:52:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:29,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277337527] [2023-11-30 04:52:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:29,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:29,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277337527] [2023-11-30 04:52:29,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277337527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:29,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:29,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:29,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400573262] [2023-11-30 04:52:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:29,437 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:29,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:29,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:29,462 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 204 [2023-11-30 04:52:29,466 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-11-30 04:52:29,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:29,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 204 [2023-11-30 04:52:29,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:30,326 INFO L124 PetriNetUnfolderBase]: 1717/3999 cut-off events. [2023-11-30 04:52:30,327 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 04:52:30,336 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-11-30 04:52:30,359 INFO L140 encePairwiseOnDemand]: 176/204 looper letters, 63 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-11-30 04:52:30,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 186 transitions, 514 flow [2023-11-30 04:52:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-11-30 04:52:30,369 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8071895424836601 [2023-11-30 04:52:30,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-11-30 04:52:30,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-11-30 04:52:30,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:30,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-11-30 04:52:30,376 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-11-30 04:52:30,378 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-11-30 04:52:30,379 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-11-30 04:52:30,381 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -16 predicate places. [2023-11-30 04:52:30,382 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 186 transitions, 514 flow [2023-11-30 04:52:30,382 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-11-30 04:52:30,382 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:30,383 INFO L232 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-11-30 04:52:30,383 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:52:30,383 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:30,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash 487010811, now seen corresponding path program 1 times [2023-11-30 04:52:30,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:30,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544620552] [2023-11-30 04:52:30,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:30,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544620552] [2023-11-30 04:52:30,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544620552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:30,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656442582] [2023-11-30 04:52:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:30,501 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:30,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:30,502 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2023-11-30 04:52:30,503 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-11-30 04:52:30,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:30,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2023-11-30 04:52:30,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:31,245 INFO L124 PetriNetUnfolderBase]: 1723/4012 cut-off events. [2023-11-30 04:52:31,246 INFO L125 PetriNetUnfolderBase]: For 361/895 co-relation queries the response was YES. [2023-11-30 04:52:31,260 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-11-30 04:52:31,287 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 73 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2023-11-30 04:52:31,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 200 transitions, 720 flow [2023-11-30 04:52:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-11-30 04:52:31,289 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7418300653594772 [2023-11-30 04:52:31,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-11-30 04:52:31,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-11-30 04:52:31,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:31,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-11-30 04:52:31,290 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-11-30 04:52:31,292 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-11-30 04:52:31,292 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-11-30 04:52:31,292 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -15 predicate places. [2023-11-30 04:52:31,293 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 200 transitions, 720 flow [2023-11-30 04:52:31,293 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-11-30 04:52:31,293 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:31,293 INFO L232 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-11-30 04:52:31,293 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:52:31,293 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:31,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1002834518, now seen corresponding path program 1 times [2023-11-30 04:52:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528975880] [2023-11-30 04:52:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:31,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528975880] [2023-11-30 04:52:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528975880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:31,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:31,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38070229] [2023-11-30 04:52:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:31,382 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:31,383 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 204 [2023-11-30 04:52:31,384 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-11-30 04:52:31,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:31,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 204 [2023-11-30 04:52:31,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:32,069 INFO L124 PetriNetUnfolderBase]: 1840/4128 cut-off events. [2023-11-30 04:52:32,070 INFO L125 PetriNetUnfolderBase]: For 1078/2176 co-relation queries the response was YES. [2023-11-30 04:52:32,079 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-11-30 04:52:32,105 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 77 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2023-11-30 04:52:32,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 199 transitions, 874 flow [2023-11-30 04:52:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-30 04:52:32,107 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7287581699346405 [2023-11-30 04:52:32,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-30 04:52:32,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-30 04:52:32,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:32,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-30 04:52:32,109 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-11-30 04:52:32,110 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-11-30 04:52:32,110 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-11-30 04:52:32,111 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -14 predicate places. [2023-11-30 04:52:32,111 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 199 transitions, 874 flow [2023-11-30 04:52:32,111 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-11-30 04:52:32,111 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:32,112 INFO L232 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-11-30 04:52:32,112 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:52:32,112 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:32,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1002834519, now seen corresponding path program 1 times [2023-11-30 04:52:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:32,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482529538] [2023-11-30 04:52:32,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:32,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:32,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482529538] [2023-11-30 04:52:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482529538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999672310] [2023-11-30 04:52:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:32,206 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:32,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:32,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:32,207 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2023-11-30 04:52:32,207 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-11-30 04:52:32,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:32,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2023-11-30 04:52:32,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:32,876 INFO L124 PetriNetUnfolderBase]: 1840/4127 cut-off events. [2023-11-30 04:52:32,876 INFO L125 PetriNetUnfolderBase]: For 1957/3619 co-relation queries the response was YES. [2023-11-30 04:52:32,884 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-11-30 04:52:32,917 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 87 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2023-11-30 04:52:32,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 213 transitions, 1166 flow [2023-11-30 04:52:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-30 04:52:32,919 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7401960784313726 [2023-11-30 04:52:32,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-30 04:52:32,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-30 04:52:32,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:32,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-30 04:52:32,920 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-11-30 04:52:32,921 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-11-30 04:52:32,921 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-11-30 04:52:32,922 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -13 predicate places. [2023-11-30 04:52:32,922 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 213 transitions, 1166 flow [2023-11-30 04:52:32,922 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-11-30 04:52:32,922 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:32,922 INFO L232 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-11-30 04:52:32,923 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:52:32,923 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:32,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash 717794565, now seen corresponding path program 1 times [2023-11-30 04:52:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:32,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487872202] [2023-11-30 04:52:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:32,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487872202] [2023-11-30 04:52:32,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487872202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:32,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:32,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825436793] [2023-11-30 04:52:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:32,999 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:33,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:33,001 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 204 [2023-11-30 04:52:33,002 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-11-30 04:52:33,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:33,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 204 [2023-11-30 04:52:33,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:33,767 INFO L124 PetriNetUnfolderBase]: 1957/4243 cut-off events. [2023-11-30 04:52:33,767 INFO L125 PetriNetUnfolderBase]: For 3640/5866 co-relation queries the response was YES. [2023-11-30 04:52:33,780 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-11-30 04:52:33,814 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 91 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2023-11-30 04:52:33,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 212 transitions, 1346 flow [2023-11-30 04:52:33,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-11-30 04:52:33,816 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7271241830065359 [2023-11-30 04:52:33,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-11-30 04:52:33,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-11-30 04:52:33,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:33,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-11-30 04:52:33,817 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-11-30 04:52:33,818 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-11-30 04:52:33,818 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-11-30 04:52:33,819 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -12 predicate places. [2023-11-30 04:52:33,819 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 212 transitions, 1346 flow [2023-11-30 04:52:33,819 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-11-30 04:52:33,819 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:33,819 INFO L232 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-11-30 04:52:33,819 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:52:33,819 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:33,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash 717794566, now seen corresponding path program 1 times [2023-11-30 04:52:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:33,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034106934] [2023-11-30 04:52:33,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:33,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034106934] [2023-11-30 04:52:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034106934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982452759] [2023-11-30 04:52:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:33,905 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:33,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:33,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:33,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:33,907 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2023-11-30 04:52:33,907 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-11-30 04:52:33,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:33,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2023-11-30 04:52:33,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:34,573 INFO L124 PetriNetUnfolderBase]: 1957/4242 cut-off events. [2023-11-30 04:52:34,573 INFO L125 PetriNetUnfolderBase]: For 5231/8021 co-relation queries the response was YES. [2023-11-30 04:52:34,587 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-11-30 04:52:34,624 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 101 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2023-11-30 04:52:34,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 226 transitions, 1724 flow [2023-11-30 04:52:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-11-30 04:52:34,626 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2023-11-30 04:52:34,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-11-30 04:52:34,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-11-30 04:52:34,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:34,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-11-30 04:52:34,627 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-11-30 04:52:34,628 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-11-30 04:52:34,628 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-11-30 04:52:34,629 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -11 predicate places. [2023-11-30 04:52:34,629 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 226 transitions, 1724 flow [2023-11-30 04:52:34,629 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-11-30 04:52:34,629 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:34,629 INFO L232 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-11-30 04:52:34,630 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:52:34,630 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:34,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash -979816136, now seen corresponding path program 1 times [2023-11-30 04:52:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:34,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443015274] [2023-11-30 04:52:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443015274] [2023-11-30 04:52:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443015274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:34,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:34,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450535437] [2023-11-30 04:52:34,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:34,698 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:34,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:34,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:34,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:34,699 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 204 [2023-11-30 04:52:34,700 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-11-30 04:52:34,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:34,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 204 [2023-11-30 04:52:34,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:35,559 INFO L124 PetriNetUnfolderBase]: 2612/5329 cut-off events. [2023-11-30 04:52:35,559 INFO L125 PetriNetUnfolderBase]: For 8426/35030 co-relation queries the response was YES. [2023-11-30 04:52:35,575 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-11-30 04:52:35,630 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 132 selfloop transitions, 21 changer transitions 0/290 dead transitions. [2023-11-30 04:52:35,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 290 transitions, 2929 flow [2023-11-30 04:52:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-11-30 04:52:35,631 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.815359477124183 [2023-11-30 04:52:35,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-11-30 04:52:35,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-11-30 04:52:35,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:35,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-11-30 04:52:35,633 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-11-30 04:52:35,634 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-11-30 04:52:35,634 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-11-30 04:52:35,635 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -9 predicate places. [2023-11-30 04:52:35,635 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 290 transitions, 2929 flow [2023-11-30 04:52:35,635 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-11-30 04:52:35,635 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:35,635 INFO L232 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-11-30 04:52:35,635 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:52:35,636 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:35,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash -979816134, now seen corresponding path program 1 times [2023-11-30 04:52:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:35,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414039363] [2023-11-30 04:52:35,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:35,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:35,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414039363] [2023-11-30 04:52:35,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414039363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:35,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:35,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:52:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324520225] [2023-11-30 04:52:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:35,888 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:52:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:52:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:52:35,890 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 204 [2023-11-30 04:52:35,891 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-11-30 04:52:35,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:35,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 204 [2023-11-30 04:52:35,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:36,925 INFO L124 PetriNetUnfolderBase]: 1856/3996 cut-off events. [2023-11-30 04:52:36,925 INFO L125 PetriNetUnfolderBase]: For 10469/17219 co-relation queries the response was YES. [2023-11-30 04:52:36,938 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-11-30 04:52:36,985 INFO L140 encePairwiseOnDemand]: 186/204 looper letters, 190 selfloop transitions, 28 changer transitions 0/334 dead transitions. [2023-11-30 04:52:36,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 334 transitions, 4043 flow [2023-11-30 04:52:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:52:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:52:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2023-11-30 04:52:36,987 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6838235294117647 [2023-11-30 04:52:36,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2023-11-30 04:52:36,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2023-11-30 04:52:36,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:36,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2023-11-30 04:52:36,989 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-11-30 04:52:36,991 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-11-30 04:52:36,991 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-11-30 04:52:36,992 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -6 predicate places. [2023-11-30 04:52:36,992 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 334 transitions, 4043 flow [2023-11-30 04:52:36,992 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-11-30 04:52:36,992 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:36,992 INFO L232 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-11-30 04:52:36,992 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:52:36,993 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:36,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash -979816133, now seen corresponding path program 1 times [2023-11-30 04:52:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051181002] [2023-11-30 04:52:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:37,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051181002] [2023-11-30 04:52:37,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051181002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:37,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:37,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:52:37,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388379046] [2023-11-30 04:52:37,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:37,289 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:52:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:37,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:52:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:52:37,290 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 204 [2023-11-30 04:52:37,291 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-11-30 04:52:37,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:37,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 204 [2023-11-30 04:52:37,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:37,738 INFO L124 PetriNetUnfolderBase]: 630/1586 cut-off events. [2023-11-30 04:52:37,738 INFO L125 PetriNetUnfolderBase]: For 7346/8166 co-relation queries the response was YES. [2023-11-30 04:52:37,743 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-11-30 04:52:37,756 INFO L140 encePairwiseOnDemand]: 186/204 looper letters, 107 selfloop transitions, 28 changer transitions 0/252 dead transitions. [2023-11-30 04:52:37,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 252 transitions, 2837 flow [2023-11-30 04:52:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:52:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:52:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2023-11-30 04:52:37,758 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6560457516339869 [2023-11-30 04:52:37,758 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2023-11-30 04:52:37,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2023-11-30 04:52:37,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:37,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2023-11-30 04:52:37,760 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-11-30 04:52:37,761 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-11-30 04:52:37,761 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-11-30 04:52:37,762 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -8 predicate places. [2023-11-30 04:52:37,762 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 252 transitions, 2837 flow [2023-11-30 04:52:37,762 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-11-30 04:52:37,762 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:37,762 INFO L232 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-11-30 04:52:37,763 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:52:37,763 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:37,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1506409528, now seen corresponding path program 1 times [2023-11-30 04:52:37,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:37,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129106757] [2023-11-30 04:52:37,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:37,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:37,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:37,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129106757] [2023-11-30 04:52:37,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129106757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:37,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:37,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:37,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664226855] [2023-11-30 04:52:37,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:37,831 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:37,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:37,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:37,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:37,833 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2023-11-30 04:52:37,833 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-11-30 04:52:37,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:37,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2023-11-30 04:52:37,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:38,134 INFO L124 PetriNetUnfolderBase]: 718/1710 cut-off events. [2023-11-30 04:52:38,134 INFO L125 PetriNetUnfolderBase]: For 11564/11934 co-relation queries the response was YES. [2023-11-30 04:52:38,140 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-11-30 04:52:38,155 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 145 selfloop transitions, 2 changer transitions 6/277 dead transitions. [2023-11-30 04:52:38,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 277 transitions, 3653 flow [2023-11-30 04:52:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-30 04:52:38,157 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2023-11-30 04:52:38,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-30 04:52:38,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-30 04:52:38,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:38,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-30 04:52:38,160 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-11-30 04:52:38,161 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-11-30 04:52:38,162 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-11-30 04:52:38,164 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -7 predicate places. [2023-11-30 04:52:38,164 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 277 transitions, 3653 flow [2023-11-30 04:52:38,164 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-11-30 04:52:38,164 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:38,164 INFO L232 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-11-30 04:52:38,165 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:52:38,165 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:38,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1506409527, now seen corresponding path program 1 times [2023-11-30 04:52:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:38,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160708522] [2023-11-30 04:52:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:38,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160708522] [2023-11-30 04:52:38,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160708522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:38,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:38,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899900846] [2023-11-30 04:52:38,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:38,200 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:38,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:38,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:38,201 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 204 [2023-11-30 04:52:38,201 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-11-30 04:52:38,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:38,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 204 [2023-11-30 04:52:38,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:38,569 INFO L124 PetriNetUnfolderBase]: 716/1705 cut-off events. [2023-11-30 04:52:38,569 INFO L125 PetriNetUnfolderBase]: For 13997/14431 co-relation queries the response was YES. [2023-11-30 04:52:38,574 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-11-30 04:52:38,589 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 149 selfloop transitions, 2 changer transitions 6/276 dead transitions. [2023-11-30 04:52:38,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 276 transitions, 3953 flow [2023-11-30 04:52:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-11-30 04:52:38,591 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6928104575163399 [2023-11-30 04:52:38,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-11-30 04:52:38,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-11-30 04:52:38,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:38,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-11-30 04:52:38,592 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-11-30 04:52:38,593 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-11-30 04:52:38,593 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-11-30 04:52:38,593 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -6 predicate places. [2023-11-30 04:52:38,593 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 276 transitions, 3953 flow [2023-11-30 04:52:38,593 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-11-30 04:52:38,593 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:38,594 INFO L232 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-11-30 04:52:38,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:52:38,594 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:38,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash 442873037, now seen corresponding path program 1 times [2023-11-30 04:52:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547725503] [2023-11-30 04:52:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:38,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:38,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547725503] [2023-11-30 04:52:38,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547725503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:38,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:38,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:52:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875834362] [2023-11-30 04:52:38,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:38,664 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:52:38,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:52:38,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:52:38,665 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 204 [2023-11-30 04:52:38,665 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-11-30 04:52:38,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:38,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 204 [2023-11-30 04:52:38,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:38,959 INFO L124 PetriNetUnfolderBase]: 696/1663 cut-off events. [2023-11-30 04:52:38,959 INFO L125 PetriNetUnfolderBase]: For 16301/16829 co-relation queries the response was YES. [2023-11-30 04:52:38,965 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-11-30 04:52:38,981 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 139 selfloop transitions, 28 changer transitions 6/313 dead transitions. [2023-11-30 04:52:38,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 313 transitions, 5187 flow [2023-11-30 04:52:38,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-11-30 04:52:38,983 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7794117647058824 [2023-11-30 04:52:38,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-11-30 04:52:38,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-11-30 04:52:38,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:38,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-11-30 04:52:38,984 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-11-30 04:52:38,985 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-11-30 04:52:38,985 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-11-30 04:52:38,985 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -4 predicate places. [2023-11-30 04:52:38,985 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 313 transitions, 5187 flow [2023-11-30 04:52:38,985 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-11-30 04:52:38,986 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:38,986 INFO L232 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-11-30 04:52:38,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:52:38,986 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:38,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash 403369982, now seen corresponding path program 1 times [2023-11-30 04:52:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:38,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772189984] [2023-11-30 04:52:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772189984] [2023-11-30 04:52:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772189984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:39,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:39,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:52:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507451089] [2023-11-30 04:52:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:39,120 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:52:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:39,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:52:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:52:39,121 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 204 [2023-11-30 04:52:39,122 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-11-30 04:52:39,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:39,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 204 [2023-11-30 04:52:39,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:39,445 INFO L124 PetriNetUnfolderBase]: 686/1645 cut-off events. [2023-11-30 04:52:39,445 INFO L125 PetriNetUnfolderBase]: For 19157/19743 co-relation queries the response was YES. [2023-11-30 04:52:39,451 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-11-30 04:52:39,467 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 150 selfloop transitions, 28 changer transitions 6/311 dead transitions. [2023-11-30 04:52:39,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 311 transitions, 5503 flow [2023-11-30 04:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:52:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:52:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-11-30 04:52:39,468 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6985294117647058 [2023-11-30 04:52:39,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-11-30 04:52:39,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-11-30 04:52:39,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:39,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-11-30 04:52:39,470 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-11-30 04:52:39,471 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-11-30 04:52:39,471 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-11-30 04:52:39,471 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -2 predicate places. [2023-11-30 04:52:39,471 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 311 transitions, 5503 flow [2023-11-30 04:52:39,472 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-11-30 04:52:39,472 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:39,472 INFO L232 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-11-30 04:52:39,472 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:52:39,472 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:39,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash 453370427, now seen corresponding path program 1 times [2023-11-30 04:52:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732760103] [2023-11-30 04:52:39,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:39,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:39,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732760103] [2023-11-30 04:52:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732760103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:39,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:52:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885787608] [2023-11-30 04:52:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:39,535 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:52:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:39,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:52:39,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:52:39,536 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 204 [2023-11-30 04:52:39,536 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-11-30 04:52:39,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:39,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 204 [2023-11-30 04:52:39,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:39,978 INFO L124 PetriNetUnfolderBase]: 717/1818 cut-off events. [2023-11-30 04:52:39,978 INFO L125 PetriNetUnfolderBase]: For 24702/25330 co-relation queries the response was YES. [2023-11-30 04:52:39,985 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-11-30 04:52:40,008 INFO L140 encePairwiseOnDemand]: 197/204 looper letters, 169 selfloop transitions, 31 changer transitions 19/339 dead transitions. [2023-11-30 04:52:40,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 339 transitions, 6677 flow [2023-11-30 04:52:40,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:52:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:52:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-30 04:52:40,010 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7009803921568627 [2023-11-30 04:52:40,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-30 04:52:40,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-30 04:52:40,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:40,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-30 04:52:40,012 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-11-30 04:52:40,013 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-11-30 04:52:40,013 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-11-30 04:52:40,014 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -1 predicate places. [2023-11-30 04:52:40,014 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 339 transitions, 6677 flow [2023-11-30 04:52:40,014 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-11-30 04:52:40,014 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:40,015 INFO L232 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-11-30 04:52:40,015 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:52:40,015 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:40,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash 293013172, now seen corresponding path program 1 times [2023-11-30 04:52:40,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157572463] [2023-11-30 04:52:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:40,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157572463] [2023-11-30 04:52:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157572463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:40,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:40,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:52:40,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780305109] [2023-11-30 04:52:40,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:40,249 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:52:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:40,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:52:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:52:40,250 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 204 [2023-11-30 04:52:40,251 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-11-30 04:52:40,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:40,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 204 [2023-11-30 04:52:40,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:40,789 INFO L124 PetriNetUnfolderBase]: 601/1571 cut-off events. [2023-11-30 04:52:40,790 INFO L125 PetriNetUnfolderBase]: For 25429/26339 co-relation queries the response was YES. [2023-11-30 04:52:40,794 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-11-30 04:52:40,808 INFO L140 encePairwiseOnDemand]: 187/204 looper letters, 173 selfloop transitions, 38 changer transitions 22/349 dead transitions. [2023-11-30 04:52:40,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 349 transitions, 7443 flow [2023-11-30 04:52:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:52:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:52:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1054 transitions. [2023-11-30 04:52:40,810 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2023-11-30 04:52:40,810 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1054 transitions. [2023-11-30 04:52:40,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1054 transitions. [2023-11-30 04:52:40,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:40,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1054 transitions. [2023-11-30 04:52:40,812 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-11-30 04:52:40,814 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-11-30 04:52:40,814 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-11-30 04:52:40,815 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, 6 predicate places. [2023-11-30 04:52:40,815 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 349 transitions, 7443 flow [2023-11-30 04:52:40,815 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-11-30 04:52:40,815 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:40,815 INFO L232 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-11-30 04:52:40,815 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:52:40,815 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:40,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1884793958, now seen corresponding path program 1 times [2023-11-30 04:52:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855089315] [2023-11-30 04:52:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:41,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:41,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855089315] [2023-11-30 04:52:41,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855089315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:41,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:41,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-30 04:52:41,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194742345] [2023-11-30 04:52:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:41,229 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:52:41,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:52:41,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:52:41,231 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 204 [2023-11-30 04:52:41,232 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-11-30 04:52:41,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:41,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 204 [2023-11-30 04:52:41,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:41,683 INFO L124 PetriNetUnfolderBase]: 485/1385 cut-off events. [2023-11-30 04:52:41,684 INFO L125 PetriNetUnfolderBase]: For 24437/25241 co-relation queries the response was YES. [2023-11-30 04:52:41,688 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-11-30 04:52:41,700 INFO L140 encePairwiseOnDemand]: 184/204 looper letters, 158 selfloop transitions, 67 changer transitions 24/361 dead transitions. [2023-11-30 04:52:41,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 361 transitions, 8157 flow [2023-11-30 04:52:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 04:52:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 04:52:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2005 transitions. [2023-11-30 04:52:41,705 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6142769607843137 [2023-11-30 04:52:41,705 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2005 transitions. [2023-11-30 04:52:41,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2005 transitions. [2023-11-30 04:52:41,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:41,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2005 transitions. [2023-11-30 04:52:41,709 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-11-30 04:52:41,713 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-11-30 04:52:41,713 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-11-30 04:52:41,713 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, 21 predicate places. [2023-11-30 04:52:41,714 INFO L500 AbstractCegarLoop]: Abstraction has has 222 places, 361 transitions, 8157 flow [2023-11-30 04:52:41,714 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-11-30 04:52:41,714 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:41,714 INFO L232 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-11-30 04:52:41,714 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:52:41,715 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:41,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1184703312, now seen corresponding path program 1 times [2023-11-30 04:52:41,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:41,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366554023] [2023-11-30 04:52:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:42,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366554023] [2023-11-30 04:52:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366554023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:42,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:42,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:52:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801804394] [2023-11-30 04:52:42,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:42,137 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:52:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:42,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:52:42,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:52:42,138 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 204 [2023-11-30 04:52:42,139 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-11-30 04:52:42,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:42,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 204 [2023-11-30 04:52:42,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:43,255 INFO L124 PetriNetUnfolderBase]: 1444/3577 cut-off events. [2023-11-30 04:52:43,255 INFO L125 PetriNetUnfolderBase]: For 60043/62367 co-relation queries the response was YES. [2023-11-30 04:52:43,274 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-11-30 04:52:43,294 INFO L140 encePairwiseOnDemand]: 179/204 looper letters, 153 selfloop transitions, 92 changer transitions 433/789 dead transitions. [2023-11-30 04:52:43,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 789 transitions, 22896 flow [2023-11-30 04:52:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:52:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:52:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2146 transitions. [2023-11-30 04:52:43,298 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.618800461361015 [2023-11-30 04:52:43,298 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2146 transitions. [2023-11-30 04:52:43,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2146 transitions. [2023-11-30 04:52:43,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:43,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2146 transitions. [2023-11-30 04:52:43,302 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-11-30 04:52:43,306 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-11-30 04:52:43,306 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-11-30 04:52:43,306 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, 37 predicate places. [2023-11-30 04:52:43,307 INFO L500 AbstractCegarLoop]: Abstraction has has 238 places, 789 transitions, 22896 flow [2023-11-30 04:52:43,307 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-11-30 04:52:43,308 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:52:43,308 INFO L232 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-11-30 04:52:43,308 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:52:43,308 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-30 04:52:43,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:52:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1954366287, now seen corresponding path program 1 times [2023-11-30 04:52:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:52:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643567035] [2023-11-30 04:52:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:52:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:52:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:52:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:52:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:52:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643567035] [2023-11-30 04:52:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643567035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:52:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:52:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:52:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737341362] [2023-11-30 04:52:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:52:43,664 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 04:52:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:52:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 04:52:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-30 04:52:43,665 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 204 [2023-11-30 04:52:43,667 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-11-30 04:52:43,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:52:43,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 204 [2023-11-30 04:52:43,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:52:44,778 INFO L124 PetriNetUnfolderBase]: 1309/3268 cut-off events. [2023-11-30 04:52:44,778 INFO L125 PetriNetUnfolderBase]: For 68997/72367 co-relation queries the response was YES. [2023-11-30 04:52:44,794 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-11-30 04:52:44,804 INFO L140 encePairwiseOnDemand]: 189/204 looper letters, 0 selfloop transitions, 0 changer transitions 765/765 dead transitions. [2023-11-30 04:52:44,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 765 transitions, 23324 flow [2023-11-30 04:52:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 04:52:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 04:52:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1376 transitions. [2023-11-30 04:52:44,810 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6131907308377896 [2023-11-30 04:52:44,811 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1376 transitions. [2023-11-30 04:52:44,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1376 transitions. [2023-11-30 04:52:44,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:52:44,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1376 transitions. [2023-11-30 04:52:44,813 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-11-30 04:52:44,815 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-11-30 04:52:44,816 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-11-30 04:52:44,816 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, 42 predicate places. [2023-11-30 04:52:44,816 INFO L500 AbstractCegarLoop]: Abstraction has has 243 places, 765 transitions, 23324 flow [2023-11-30 04:52:44,816 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-11-30 04:52:44,828 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/thin002_power.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:52:44,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 66 remaining) [2023-11-30 04:52:44,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 66 remaining) [2023-11-30 04:52:44,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 66 remaining) [2023-11-30 04:52:44,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 66 remaining) [2023-11-30 04:52:44,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 66 remaining) [2023-11-30 04:52:44,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 66 remaining) [2023-11-30 04:52:44,875 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 66 remaining) [2023-11-30 04:52:44,876 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 66 remaining) [2023-11-30 04:52:44,877 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 66 remaining) [2023-11-30 04:52:44,877 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 04:52:44,877 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-11-30 04:52:44,881 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:52:44,881 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:52:44,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:52:44 BasicIcfg [2023-11-30 04:52:44,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:52:44,886 INFO L158 Benchmark]: Toolchain (without parser) took 17377.57ms. Allocated memory was 528.5MB in the beginning and 5.6GB in the end (delta: 5.0GB). Free memory was 491.3MB in the beginning and 4.7GB in the end (delta: -4.2GB). Peak memory consumption was 855.7MB. Max. memory is 16.0GB. [2023-11-30 04:52:44,886 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 358.6MB. Free memory is still 314.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:52:44,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.48ms. Allocated memory is still 528.5MB. Free memory was 491.3MB in the beginning and 466.3MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:52:44,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.76ms. Allocated memory is still 528.5MB. Free memory was 466.3MB in the beginning and 464.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:52:44,887 INFO L158 Benchmark]: Boogie Preprocessor took 28.33ms. Allocated memory is still 528.5MB. Free memory was 464.2MB in the beginning and 461.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:52:44,887 INFO L158 Benchmark]: RCFGBuilder took 851.31ms. Allocated memory is still 528.5MB. Free memory was 461.7MB in the beginning and 469.0MB in the end (delta: -7.3MB). Peak memory consumption was 108.1MB. Max. memory is 16.0GB. [2023-11-30 04:52:44,887 INFO L158 Benchmark]: TraceAbstraction took 16002.11ms. Allocated memory was 528.5MB in the beginning and 5.6GB in the end (delta: 5.0GB). Free memory was 468.0MB in the beginning and 4.7GB in the end (delta: -4.2GB). Peak memory consumption was 829.4MB. Max. memory is 16.0GB. [2023-11-30 04:52:44,888 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.10ms. Allocated memory is still 358.6MB. Free memory is still 314.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 452.48ms. Allocated memory is still 528.5MB. Free memory was 491.3MB in the beginning and 466.3MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.76ms. Allocated memory is still 528.5MB. Free memory was 466.3MB in the beginning and 464.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.33ms. Allocated memory is still 528.5MB. Free memory was 464.2MB in the beginning and 461.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 851.31ms. Allocated memory is still 528.5MB. Free memory was 461.7MB in the beginning and 469.0MB in the end (delta: -7.3MB). Peak memory consumption was 108.1MB. Max. memory is 16.0GB. * TraceAbstraction took 16002.11ms. Allocated memory was 528.5MB in the beginning and 5.6GB in the end (delta: 5.0GB). Free memory was 468.0MB in the beginning and 4.7GB in the end (delta: -4.2GB). Peak memory consumption was 829.4MB. Max. memory is 16.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: 15.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 1.5s 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.6s 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, 2.7s 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-11-30 04:52:44,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...