/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/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:01:04,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:01:04,931 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:01:04,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:01:04,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:01:04,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:01:04,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:01:04,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:01:04,965 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:01:04,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:01:04,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:01:04,969 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:01:04,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:01:04,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:01:04,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:01:04,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:01:04,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:01:04,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:01:04,972 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:01:04,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:01:04,972 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:01:04,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:01:04,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:01:04,973 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:01:04,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:01:04,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:01:04,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:01:04,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:01:04,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:01:04,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:01:04,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:01:04,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:01:04,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:01:04,976 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:01:05,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:01:05,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:01:05,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:01:05,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:01:05,220 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:01:05,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2023-11-30 04:01:06,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:01:06,607 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:01:06,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2023-11-30 04:01:06,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d50ad591/02ca524e422a443fb6bb60f712578142/FLAGe61aa6da1 [2023-11-30 04:01:06,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d50ad591/02ca524e422a443fb6bb60f712578142 [2023-11-30 04:01:06,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:01:06,634 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:01:06,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:01:06,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:01:06,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:01:06,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:01:06" (1/1) ... [2023-11-30 04:01:06,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725ac77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:06, skipping insertion in model container [2023-11-30 04:01:06,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:01:06" (1/1) ... [2023-11-30 04:01:06,694 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:01:07,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:01:07,098 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:01:07,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:01:07,189 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:01:07,189 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:01:07,194 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:01:07,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07 WrapperNode [2023-11-30 04:01:07,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:01:07,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:01:07,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:01:07,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:01:07,201 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:01:07" (1/1) ... [2023-11-30 04:01:07,214 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:01:07" (1/1) ... [2023-11-30 04:01:07,227 INFO L138 Inliner]: procedures = 324, calls = 52, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 37 [2023-11-30 04:01:07,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:01:07,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:01:07,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:01:07,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:01:07,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:01:07,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:01:07,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:01:07,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:01:07,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (1/1) ... [2023-11-30 04:01:07,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:01:07,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:01:07,294 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:01:07,303 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:01:07,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:01:07,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:01:07,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:01:07,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:01:07,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:01:07,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2023-11-30 04:01:07,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2023-11-30 04:01:07,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 04:01:07,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 04:01:07,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 04:01:07,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 04:01:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 04:01:07,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 04:01:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:01:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 04:01:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:01:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:01:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:01:07,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:01:07,320 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:01:07,407 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:01:07,409 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:01:07,598 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:01:07,616 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:01:07,616 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:01:07,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:01:07 BoogieIcfgContainer [2023-11-30 04:01:07,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:01:07,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:01:07,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:01:07,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:01:07,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:01:06" (1/3) ... [2023-11-30 04:01:07,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8ba6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:01:07, skipping insertion in model container [2023-11-30 04:01:07,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:01:07" (2/3) ... [2023-11-30 04:01:07,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8ba6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:01:07, skipping insertion in model container [2023-11-30 04:01:07,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:01:07" (3/3) ... [2023-11-30 04:01:07,623 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton.i [2023-11-30 04:01:07,635 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:01:07,636 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-30 04:01:07,636 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:01:07,762 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2023-11-30 04:01:07,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 244 transitions, 585 flow [2023-11-30 04:01:07,833 INFO L124 PetriNetUnfolderBase]: 7/165 cut-off events. [2023-11-30 04:01:07,834 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 04:01:07,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 165 events. 7/165 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 172 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2023-11-30 04:01:07,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 244 transitions, 585 flow [2023-11-30 04:01:07,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 143 transitions, 337 flow [2023-11-30 04:01:07,847 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:01:07,851 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;@71e85663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:01:07,851 INFO L363 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2023-11-30 04:01:07,854 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:01:07,854 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-11-30 04:01:07,854 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:01:07,855 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:07,855 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:07,855 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:07,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1257613741, now seen corresponding path program 1 times [2023-11-30 04:01:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:07,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850576979] [2023-11-30 04:01:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:08,083 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:01:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850576979] [2023-11-30 04:01:08,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850576979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:08,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794346722] [2023-11-30 04:01:08,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:08,093 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:08,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:08,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:08,120 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 246 [2023-11-30 04:01:08,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 143 transitions, 337 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:01:08,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:08,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 246 [2023-11-30 04:01:08,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:09,994 INFO L124 PetriNetUnfolderBase]: 12080/19273 cut-off events. [2023-11-30 04:01:09,994 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2023-11-30 04:01:10,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36303 conditions, 19273 events. 12080/19273 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 145803 event pairs, 11813 based on Foata normal form. 0/9001 useless extension candidates. Maximal degree in co-relation 36256. Up to 15947 conditions per place. [2023-11-30 04:01:10,200 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 72 selfloop transitions, 7 changer transitions 0/150 dead transitions. [2023-11-30 04:01:10,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 150 transitions, 512 flow [2023-11-30 04:01:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-11-30 04:01:10,215 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2023-11-30 04:01:10,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-11-30 04:01:10,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-11-30 04:01:10,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:10,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-11-30 04:01:10,223 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:01:10,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:10,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:10,231 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 1 predicate places. [2023-11-30 04:01:10,232 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 150 transitions, 512 flow [2023-11-30 04:01:10,232 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:01:10,232 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:10,232 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:10,233 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:01:10,233 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:10,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1257613740, now seen corresponding path program 1 times [2023-11-30 04:01:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:10,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401226303] [2023-11-30 04:01:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:10,351 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:01:10,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401226303] [2023-11-30 04:01:10,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401226303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:10,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:10,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:10,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250964372] [2023-11-30 04:01:10,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:10,353 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:10,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:10,355 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 246 [2023-11-30 04:01:10,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 150 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 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:01:10,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:10,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 246 [2023-11-30 04:01:10,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:12,571 INFO L124 PetriNetUnfolderBase]: 16253/24685 cut-off events. [2023-11-30 04:01:12,571 INFO L125 PetriNetUnfolderBase]: For 3860/6942 co-relation queries the response was YES. [2023-11-30 04:01:12,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65998 conditions, 24685 events. 16253/24685 cut-off events. For 3860/6942 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 182222 event pairs, 14277 based on Foata normal form. 0/11534 useless extension candidates. Maximal degree in co-relation 65942. Up to 20108 conditions per place. [2023-11-30 04:01:12,751 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 68 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2023-11-30 04:01:12,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 152 transitions, 658 flow [2023-11-30 04:01:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2023-11-30 04:01:12,752 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2023-11-30 04:01:12,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2023-11-30 04:01:12,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2023-11-30 04:01:12,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:12,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2023-11-30 04:01:12,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 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:01:12,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:12,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:12,757 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 2 predicate places. [2023-11-30 04:01:12,757 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 658 flow [2023-11-30 04:01:12,758 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 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:01:12,758 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:12,758 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] [2023-11-30 04:01:12,758 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:01:12,758 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:12,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 381399325, now seen corresponding path program 1 times [2023-11-30 04:01:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:12,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781149014] [2023-11-30 04:01:12,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:12,992 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:01:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781149014] [2023-11-30 04:01:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781149014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289824649] [2023-11-30 04:01:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:12,993 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:12,994 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 246 [2023-11-30 04:01:12,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:01:12,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:12,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 246 [2023-11-30 04:01:12,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:14,862 INFO L124 PetriNetUnfolderBase]: 16249/24686 cut-off events. [2023-11-30 04:01:14,862 INFO L125 PetriNetUnfolderBase]: For 10145/19349 co-relation queries the response was YES. [2023-11-30 04:01:15,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84423 conditions, 24686 events. 16249/24686 cut-off events. For 10145/19349 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 182499 event pairs, 14271 based on Foata normal form. 5/13248 useless extension candidates. Maximal degree in co-relation 84356. Up to 20096 conditions per place. [2023-11-30 04:01:15,222 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 78 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2023-11-30 04:01:15,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 151 transitions, 816 flow [2023-11-30 04:01:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2023-11-30 04:01:15,224 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277 [2023-11-30 04:01:15,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2023-11-30 04:01:15,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2023-11-30 04:01:15,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:15,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2023-11-30 04:01:15,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 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:01:15,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:15,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:15,228 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 2 predicate places. [2023-11-30 04:01:15,228 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 816 flow [2023-11-30 04:01:15,228 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:01:15,228 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:15,228 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] [2023-11-30 04:01:15,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:01:15,228 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:15,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash 381399326, now seen corresponding path program 1 times [2023-11-30 04:01:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:15,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460237639] [2023-11-30 04:01:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:15,355 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:01:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460237639] [2023-11-30 04:01:15,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460237639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:15,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:15,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220247552] [2023-11-30 04:01:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:15,356 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:15,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:15,357 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-11-30 04:01:15,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 151 transitions, 816 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:01:15,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:15,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-11-30 04:01:15,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:17,589 INFO L124 PetriNetUnfolderBase]: 16244/24666 cut-off events. [2023-11-30 04:01:17,589 INFO L125 PetriNetUnfolderBase]: For 18667/37073 co-relation queries the response was YES. [2023-11-30 04:01:17,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105787 conditions, 24666 events. 16244/24666 cut-off events. For 18667/37073 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 182389 event pairs, 14263 based on Foata normal form. 9/13232 useless extension candidates. Maximal degree in co-relation 105707. Up to 21353 conditions per place. [2023-11-30 04:01:17,790 INFO L140 encePairwiseOnDemand]: 241/246 looper letters, 88 selfloop transitions, 3 changer transitions 0/151 dead transitions. [2023-11-30 04:01:17,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 151 transitions, 1002 flow [2023-11-30 04:01:17,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-11-30 04:01:17,792 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2023-11-30 04:01:17,792 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-11-30 04:01:17,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-11-30 04:01:17,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:17,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-11-30 04:01:17,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 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:01:17,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:17,795 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:17,796 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 3 predicate places. [2023-11-30 04:01:17,796 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 151 transitions, 1002 flow [2023-11-30 04:01:17,796 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:01:17,796 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:17,797 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] [2023-11-30 04:01:17,797 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:01:17,797 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:17,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1645098619, now seen corresponding path program 1 times [2023-11-30 04:01:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:17,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988718590] [2023-11-30 04:01:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:18,134 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:01:18,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:18,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988718590] [2023-11-30 04:01:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988718590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:18,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:01:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437364067] [2023-11-30 04:01:18,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:18,136 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:01:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:18,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:01:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:01:18,138 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-11-30 04:01:18,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 151 transitions, 1002 flow. Second operand has 9 states, 9 states have (on average 112.88888888888889) internal successors, (1016), 9 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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:01:18,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:18,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-11-30 04:01:18,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:19,499 INFO L124 PetriNetUnfolderBase]: 10263/15893 cut-off events. [2023-11-30 04:01:19,499 INFO L125 PetriNetUnfolderBase]: For 21278/39686 co-relation queries the response was YES. [2023-11-30 04:01:19,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82621 conditions, 15893 events. 10263/15893 cut-off events. For 21278/39686 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 113464 event pairs, 8373 based on Foata normal form. 1711/9978 useless extension candidates. Maximal degree in co-relation 82526. Up to 13680 conditions per place. [2023-11-30 04:01:19,650 INFO L140 encePairwiseOnDemand]: 236/246 looper letters, 82 selfloop transitions, 9 changer transitions 0/149 dead transitions. [2023-11-30 04:01:19,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 149 transitions, 1166 flow [2023-11-30 04:01:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-11-30 04:01:19,652 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5252032520325203 [2023-11-30 04:01:19,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-11-30 04:01:19,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-11-30 04:01:19,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:19,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-11-30 04:01:19,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 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:01:19,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:01:19,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:01:19,656 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 6 predicate places. [2023-11-30 04:01:19,656 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 1166 flow [2023-11-30 04:01:19,657 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.88888888888889) internal successors, (1016), 9 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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:01:19,657 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:19,657 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] [2023-11-30 04:01:19,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:01:19,657 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:19,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash -519662199, now seen corresponding path program 1 times [2023-11-30 04:01:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898159429] [2023-11-30 04:01:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:19,822 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:01:19,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:19,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898159429] [2023-11-30 04:01:19,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898159429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:19,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:19,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161477791] [2023-11-30 04:01:19,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:19,823 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:19,824 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 246 [2023-11-30 04:01:19,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 149 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 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:01:19,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:19,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 246 [2023-11-30 04:01:19,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:21,264 INFO L124 PetriNetUnfolderBase]: 8472/13338 cut-off events. [2023-11-30 04:01:21,265 INFO L125 PetriNetUnfolderBase]: For 31709/55745 co-relation queries the response was YES. [2023-11-30 04:01:21,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80134 conditions, 13338 events. 8472/13338 cut-off events. For 31709/55745 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 94102 event pairs, 6839 based on Foata normal form. 130/7249 useless extension candidates. Maximal degree in co-relation 80028. Up to 11373 conditions per place. [2023-11-30 04:01:21,370 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 78 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2023-11-30 04:01:21,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 148 transitions, 1318 flow [2023-11-30 04:01:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-11-30 04:01:21,371 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6395663956639567 [2023-11-30 04:01:21,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-11-30 04:01:21,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-11-30 04:01:21,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:21,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-11-30 04:01:21,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:01:21,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:21,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:21,374 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 6 predicate places. [2023-11-30 04:01:21,374 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 148 transitions, 1318 flow [2023-11-30 04:01:21,375 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 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:01:21,375 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:21,375 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] [2023-11-30 04:01:21,375 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:01:21,375 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:21,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:21,375 INFO L85 PathProgramCache]: Analyzing trace with hash -519662198, now seen corresponding path program 1 times [2023-11-30 04:01:21,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:21,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117852008] [2023-11-30 04:01:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:21,551 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:01:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117852008] [2023-11-30 04:01:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117852008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:21,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:01:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103398523] [2023-11-30 04:01:21,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:21,553 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:01:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:21,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:01:21,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:01:21,554 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-11-30 04:01:21,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 148 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 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:01:21,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:21,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-11-30 04:01:21,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:22,492 INFO L124 PetriNetUnfolderBase]: 6679/10783 cut-off events. [2023-11-30 04:01:22,492 INFO L125 PetriNetUnfolderBase]: For 36725/59191 co-relation queries the response was YES. [2023-11-30 04:01:22,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73876 conditions, 10783 events. 6679/10783 cut-off events. For 36725/59191 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 75243 event pairs, 5298 based on Foata normal form. 130/6102 useless extension candidates. Maximal degree in co-relation 73756. Up to 9066 conditions per place. [2023-11-30 04:01:22,750 INFO L140 encePairwiseOnDemand]: 241/246 looper letters, 86 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2023-11-30 04:01:22,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 148 transitions, 1504 flow [2023-11-30 04:01:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-11-30 04:01:22,752 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5426829268292683 [2023-11-30 04:01:22,752 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-11-30 04:01:22,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-11-30 04:01:22,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:22,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-11-30 04:01:22,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:01:22,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:22,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:22,755 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 7 predicate places. [2023-11-30 04:01:22,755 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 148 transitions, 1504 flow [2023-11-30 04:01:22,756 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 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:01:22,756 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:22,756 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] [2023-11-30 04:01:22,756 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:01:22,756 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:22,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1020822843, now seen corresponding path program 1 times [2023-11-30 04:01:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:22,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664640447] [2023-11-30 04:01:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:22,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:22,796 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:01:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664640447] [2023-11-30 04:01:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664640447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:22,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:22,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231355765] [2023-11-30 04:01:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:22,797 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:22,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:22,798 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 246 [2023-11-30 04:01:22,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 148 transitions, 1504 flow. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:01:22,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:22,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 246 [2023-11-30 04:01:22,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:23,210 INFO L124 PetriNetUnfolderBase]: 2381/4249 cut-off events. [2023-11-30 04:01:23,210 INFO L125 PetriNetUnfolderBase]: For 18523/23349 co-relation queries the response was YES. [2023-11-30 04:01:23,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30917 conditions, 4249 events. 2381/4249 cut-off events. For 18523/23349 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 27238 event pairs, 1792 based on Foata normal form. 4/2926 useless extension candidates. Maximal degree in co-relation 30783. Up to 3348 conditions per place. [2023-11-30 04:01:23,246 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 80 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2023-11-30 04:01:23,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 148 transitions, 1672 flow [2023-11-30 04:01:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 739 transitions. [2023-11-30 04:01:23,250 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6008130081300813 [2023-11-30 04:01:23,250 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 739 transitions. [2023-11-30 04:01:23,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 739 transitions. [2023-11-30 04:01:23,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:23,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 739 transitions. [2023-11-30 04:01:23,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 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:01:23,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:01:23,253 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:01:23,254 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 7 predicate places. [2023-11-30 04:01:23,254 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 148 transitions, 1672 flow [2023-11-30 04:01:23,254 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:01:23,254 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:23,254 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] [2023-11-30 04:01:23,254 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:01:23,254 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:23,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2100945690, now seen corresponding path program 1 times [2023-11-30 04:01:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397558586] [2023-11-30 04:01:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:23,317 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:01:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:23,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397558586] [2023-11-30 04:01:23,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397558586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:23,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381597827] [2023-11-30 04:01:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:23,318 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:23,319 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 246 [2023-11-30 04:01:23,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 148 transitions, 1672 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 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:01:23,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:23,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 246 [2023-11-30 04:01:23,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:23,485 INFO L124 PetriNetUnfolderBase]: 579/1313 cut-off events. [2023-11-30 04:01:23,485 INFO L125 PetriNetUnfolderBase]: For 8453/9259 co-relation queries the response was YES. [2023-11-30 04:01:23,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9429 conditions, 1313 events. 579/1313 cut-off events. For 8453/9259 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7018 event pairs, 370 based on Foata normal form. 6/1229 useless extension candidates. Maximal degree in co-relation 9296. Up to 886 conditions per place. [2023-11-30 04:01:23,494 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 63 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2023-11-30 04:01:23,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 142 transitions, 1708 flow [2023-11-30 04:01:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2023-11-30 04:01:23,495 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.640650406504065 [2023-11-30 04:01:23,496 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 788 transitions. [2023-11-30 04:01:23,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 788 transitions. [2023-11-30 04:01:23,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:23,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 788 transitions. [2023-11-30 04:01:23,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.6) internal successors, (788), 5 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:23,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:01:23,499 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:01:23,499 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 6 predicate places. [2023-11-30 04:01:23,499 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 142 transitions, 1708 flow [2023-11-30 04:01:23,500 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 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:01:23,500 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:23,500 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] [2023-11-30 04:01:23,500 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:01:23,500 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:23,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1351770843, now seen corresponding path program 1 times [2023-11-30 04:01:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275081758] [2023-11-30 04:01:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:23,739 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:01:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275081758] [2023-11-30 04:01:23,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275081758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:23,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:23,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:01:23,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775246156] [2023-11-30 04:01:23,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:23,742 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:01:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:01:23,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:01:23,745 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-11-30 04:01:23,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 142 transitions, 1708 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 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:01:23,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:23,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-11-30 04:01:23,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:23,915 INFO L124 PetriNetUnfolderBase]: 509/1196 cut-off events. [2023-11-30 04:01:23,916 INFO L125 PetriNetUnfolderBase]: For 10155/11081 co-relation queries the response was YES. [2023-11-30 04:01:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9260 conditions, 1196 events. 509/1196 cut-off events. For 10155/11081 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6333 event pairs, 318 based on Foata normal form. 36/1146 useless extension candidates. Maximal degree in co-relation 9115. Up to 774 conditions per place. [2023-11-30 04:01:23,926 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 79 selfloop transitions, 3 changer transitions 0/141 dead transitions. [2023-11-30 04:01:23,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 141 transitions, 1874 flow [2023-11-30 04:01:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-11-30 04:01:23,928 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5315040650406504 [2023-11-30 04:01:23,928 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-11-30 04:01:23,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-11-30 04:01:23,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:23,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-11-30 04:01:23,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 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:01:23,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:23,931 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:23,933 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 5 predicate places. [2023-11-30 04:01:23,933 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 141 transitions, 1874 flow [2023-11-30 04:01:23,933 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 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:01:23,934 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:23,934 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] [2023-11-30 04:01:23,934 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:01:23,934 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:23,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash 149952484, now seen corresponding path program 1 times [2023-11-30 04:01:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:23,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162134204] [2023-11-30 04:01:23,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:24,093 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:01:24,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:24,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162134204] [2023-11-30 04:01:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162134204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:01:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298621958] [2023-11-30 04:01:24,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:24,095 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:01:24,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:01:24,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:01:24,096 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246 [2023-11-30 04:01:24,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 141 transitions, 1874 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:01:24,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:24,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246 [2023-11-30 04:01:24,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:24,291 INFO L124 PetriNetUnfolderBase]: 463/1103 cut-off events. [2023-11-30 04:01:24,292 INFO L125 PetriNetUnfolderBase]: For 11199/12197 co-relation queries the response was YES. [2023-11-30 04:01:24,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9231 conditions, 1103 events. 463/1103 cut-off events. For 11199/12197 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5693 event pairs, 286 based on Foata normal form. 28/1053 useless extension candidates. Maximal degree in co-relation 9074. Up to 694 conditions per place. [2023-11-30 04:01:24,302 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 78 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2023-11-30 04:01:24,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 140 transitions, 2040 flow [2023-11-30 04:01:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-11-30 04:01:24,304 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5097560975609756 [2023-11-30 04:01:24,304 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-11-30 04:01:24,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-11-30 04:01:24,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:24,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-11-30 04:01:24,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 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:01:24,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:01:24,308 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:01:24,308 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 5 predicate places. [2023-11-30 04:01:24,308 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 140 transitions, 2040 flow [2023-11-30 04:01:24,308 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:01:24,309 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:24,309 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] [2023-11-30 04:01:24,309 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:01:24,309 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:24,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2062695660, now seen corresponding path program 1 times [2023-11-30 04:01:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:24,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91922450] [2023-11-30 04:01:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:24,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:01:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91922450] [2023-11-30 04:01:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91922450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:24,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228480377] [2023-11-30 04:01:24,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:24,382 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:24,383 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 246 [2023-11-30 04:01:24,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 140 transitions, 2040 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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:01:24,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:24,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 246 [2023-11-30 04:01:24,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:24,529 INFO L124 PetriNetUnfolderBase]: 429/1035 cut-off events. [2023-11-30 04:01:24,530 INFO L125 PetriNetUnfolderBase]: For 12561/13539 co-relation queries the response was YES. [2023-11-30 04:01:24,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9294 conditions, 1035 events. 429/1035 cut-off events. For 12561/13539 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5137 event pairs, 261 based on Foata normal form. 12/977 useless extension candidates. Maximal degree in co-relation 9126. Up to 638 conditions per place. [2023-11-30 04:01:24,540 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 77 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2023-11-30 04:01:24,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 139 transitions, 2182 flow [2023-11-30 04:01:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-11-30 04:01:24,541 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6205962059620597 [2023-11-30 04:01:24,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-11-30 04:01:24,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-11-30 04:01:24,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:24,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-11-30 04:01:24,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:24,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:01:24,544 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 5 predicate places. [2023-11-30 04:01:24,544 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 139 transitions, 2182 flow [2023-11-30 04:01:24,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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:01:24,545 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:24,545 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] [2023-11-30 04:01:24,545 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:01:24,545 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:24,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash 257610379, now seen corresponding path program 1 times [2023-11-30 04:01:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:24,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487833235] [2023-11-30 04:01:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:24,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:24,676 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:01:24,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487833235] [2023-11-30 04:01:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487833235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441917074] [2023-11-30 04:01:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:24,677 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:24,678 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-11-30 04:01:24,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 139 transitions, 2182 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:24,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-11-30 04:01:24,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:24,867 INFO L124 PetriNetUnfolderBase]: 393/963 cut-off events. [2023-11-30 04:01:24,868 INFO L125 PetriNetUnfolderBase]: For 13592/14514 co-relation queries the response was YES. [2023-11-30 04:01:24,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9260 conditions, 963 events. 393/963 cut-off events. For 13592/14514 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4607 event pairs, 234 based on Foata normal form. 12/913 useless extension candidates. Maximal degree in co-relation 9081. Up to 595 conditions per place. [2023-11-30 04:01:24,879 INFO L140 encePairwiseOnDemand]: 241/246 looper letters, 76 selfloop transitions, 3 changer transitions 0/139 dead transitions. [2023-11-30 04:01:24,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 139 transitions, 2354 flow [2023-11-30 04:01:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-11-30 04:01:24,882 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.524390243902439 [2023-11-30 04:01:24,882 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-11-30 04:01:24,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-11-30 04:01:24,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:24,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-11-30 04:01:24,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:01:24,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:24,885 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:01:24,885 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 6 predicate places. [2023-11-30 04:01:24,886 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 139 transitions, 2354 flow [2023-11-30 04:01:24,886 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,886 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:24,886 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] [2023-11-30 04:01:24,886 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:01:24,886 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:24,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash -808858431, now seen corresponding path program 1 times [2023-11-30 04:01:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945224281] [2023-11-30 04:01:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:25,600 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:01:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945224281] [2023-11-30 04:01:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945224281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:25,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454656910] [2023-11-30 04:01:25,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:25,601 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:25,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:25,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:25,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:25,603 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-11-30 04:01:25,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 139 transitions, 2354 flow. Second operand has 15 states, 15 states have (on average 116.93333333333334) internal successors, (1754), 15 states have internal predecessors, (1754), 0 states have call successors, (0), 0 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:01:25,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:25,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-11-30 04:01:25,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:25,899 INFO L124 PetriNetUnfolderBase]: 391/959 cut-off events. [2023-11-30 04:01:25,899 INFO L125 PetriNetUnfolderBase]: For 14653/15519 co-relation queries the response was YES. [2023-11-30 04:01:25,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9870 conditions, 959 events. 391/959 cut-off events. For 14653/15519 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4590 event pairs, 234 based on Foata normal form. 8/905 useless extension candidates. Maximal degree in co-relation 9678. Up to 595 conditions per place. [2023-11-30 04:01:25,908 INFO L140 encePairwiseOnDemand]: 233/246 looper letters, 74 selfloop transitions, 16 changer transitions 0/142 dead transitions. [2023-11-30 04:01:25,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 142 transitions, 2550 flow [2023-11-30 04:01:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:01:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:01:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2023-11-30 04:01:25,910 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.497289972899729 [2023-11-30 04:01:25,910 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2023-11-30 04:01:25,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2023-11-30 04:01:25,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:25,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2023-11-30 04:01:25,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 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:01:25,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 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:01:25,915 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 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:01:25,915 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 14 predicate places. [2023-11-30 04:01:25,915 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 142 transitions, 2550 flow [2023-11-30 04:01:25,916 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 116.93333333333334) internal successors, (1754), 15 states have internal predecessors, (1754), 0 states have call successors, (0), 0 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:01:25,916 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:25,916 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] [2023-11-30 04:01:25,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:01:25,916 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:25,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash 932106738, now seen corresponding path program 1 times [2023-11-30 04:01:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:25,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497887949] [2023-11-30 04:01:25,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:26,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:01:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497887949] [2023-11-30 04:01:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497887949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:26,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252919029] [2023-11-30 04:01:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:26,500 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:26,502 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-11-30 04:01:26,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 142 transitions, 2550 flow. Second operand has 15 states, 15 states have (on average 117.06666666666666) internal successors, (1756), 15 states have internal predecessors, (1756), 0 states have call successors, (0), 0 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:01:26,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:26,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-11-30 04:01:26,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:26,745 INFO L124 PetriNetUnfolderBase]: 389/955 cut-off events. [2023-11-30 04:01:26,745 INFO L125 PetriNetUnfolderBase]: For 16403/17305 co-relation queries the response was YES. [2023-11-30 04:01:26,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10473 conditions, 955 events. 389/955 cut-off events. For 16403/17305 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4593 event pairs, 234 based on Foata normal form. 8/901 useless extension candidates. Maximal degree in co-relation 10268. Up to 595 conditions per place. [2023-11-30 04:01:26,754 INFO L140 encePairwiseOnDemand]: 232/246 looper letters, 73 selfloop transitions, 17 changer transitions 0/142 dead transitions. [2023-11-30 04:01:26,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 142 transitions, 2732 flow [2023-11-30 04:01:26,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 04:01:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 04:01:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1329 transitions. [2023-11-30 04:01:26,756 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4911308203991131 [2023-11-30 04:01:26,757 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1329 transitions. [2023-11-30 04:01:26,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1329 transitions. [2023-11-30 04:01:26,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:26,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1329 transitions. [2023-11-30 04:01:26,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.81818181818181) internal successors, (1329), 11 states have internal predecessors, (1329), 0 states have call successors, (0), 0 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:01:26,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 246.0) internal successors, (2952), 12 states have internal predecessors, (2952), 0 states have call successors, (0), 0 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:01:26,762 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 246.0) internal successors, (2952), 12 states have internal predecessors, (2952), 0 states have call successors, (0), 0 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:01:26,762 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 24 predicate places. [2023-11-30 04:01:26,762 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 142 transitions, 2732 flow [2023-11-30 04:01:26,763 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 117.06666666666666) internal successors, (1756), 15 states have internal predecessors, (1756), 0 states have call successors, (0), 0 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:01:26,763 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:26,763 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] [2023-11-30 04:01:26,763 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:01:26,763 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:26,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash 266100799, now seen corresponding path program 1 times [2023-11-30 04:01:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:26,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780446649] [2023-11-30 04:01:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:27,258 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:01:27,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:27,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780446649] [2023-11-30 04:01:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780446649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:27,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019127366] [2023-11-30 04:01:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:27,261 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:27,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:27,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:27,262 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-11-30 04:01:27,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 142 transitions, 2732 flow. Second operand has 15 states, 15 states have (on average 117.2) internal successors, (1758), 15 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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:01:27,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:27,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-11-30 04:01:27,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:27,522 INFO L124 PetriNetUnfolderBase]: 387/950 cut-off events. [2023-11-30 04:01:27,522 INFO L125 PetriNetUnfolderBase]: For 18306/19268 co-relation queries the response was YES. [2023-11-30 04:01:27,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11067 conditions, 950 events. 387/950 cut-off events. For 18306/19268 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4529 event pairs, 234 based on Foata normal form. 8/896 useless extension candidates. Maximal degree in co-relation 10849. Up to 595 conditions per place. [2023-11-30 04:01:27,532 INFO L140 encePairwiseOnDemand]: 231/246 looper letters, 72 selfloop transitions, 18 changer transitions 0/142 dead transitions. [2023-11-30 04:01:27,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 142 transitions, 2914 flow [2023-11-30 04:01:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 04:01:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 04:01:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1557 transitions. [2023-11-30 04:01:27,535 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.48686679174484054 [2023-11-30 04:01:27,535 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1557 transitions. [2023-11-30 04:01:27,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1557 transitions. [2023-11-30 04:01:27,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:27,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1557 transitions. [2023-11-30 04:01:27,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.76923076923077) internal successors, (1557), 13 states have internal predecessors, (1557), 0 states have call successors, (0), 0 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:01:27,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 246.0) internal successors, (3444), 14 states have internal predecessors, (3444), 0 states have call successors, (0), 0 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:01:27,550 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 246.0) internal successors, (3444), 14 states have internal predecessors, (3444), 0 states have call successors, (0), 0 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:01:27,551 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 36 predicate places. [2023-11-30 04:01:27,551 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 142 transitions, 2914 flow [2023-11-30 04:01:27,552 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 117.2) internal successors, (1758), 15 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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:01:27,552 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:27,552 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] [2023-11-30 04:01:27,552 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:01:27,552 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:27,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash -908795582, now seen corresponding path program 1 times [2023-11-30 04:01:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505053102] [2023-11-30 04:01:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:28,063 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:01:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505053102] [2023-11-30 04:01:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505053102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:28,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:28,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-30 04:01:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139241318] [2023-11-30 04:01:28,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:28,064 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 04:01:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 04:01:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2023-11-30 04:01:28,066 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-11-30 04:01:28,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 142 transitions, 2914 flow. Second operand has 16 states, 16 states have (on average 117.125) internal successors, (1874), 16 states have internal predecessors, (1874), 0 states have call successors, (0), 0 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:01:28,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:28,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-11-30 04:01:28,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:28,367 INFO L124 PetriNetUnfolderBase]: 386/946 cut-off events. [2023-11-30 04:01:28,367 INFO L125 PetriNetUnfolderBase]: For 20440/21462 co-relation queries the response was YES. [2023-11-30 04:01:28,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11668 conditions, 946 events. 386/946 cut-off events. For 20440/21462 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4511 event pairs, 234 based on Foata normal form. 8/892 useless extension candidates. Maximal degree in co-relation 11437. Up to 595 conditions per place. [2023-11-30 04:01:28,379 INFO L140 encePairwiseOnDemand]: 232/246 looper letters, 72 selfloop transitions, 16 changer transitions 0/140 dead transitions. [2023-11-30 04:01:28,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 140 transitions, 3026 flow [2023-11-30 04:01:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 04:01:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 04:01:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1553 transitions. [2023-11-30 04:01:28,383 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.48561601000625393 [2023-11-30 04:01:28,383 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1553 transitions. [2023-11-30 04:01:28,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1553 transitions. [2023-11-30 04:01:28,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:28,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1553 transitions. [2023-11-30 04:01:28,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.46153846153847) internal successors, (1553), 13 states have internal predecessors, (1553), 0 states have call successors, (0), 0 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:01:28,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 246.0) internal successors, (3444), 14 states have internal predecessors, (3444), 0 states have call successors, (0), 0 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:01:28,389 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 246.0) internal successors, (3444), 14 states have internal predecessors, (3444), 0 states have call successors, (0), 0 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:01:28,389 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 47 predicate places. [2023-11-30 04:01:28,389 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 140 transitions, 3026 flow [2023-11-30 04:01:28,389 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 117.125) internal successors, (1874), 16 states have internal predecessors, (1874), 0 states have call successors, (0), 0 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:01:28,389 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:28,390 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] [2023-11-30 04:01:28,390 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:01:28,390 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-11-30 04:01:28,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1759025209, now seen corresponding path program 1 times [2023-11-30 04:01:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919570810] [2023-11-30 04:01:28,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:28,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:28,835 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:01:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919570810] [2023-11-30 04:01:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919570810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:28,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:28,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011605007] [2023-11-30 04:01:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:28,836 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:28,838 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 246 [2023-11-30 04:01:28,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 140 transitions, 3026 flow. Second operand has 15 states, 15 states have (on average 120.53333333333333) internal successors, (1808), 15 states have internal predecessors, (1808), 0 states have call successors, (0), 0 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:01:28,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:28,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 246 [2023-11-30 04:01:28,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:29,274 INFO L124 PetriNetUnfolderBase]: 386/1016 cut-off events. [2023-11-30 04:01:29,275 INFO L125 PetriNetUnfolderBase]: For 13918/16564 co-relation queries the response was YES. [2023-11-30 04:01:29,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12344 conditions, 1016 events. 386/1016 cut-off events. For 13918/16564 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5080 event pairs, 96 based on Foata normal form. 6/970 useless extension candidates. Maximal degree in co-relation 12136. Up to 594 conditions per place. [2023-11-30 04:01:29,279 INFO L140 encePairwiseOnDemand]: 227/246 looper letters, 0 selfloop transitions, 0 changer transitions 151/151 dead transitions. [2023-11-30 04:01:29,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 151 transitions, 3633 flow [2023-11-30 04:01:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:01:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:01:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2076 transitions. [2023-11-30 04:01:29,284 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4964131994261119 [2023-11-30 04:01:29,284 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2076 transitions. [2023-11-30 04:01:29,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2076 transitions. [2023-11-30 04:01:29,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:29,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2076 transitions. [2023-11-30 04:01:29,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 122.11764705882354) internal successors, (2076), 17 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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:01:29,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 246.0) internal successors, (4428), 18 states have internal predecessors, (4428), 0 states have call successors, (0), 0 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:01:29,291 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 246.0) internal successors, (4428), 18 states have internal predecessors, (4428), 0 states have call successors, (0), 0 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:01:29,291 INFO L307 CegarLoopForPetriNet]: 157 programPoint places, 62 predicate places. [2023-11-30 04:01:29,291 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 151 transitions, 3633 flow [2023-11-30 04:01:29,292 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.53333333333333) internal successors, (1808), 15 states have internal predecessors, (1808), 0 states have call successors, (0), 0 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:01:29,298 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/singleton.i_BEv2_AllErrorsAtOnce [2023-11-30 04:01:29,362 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 69 remaining) [2023-11-30 04:01:29,363 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 69 remaining) [2023-11-30 04:01:29,363 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2023-11-30 04:01:29,363 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2023-11-30 04:01:29,363 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2023-11-30 04:01:29,363 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2023-11-30 04:01:29,363 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2023-11-30 04:01:29,364 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2023-11-30 04:01:29,365 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2023-11-30 04:01:29,366 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2023-11-30 04:01:29,367 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2023-11-30 04:01:29,368 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2023-11-30 04:01:29,368 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2023-11-30 04:01:29,368 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2023-11-30 04:01:29,368 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2023-11-30 04:01:29,368 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 04:01:29,368 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:01:29,372 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:01:29,372 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:01:29,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:01:29 BasicIcfg [2023-11-30 04:01:29,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:01:29,377 INFO L158 Benchmark]: Toolchain (without parser) took 22743.07ms. Allocated memory was 564.1MB in the beginning and 12.2GB in the end (delta: 11.6GB). Free memory was 505.4MB in the beginning and 9.6GB in the end (delta: -9.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-11-30 04:01:29,377 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 367.0MB. Free memory is still 312.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:01:29,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.11ms. Allocated memory is still 564.1MB. Free memory was 505.2MB in the beginning and 471.9MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-11-30 04:01:29,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 564.1MB. Free memory was 471.9MB in the beginning and 469.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:01:29,378 INFO L158 Benchmark]: Boogie Preprocessor took 30.07ms. Allocated memory is still 564.1MB. Free memory was 469.6MB in the beginning and 467.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:01:29,378 INFO L158 Benchmark]: RCFGBuilder took 358.78ms. Allocated memory is still 564.1MB. Free memory was 467.7MB in the beginning and 446.5MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-11-30 04:01:29,378 INFO L158 Benchmark]: TraceAbstraction took 21757.50ms. Allocated memory was 564.1MB in the beginning and 12.2GB in the end (delta: 11.6GB). Free memory was 445.3MB in the beginning and 9.6GB in the end (delta: -9.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-11-30 04:01:29,379 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 367.0MB. Free memory is still 312.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 558.11ms. Allocated memory is still 564.1MB. Free memory was 505.2MB in the beginning and 471.9MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 564.1MB. Free memory was 471.9MB in the beginning and 469.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.07ms. Allocated memory is still 564.1MB. Free memory was 469.6MB in the beginning and 467.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 358.78ms. Allocated memory is still 564.1MB. Free memory was 467.7MB in the beginning and 446.5MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 21757.50ms. Allocated memory was 564.1MB in the beginning and 12.2GB in the end (delta: 11.6GB). Free memory was 445.3MB in the beginning and 9.6GB in the end (delta: -9.2GB). Peak memory consumption was 2.4GB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 281 locations, 69 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: 21.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1245 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1245 mSDsluCounter, 482 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2549 IncrementalHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 292 mSDtfsCounter, 2549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3633occurred in iteration=18, InterpolantAutomatonStates: 114, 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, 4.3s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 12096 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:01:29,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...