/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-ext/28_buggy_simple_loop1_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:32:32,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:32:32,238 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:32:32,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:32:32,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:32:32,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:32:32,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:32:32,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:32:32,288 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:32:32,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:32:32,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:32:32,291 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:32:32,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:32:32,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:32:32,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:32:32,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:32:32,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:32:32,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:32:32,293 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:32:32,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:32:32,293 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:32:32,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:32:32,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:32:32,294 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:32:32,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:32:32,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:32:32,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:32:32,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:32:32,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:32:32,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:32:32,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:32:32,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:32:32,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:32:32,296 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:32:32,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:32:32,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:32:32,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:32:32,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:32:32,546 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:32:32,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/28_buggy_simple_loop1_vf.i [2023-11-30 04:32:33,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:32:33,829 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:32:33,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/28_buggy_simple_loop1_vf.i [2023-11-30 04:32:33,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7965c05/99895a3894a04bbd90bbf19d3ef8775d/FLAGdfef3c46b [2023-11-30 04:32:33,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7965c05/99895a3894a04bbd90bbf19d3ef8775d [2023-11-30 04:32:33,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:32:33,860 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:32:33,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:32:33,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:32:33,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:32:33,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:32:33" (1/1) ... [2023-11-30 04:32:33,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5bfe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:33, skipping insertion in model container [2023-11-30 04:32:33,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:32:33" (1/1) ... [2023-11-30 04:32:33,906 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:32:34,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:32:34,133 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:32:34,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:32:34,187 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:32:34,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34 WrapperNode [2023-11-30 04:32:34,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:32:34,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:32:34,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:32:34,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:32:34,196 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:32:34" (1/1) ... [2023-11-30 04:32:34,204 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:32:34" (1/1) ... [2023-11-30 04:32:34,223 INFO L138 Inliner]: procedures = 167, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2023-11-30 04:32:34,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:32:34,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:32:34,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:32:34,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:32:34,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:32:34,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:32:34,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:32:34,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:32:34,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (1/1) ... [2023-11-30 04:32:34,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:32:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:32:34,264 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:32:34,270 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:32:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 04:32:34,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 04:32:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:32:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:32:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:32:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:32:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:32:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:32:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:32:34,290 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:32:34,386 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:32:34,388 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:32:34,496 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:32:34,502 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:32:34,502 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-30 04:32:34,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:32:34 BoogieIcfgContainer [2023-11-30 04:32:34,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:32:34,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:32:34,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:32:34,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:32:34,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:32:33" (1/3) ... [2023-11-30 04:32:34,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdbbde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:32:34, skipping insertion in model container [2023-11-30 04:32:34,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:32:34" (2/3) ... [2023-11-30 04:32:34,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdbbde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:32:34, skipping insertion in model container [2023-11-30 04:32:34,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:32:34" (3/3) ... [2023-11-30 04:32:34,508 INFO L112 eAbstractionObserver]: Analyzing ICFG 28_buggy_simple_loop1_vf.i [2023-11-30 04:32:34,518 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:32:34,518 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-30 04:32:34,518 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:32:34,561 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:34,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 73 transitions, 150 flow [2023-11-30 04:32:34,606 INFO L124 PetriNetUnfolderBase]: 11/86 cut-off events. [2023-11-30 04:32:34,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:34,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 86 events. 11/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2023-11-30 04:32:34,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 73 transitions, 150 flow [2023-11-30 04:32:34,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 73 transitions, 150 flow [2023-11-30 04:32:34,618 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:34,622 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:34,622 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:34,625 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:34,625 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:34,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:34,625 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:34,626 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:34,626 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:34,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1108151473, now seen corresponding path program 1 times [2023-11-30 04:32:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15198418] [2023-11-30 04:32:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:34,814 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:32:34,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:34,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15198418] [2023-11-30 04:32:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15198418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:34,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884508769] [2023-11-30 04:32:34,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:34,825 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:34,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:34,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:34,858 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 73 [2023-11-30 04:32:34,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:32:34,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:34,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 73 [2023-11-30 04:32:34,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:34,904 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2023-11-30 04:32:34,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:34,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 62 events. 4/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 7/62 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2023-11-30 04:32:34,906 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 7 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-11-30 04:32:34,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 134 flow [2023-11-30 04:32:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2023-11-30 04:32:34,916 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7990867579908676 [2023-11-30 04:32:34,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 175 transitions. [2023-11-30 04:32:34,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 175 transitions. [2023-11-30 04:32:34,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:34,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 175 transitions. [2023-11-30 04:32:34,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:32:34,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:32:34,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:32:34,934 INFO L307 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2023-11-30 04:32:34,934 INFO L500 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 134 flow [2023-11-30 04:32:34,934 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:32:34,934 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:34,935 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:34,935 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:32:34,935 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:34,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:34,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1108151474, now seen corresponding path program 1 times [2023-11-30 04:32:34,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:34,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493419819] [2023-11-30 04:32:34,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:34,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:35,043 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:32:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493419819] [2023-11-30 04:32:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493419819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:35,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:35,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888949472] [2023-11-30 04:32:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:35,046 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:35,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:35,049 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 73 [2023-11-30 04:32:35,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:32:35,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:35,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 73 [2023-11-30 04:32:35,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:35,072 INFO L124 PetriNetUnfolderBase]: 4/60 cut-off events. [2023-11-30 04:32:35,073 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 04:32:35,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 60 events. 4/60 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2023-11-30 04:32:35,074 INFO L140 encePairwiseOnDemand]: 71/73 looper letters, 5 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-11-30 04:32:35,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 142 flow [2023-11-30 04:32:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2023-11-30 04:32:35,078 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.771689497716895 [2023-11-30 04:32:35,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 169 transitions. [2023-11-30 04:32:35,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 169 transitions. [2023-11-30 04:32:35,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:35,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 169 transitions. [2023-11-30 04:32:35,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:32:35,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:32:35,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:32:35,083 INFO L307 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2023-11-30 04:32:35,083 INFO L500 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 142 flow [2023-11-30 04:32:35,083 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:32:35,083 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,083 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,084 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:32:35,084 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1700098765, now seen corresponding path program 1 times [2023-11-30 04:32:35,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22064199] [2023-11-30 04:32:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:35,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:35,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:35,177 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:35,178 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:35,179 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:35,179 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:35,179 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:32:35,180 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:35,181 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:35,181 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 04:32:35,220 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:35,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 121 transitions, 252 flow [2023-11-30 04:32:35,253 INFO L124 PetriNetUnfolderBase]: 21/149 cut-off events. [2023-11-30 04:32:35,253 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:32:35,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 149 events. 21/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 349 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-11-30 04:32:35,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 121 transitions, 252 flow [2023-11-30 04:32:35,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 121 transitions, 252 flow [2023-11-30 04:32:35,264 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:35,264 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:35,264 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:35,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:35,266 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:35,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:35,267 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,267 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,267 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2075542122, now seen corresponding path program 1 times [2023-11-30 04:32:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605380251] [2023-11-30 04:32:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:35,328 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:32:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:35,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605380251] [2023-11-30 04:32:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605380251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:35,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:35,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:35,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433902964] [2023-11-30 04:32:35,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:35,329 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:35,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:35,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:35,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:35,330 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 121 [2023-11-30 04:32:35,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:32:35,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:35,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 121 [2023-11-30 04:32:35,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:35,356 INFO L124 PetriNetUnfolderBase]: 8/109 cut-off events. [2023-11-30 04:32:35,358 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:32:35,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 109 events. 8/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 207 event pairs, 0 based on Foata normal form. 13/109 useless extension candidates. Maximal degree in co-relation 87. Up to 9 conditions per place. [2023-11-30 04:32:35,361 INFO L140 encePairwiseOnDemand]: 107/121 looper letters, 8 selfloop transitions, 1 changer transitions 0/97 dead transitions. [2023-11-30 04:32:35,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 222 flow [2023-11-30 04:32:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-11-30 04:32:35,364 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.837465564738292 [2023-11-30 04:32:35,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-11-30 04:32:35,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-11-30 04:32:35,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:35,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-11-30 04:32:35,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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:32:35,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:35,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:35,369 INFO L307 CegarLoopForPetriNet]: 107 programPoint places, -11 predicate places. [2023-11-30 04:32:35,370 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 222 flow [2023-11-30 04:32:35,370 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:32:35,370 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,370 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,370 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:32:35,370 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2075542123, now seen corresponding path program 1 times [2023-11-30 04:32:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803438547] [2023-11-30 04:32:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:35,455 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:32:35,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803438547] [2023-11-30 04:32:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803438547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921348894] [2023-11-30 04:32:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:35,458 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:35,460 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 121 [2023-11-30 04:32:35,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:32:35,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:35,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 121 [2023-11-30 04:32:35,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:35,492 INFO L124 PetriNetUnfolderBase]: 8/106 cut-off events. [2023-11-30 04:32:35,493 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-30 04:32:35,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 106 events. 8/106 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 86. Up to 6 conditions per place. [2023-11-30 04:32:35,493 INFO L140 encePairwiseOnDemand]: 119/121 looper letters, 6 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2023-11-30 04:32:35,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 232 flow [2023-11-30 04:32:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-11-30 04:32:35,496 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8071625344352618 [2023-11-30 04:32:35,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-11-30 04:32:35,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-11-30 04:32:35,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:35,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-11-30 04:32:35,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:32:35,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:35,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:35,499 INFO L307 CegarLoopForPetriNet]: 107 programPoint places, -10 predicate places. [2023-11-30 04:32:35,499 INFO L500 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 232 flow [2023-11-30 04:32:35,499 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:32:35,500 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,500 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,500 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:32:35,500 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2036962861, now seen corresponding path program 1 times [2023-11-30 04:32:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292500544] [2023-11-30 04:32:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:35,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:35,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:35,546 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:35,546 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:35,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:35,550 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:35,550 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:32:35,550 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:35,551 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:35,551 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 04:32:35,614 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:35,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 169 transitions, 356 flow [2023-11-30 04:32:35,648 INFO L124 PetriNetUnfolderBase]: 31/212 cut-off events. [2023-11-30 04:32:35,649 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:32:35,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 212 events. 31/212 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 635 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 156. Up to 8 conditions per place. [2023-11-30 04:32:35,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 169 transitions, 356 flow [2023-11-30 04:32:35,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 169 transitions, 356 flow [2023-11-30 04:32:35,652 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:35,653 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:35,653 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:35,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:35,654 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:35,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:35,654 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,654 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,654 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash 516052051, now seen corresponding path program 1 times [2023-11-30 04:32:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669978313] [2023-11-30 04:32:35,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:35,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:32:35,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669978313] [2023-11-30 04:32:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669978313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:35,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:35,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444753117] [2023-11-30 04:32:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:35,677 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:35,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:35,678 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 169 [2023-11-30 04:32:35,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 169 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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:32:35,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:35,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 169 [2023-11-30 04:32:35,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:35,707 INFO L124 PetriNetUnfolderBase]: 12/156 cut-off events. [2023-11-30 04:32:35,707 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:32:35,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 156 events. 12/156 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 401 event pairs, 0 based on Foata normal form. 29/166 useless extension candidates. Maximal degree in co-relation 126. Up to 12 conditions per place. [2023-11-30 04:32:35,709 INFO L140 encePairwiseOnDemand]: 150/169 looper letters, 9 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2023-11-30 04:32:35,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 137 transitions, 312 flow [2023-11-30 04:32:35,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-30 04:32:35,711 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.854043392504931 [2023-11-30 04:32:35,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-30 04:32:35,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-30 04:32:35,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:35,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-30 04:32:35,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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:32:35,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:32:35,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:32:35,714 INFO L307 CegarLoopForPetriNet]: 148 programPoint places, -14 predicate places. [2023-11-30 04:32:35,715 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 312 flow [2023-11-30 04:32:35,715 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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:32:35,715 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,715 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,715 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:32:35,715 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 516052052, now seen corresponding path program 1 times [2023-11-30 04:32:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432076442] [2023-11-30 04:32:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:35,772 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:32:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432076442] [2023-11-30 04:32:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432076442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:35,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:35,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:35,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079946578] [2023-11-30 04:32:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:35,777 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:35,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:35,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:35,779 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 169 [2023-11-30 04:32:35,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 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:32:35,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:35,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 169 [2023-11-30 04:32:35,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:35,812 INFO L124 PetriNetUnfolderBase]: 12/152 cut-off events. [2023-11-30 04:32:35,812 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-30 04:32:35,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 12/152 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 382 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-11-30 04:32:35,813 INFO L140 encePairwiseOnDemand]: 167/169 looper letters, 7 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2023-11-30 04:32:35,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 136 transitions, 324 flow [2023-11-30 04:32:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-11-30 04:32:35,814 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8224852071005917 [2023-11-30 04:32:35,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-11-30 04:32:35,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-11-30 04:32:35,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:35,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-11-30 04:32:35,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:32:35,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:32:35,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:32:35,817 INFO L307 CegarLoopForPetriNet]: 148 programPoint places, -13 predicate places. [2023-11-30 04:32:35,818 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 136 transitions, 324 flow [2023-11-30 04:32:35,818 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 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:32:35,818 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,818 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,818 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:32:35,818 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2101424110, now seen corresponding path program 1 times [2023-11-30 04:32:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246159192] [2023-11-30 04:32:35,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:35,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:35,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:35,845 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:35,845 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:35,845 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:35,846 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:35,846 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:32:35,846 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:35,846 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:35,846 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 04:32:35,890 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:35,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 217 transitions, 462 flow [2023-11-30 04:32:35,913 INFO L124 PetriNetUnfolderBase]: 41/275 cut-off events. [2023-11-30 04:32:35,913 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 04:32:35,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 275 events. 41/275 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 906 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 220. Up to 10 conditions per place. [2023-11-30 04:32:35,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 217 transitions, 462 flow [2023-11-30 04:32:35,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 217 transitions, 462 flow [2023-11-30 04:32:35,921 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:35,922 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:35,922 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:35,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:35,923 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:35,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:35,926 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,926 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,926 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,926 INFO L85 PathProgramCache]: Analyzing trace with hash 724648556, now seen corresponding path program 1 times [2023-11-30 04:32:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170820722] [2023-11-30 04:32:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:35,952 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:32:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170820722] [2023-11-30 04:32:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170820722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:35,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:35,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925103603] [2023-11-30 04:32:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:35,953 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:35,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:35,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:35,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:35,954 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 217 [2023-11-30 04:32:35,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 217 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 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:32:35,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:35,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 217 [2023-11-30 04:32:35,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:35,987 INFO L124 PetriNetUnfolderBase]: 16/203 cut-off events. [2023-11-30 04:32:35,987 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 04:32:35,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 203 events. 16/203 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 594 event pairs, 0 based on Foata normal form. 60/238 useless extension candidates. Maximal degree in co-relation 180. Up to 15 conditions per place. [2023-11-30 04:32:35,989 INFO L140 encePairwiseOnDemand]: 193/217 looper letters, 10 selfloop transitions, 1 changer transitions 0/177 dead transitions. [2023-11-30 04:32:35,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 177 transitions, 404 flow [2023-11-30 04:32:35,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-11-30 04:32:35,991 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8632872503840245 [2023-11-30 04:32:35,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-11-30 04:32:35,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-11-30 04:32:35,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:35,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-11-30 04:32:35,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 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:32:35,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:35,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:35,994 INFO L307 CegarLoopForPetriNet]: 189 programPoint places, -17 predicate places. [2023-11-30 04:32:35,994 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 177 transitions, 404 flow [2023-11-30 04:32:35,995 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 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:32:35,995 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:35,995 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:35,995 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:32:35,995 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:35,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 724648557, now seen corresponding path program 1 times [2023-11-30 04:32:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432847908] [2023-11-30 04:32:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:36,028 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:32:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432847908] [2023-11-30 04:32:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432847908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878184135] [2023-11-30 04:32:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:36,029 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:36,031 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 217 [2023-11-30 04:32:36,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 177 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:32:36,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:36,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 217 [2023-11-30 04:32:36,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:36,063 INFO L124 PetriNetUnfolderBase]: 16/198 cut-off events. [2023-11-30 04:32:36,064 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-30 04:32:36,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 198 events. 16/198 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 571 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 183. Up to 10 conditions per place. [2023-11-30 04:32:36,066 INFO L140 encePairwiseOnDemand]: 215/217 looper letters, 8 selfloop transitions, 1 changer transitions 0/176 dead transitions. [2023-11-30 04:32:36,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 176 transitions, 418 flow [2023-11-30 04:32:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2023-11-30 04:32:36,067 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8310291858678955 [2023-11-30 04:32:36,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2023-11-30 04:32:36,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2023-11-30 04:32:36,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:36,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2023-11-30 04:32:36,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:32:36,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:36,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:36,071 INFO L307 CegarLoopForPetriNet]: 189 programPoint places, -16 predicate places. [2023-11-30 04:32:36,071 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 176 transitions, 418 flow [2023-11-30 04:32:36,071 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:32:36,071 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,071 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,071 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:32:36,071 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2044779818, now seen corresponding path program 1 times [2023-11-30 04:32:36,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556113526] [2023-11-30 04:32:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:36,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:36,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:36,090 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:36,090 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:36,090 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:36,091 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:36,091 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:32:36,091 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:36,091 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:36,091 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 04:32:36,126 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:36,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 265 transitions, 570 flow [2023-11-30 04:32:36,164 INFO L124 PetriNetUnfolderBase]: 51/338 cut-off events. [2023-11-30 04:32:36,164 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 04:32:36,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 338 events. 51/338 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1188 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 288. Up to 12 conditions per place. [2023-11-30 04:32:36,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 265 transitions, 570 flow [2023-11-30 04:32:36,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 265 transitions, 570 flow [2023-11-30 04:32:36,171 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:36,171 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:36,171 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:36,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:36,172 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:36,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:36,172 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,190 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,191 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1593635659, now seen corresponding path program 1 times [2023-11-30 04:32:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795682434] [2023-11-30 04:32:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:36,206 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:32:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795682434] [2023-11-30 04:32:36,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795682434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:36,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:36,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263347957] [2023-11-30 04:32:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:36,207 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:36,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:36,208 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2023-11-30 04:32:36,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 265 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 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:32:36,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:36,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2023-11-30 04:32:36,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:36,242 INFO L124 PetriNetUnfolderBase]: 20/250 cut-off events. [2023-11-30 04:32:36,242 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 04:32:36,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 250 events. 20/250 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 784 event pairs, 0 based on Foata normal form. 106/325 useless extension candidates. Maximal degree in co-relation 235. Up to 18 conditions per place. [2023-11-30 04:32:36,246 INFO L140 encePairwiseOnDemand]: 236/265 looper letters, 11 selfloop transitions, 1 changer transitions 0/217 dead transitions. [2023-11-30 04:32:36,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 217 transitions, 498 flow [2023-11-30 04:32:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-11-30 04:32:36,247 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.869182389937107 [2023-11-30 04:32:36,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-11-30 04:32:36,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-11-30 04:32:36,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:36,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-11-30 04:32:36,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:36,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:32:36,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:32:36,250 INFO L307 CegarLoopForPetriNet]: 230 programPoint places, -20 predicate places. [2023-11-30 04:32:36,250 INFO L500 AbstractCegarLoop]: Abstraction has has 210 places, 217 transitions, 498 flow [2023-11-30 04:32:36,250 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 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:32:36,251 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,251 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,251 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:32:36,251 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1593635658, now seen corresponding path program 1 times [2023-11-30 04:32:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971724235] [2023-11-30 04:32:36,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:36,273 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:32:36,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:36,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971724235] [2023-11-30 04:32:36,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971724235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:36,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:36,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:36,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793971732] [2023-11-30 04:32:36,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:36,274 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:36,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:36,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:36,275 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 265 [2023-11-30 04:32:36,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 217 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:32:36,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:36,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 265 [2023-11-30 04:32:36,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:36,308 INFO L124 PetriNetUnfolderBase]: 20/244 cut-off events. [2023-11-30 04:32:36,308 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-30 04:32:36,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 244 events. 20/244 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 760 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 238. Up to 12 conditions per place. [2023-11-30 04:32:36,311 INFO L140 encePairwiseOnDemand]: 263/265 looper letters, 9 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2023-11-30 04:32:36,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 216 transitions, 514 flow [2023-11-30 04:32:36,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2023-11-30 04:32:36,313 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8364779874213837 [2023-11-30 04:32:36,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 665 transitions. [2023-11-30 04:32:36,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 665 transitions. [2023-11-30 04:32:36,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:36,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 665 transitions. [2023-11-30 04:32:36,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 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:32:36,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:32:36,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:32:36,315 INFO L307 CegarLoopForPetriNet]: 230 programPoint places, -19 predicate places. [2023-11-30 04:32:36,316 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 216 transitions, 514 flow [2023-11-30 04:32:36,316 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:32:36,316 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,316 INFO L232 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,316 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:32:36,316 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1664879311, now seen corresponding path program 1 times [2023-11-30 04:32:36,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942200540] [2023-11-30 04:32:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:36,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:36,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:36,335 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:36,335 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:36,335 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:36,335 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:36,335 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:32:36,336 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:36,336 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:36,336 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-30 04:32:36,371 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:36,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 313 transitions, 680 flow [2023-11-30 04:32:36,414 INFO L124 PetriNetUnfolderBase]: 61/401 cut-off events. [2023-11-30 04:32:36,414 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-30 04:32:36,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 401 events. 61/401 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1445 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 357. Up to 14 conditions per place. [2023-11-30 04:32:36,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 313 transitions, 680 flow [2023-11-30 04:32:36,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 271 places, 313 transitions, 680 flow [2023-11-30 04:32:36,423 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:36,423 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:36,423 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:36,424 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:36,424 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:36,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:36,424 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,425 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,425 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2143833298, now seen corresponding path program 1 times [2023-11-30 04:32:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894671868] [2023-11-30 04:32:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:36,440 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:32:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:36,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894671868] [2023-11-30 04:32:36,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894671868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:36,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:36,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232575017] [2023-11-30 04:32:36,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:36,441 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:36,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:36,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:36,442 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 313 [2023-11-30 04:32:36,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 313 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 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:32:36,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:36,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 313 [2023-11-30 04:32:36,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:36,488 INFO L124 PetriNetUnfolderBase]: 24/297 cut-off events. [2023-11-30 04:32:36,489 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-30 04:32:36,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 297 events. 24/297 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 991 event pairs, 0 based on Foata normal form. 167/427 useless extension candidates. Maximal degree in co-relation 291. Up to 21 conditions per place. [2023-11-30 04:32:36,492 INFO L140 encePairwiseOnDemand]: 279/313 looper letters, 12 selfloop transitions, 1 changer transitions 0/257 dead transitions. [2023-11-30 04:32:36,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 257 transitions, 594 flow [2023-11-30 04:32:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2023-11-30 04:32:36,494 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.873269435569755 [2023-11-30 04:32:36,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 820 transitions. [2023-11-30 04:32:36,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 820 transitions. [2023-11-30 04:32:36,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:36,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 820 transitions. [2023-11-30 04:32:36,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 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:32:36,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:32:36,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:32:36,497 INFO L307 CegarLoopForPetriNet]: 271 programPoint places, -23 predicate places. [2023-11-30 04:32:36,498 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 257 transitions, 594 flow [2023-11-30 04:32:36,498 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 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:32:36,498 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,498 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,498 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:32:36,498 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2143833297, now seen corresponding path program 1 times [2023-11-30 04:32:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219348861] [2023-11-30 04:32:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:36,521 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:32:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219348861] [2023-11-30 04:32:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219348861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:36,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455540818] [2023-11-30 04:32:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:36,522 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:36,523 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 313 [2023-11-30 04:32:36,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 257 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 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:32:36,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:36,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 313 [2023-11-30 04:32:36,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:36,572 INFO L124 PetriNetUnfolderBase]: 24/290 cut-off events. [2023-11-30 04:32:36,572 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-30 04:32:36,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 290 events. 24/290 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 951 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 294. Up to 14 conditions per place. [2023-11-30 04:32:36,577 INFO L140 encePairwiseOnDemand]: 311/313 looper letters, 10 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2023-11-30 04:32:36,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 256 transitions, 612 flow [2023-11-30 04:32:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2023-11-30 04:32:36,578 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8402555910543131 [2023-11-30 04:32:36,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 789 transitions. [2023-11-30 04:32:36,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 789 transitions. [2023-11-30 04:32:36,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:36,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 789 transitions. [2023-11-30 04:32:36,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 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:32:36,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:32:36,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:32:36,582 INFO L307 CegarLoopForPetriNet]: 271 programPoint places, -22 predicate places. [2023-11-30 04:32:36,582 INFO L500 AbstractCegarLoop]: Abstraction has has 249 places, 256 transitions, 612 flow [2023-11-30 04:32:36,583 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 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:32:36,583 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,583 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,583 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:32:36,583 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1957355737, now seen corresponding path program 1 times [2023-11-30 04:32:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021968713] [2023-11-30 04:32:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:36,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:36,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:36,605 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:36,605 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:36,605 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:36,605 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:36,605 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 04:32:36,605 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:36,606 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:36,606 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-11-30 04:32:36,647 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:36,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 361 transitions, 792 flow [2023-11-30 04:32:36,753 INFO L124 PetriNetUnfolderBase]: 71/464 cut-off events. [2023-11-30 04:32:36,754 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-30 04:32:36,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 464 events. 71/464 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1711 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 427. Up to 16 conditions per place. [2023-11-30 04:32:36,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 361 transitions, 792 flow [2023-11-30 04:32:36,763 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 361 transitions, 792 flow [2023-11-30 04:32:36,764 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:36,764 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:36,764 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:36,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:36,765 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:36,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:36,765 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,765 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,765 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -925944361, now seen corresponding path program 1 times [2023-11-30 04:32:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686858155] [2023-11-30 04:32:36,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:36,782 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:32:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686858155] [2023-11-30 04:32:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686858155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:36,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:36,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828501823] [2023-11-30 04:32:36,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:36,783 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:36,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:36,784 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 361 [2023-11-30 04:32:36,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 361 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 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:32:36,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:36,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 361 [2023-11-30 04:32:36,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:36,848 INFO L124 PetriNetUnfolderBase]: 28/344 cut-off events. [2023-11-30 04:32:36,848 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-30 04:32:36,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 344 events. 28/344 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1191 event pairs, 0 based on Foata normal form. 243/544 useless extension candidates. Maximal degree in co-relation 348. Up to 24 conditions per place. [2023-11-30 04:32:36,853 INFO L140 encePairwiseOnDemand]: 322/361 looper letters, 13 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2023-11-30 04:32:36,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 297 transitions, 692 flow [2023-11-30 04:32:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 949 transitions. [2023-11-30 04:32:36,856 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.876269621421976 [2023-11-30 04:32:36,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 949 transitions. [2023-11-30 04:32:36,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 949 transitions. [2023-11-30 04:32:36,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:36,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 949 transitions. [2023-11-30 04:32:36,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:32:36,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 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:32:36,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 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:32:36,860 INFO L307 CegarLoopForPetriNet]: 312 programPoint places, -26 predicate places. [2023-11-30 04:32:36,860 INFO L500 AbstractCegarLoop]: Abstraction has has 286 places, 297 transitions, 692 flow [2023-11-30 04:32:36,860 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 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:32:36,860 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,860 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,860 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 04:32:36,860 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash -925944360, now seen corresponding path program 1 times [2023-11-30 04:32:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512610487] [2023-11-30 04:32:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:36,887 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:32:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:36,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512610487] [2023-11-30 04:32:36,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512610487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:36,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:36,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:36,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281398723] [2023-11-30 04:32:36,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:36,887 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:36,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:36,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:36,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:36,889 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 361 [2023-11-30 04:32:36,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 297 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 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:32:36,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:36,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 361 [2023-11-30 04:32:36,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:36,952 INFO L124 PetriNetUnfolderBase]: 28/336 cut-off events. [2023-11-30 04:32:36,953 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-11-30 04:32:36,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 336 events. 28/336 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1144 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 351. Up to 16 conditions per place. [2023-11-30 04:32:36,958 INFO L140 encePairwiseOnDemand]: 359/361 looper letters, 11 selfloop transitions, 1 changer transitions 0/296 dead transitions. [2023-11-30 04:32:36,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 296 transitions, 712 flow [2023-11-30 04:32:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2023-11-30 04:32:36,960 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8430286241920592 [2023-11-30 04:32:36,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2023-11-30 04:32:36,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2023-11-30 04:32:36,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:36,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2023-11-30 04:32:36,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 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:32:36,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 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:32:36,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 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:32:36,964 INFO L307 CegarLoopForPetriNet]: 312 programPoint places, -25 predicate places. [2023-11-30 04:32:36,964 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 296 transitions, 712 flow [2023-11-30 04:32:36,964 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 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:32:36,965 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:36,965 INFO L232 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:36,965 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 04:32:36,965 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:36,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1203213456, now seen corresponding path program 1 times [2023-11-30 04:32:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343625280] [2023-11-30 04:32:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:36,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:36,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:36,997 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:36,997 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:36,998 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:36,998 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:36,998 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 04:32:36,998 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:36,999 WARN L227 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:36,999 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2023-11-30 04:32:37,045 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 409 transitions, 906 flow [2023-11-30 04:32:37,115 INFO L124 PetriNetUnfolderBase]: 81/527 cut-off events. [2023-11-30 04:32:37,115 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-30 04:32:37,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 527 events. 81/527 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2005 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 499. Up to 18 conditions per place. [2023-11-30 04:32:37,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 409 transitions, 906 flow [2023-11-30 04:32:37,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 353 places, 409 transitions, 906 flow [2023-11-30 04:32:37,133 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:37,133 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:37,134 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:37,135 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:37,135 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:37,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:37,135 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:37,135 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:37,135 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:37,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2060031152, now seen corresponding path program 1 times [2023-11-30 04:32:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:37,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091461390] [2023-11-30 04:32:37,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:37,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:37,152 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:32:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091461390] [2023-11-30 04:32:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091461390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070077241] [2023-11-30 04:32:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:37,153 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:37,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:37,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:37,154 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 409 [2023-11-30 04:32:37,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 409 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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:32:37,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:37,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 409 [2023-11-30 04:32:37,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:37,225 INFO L124 PetriNetUnfolderBase]: 32/391 cut-off events. [2023-11-30 04:32:37,225 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-30 04:32:37,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 391 events. 32/391 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1391 event pairs, 0 based on Foata normal form. 334/676 useless extension candidates. Maximal degree in co-relation 406. Up to 27 conditions per place. [2023-11-30 04:32:37,232 INFO L140 encePairwiseOnDemand]: 365/409 looper letters, 14 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2023-11-30 04:32:37,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 337 transitions, 792 flow [2023-11-30 04:32:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1078 transitions. [2023-11-30 04:32:37,234 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8785656071719642 [2023-11-30 04:32:37,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1078 transitions. [2023-11-30 04:32:37,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1078 transitions. [2023-11-30 04:32:37,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:37,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1078 transitions. [2023-11-30 04:32:37,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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:32:37,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 409.0) internal successors, (1636), 4 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:32:37,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 409.0) internal successors, (1636), 4 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:32:37,262 INFO L307 CegarLoopForPetriNet]: 353 programPoint places, -29 predicate places. [2023-11-30 04:32:37,262 INFO L500 AbstractCegarLoop]: Abstraction has has 324 places, 337 transitions, 792 flow [2023-11-30 04:32:37,263 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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:32:37,263 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:37,265 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:37,265 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 04:32:37,265 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:37,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2060031153, now seen corresponding path program 1 times [2023-11-30 04:32:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752771357] [2023-11-30 04:32:37,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:37,308 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:32:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752771357] [2023-11-30 04:32:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752771357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:37,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:37,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758925798] [2023-11-30 04:32:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:37,309 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:37,310 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 409 [2023-11-30 04:32:37,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 337 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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:32:37,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:37,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 409 [2023-11-30 04:32:37,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:37,376 INFO L124 PetriNetUnfolderBase]: 32/382 cut-off events. [2023-11-30 04:32:37,377 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-30 04:32:37,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 382 events. 32/382 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1329 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 409. Up to 18 conditions per place. [2023-11-30 04:32:37,384 INFO L140 encePairwiseOnDemand]: 407/409 looper letters, 12 selfloop transitions, 1 changer transitions 0/336 dead transitions. [2023-11-30 04:32:37,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 336 transitions, 814 flow [2023-11-30 04:32:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1037 transitions. [2023-11-30 04:32:37,386 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8451507742461287 [2023-11-30 04:32:37,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1037 transitions. [2023-11-30 04:32:37,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1037 transitions. [2023-11-30 04:32:37,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:37,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1037 transitions. [2023-11-30 04:32:37,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 345.6666666666667) internal successors, (1037), 3 states have internal predecessors, (1037), 0 states have call successors, (0), 0 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:32:37,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 409.0) internal successors, (1636), 4 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:32:37,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 409.0) internal successors, (1636), 4 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:32:37,390 INFO L307 CegarLoopForPetriNet]: 353 programPoint places, -28 predicate places. [2023-11-30 04:32:37,390 INFO L500 AbstractCegarLoop]: Abstraction has has 325 places, 336 transitions, 814 flow [2023-11-30 04:32:37,391 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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:32:37,391 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:37,391 INFO L232 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:37,391 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-30 04:32:37,391 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:37,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1331563484, now seen corresponding path program 1 times [2023-11-30 04:32:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:37,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674412555] [2023-11-30 04:32:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:37,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:37,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:37,439 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:37,439 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:37,440 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:37,440 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:37,440 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-30 04:32:37,440 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:37,440 WARN L227 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:37,440 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2023-11-30 04:32:37,491 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:37,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 394 places, 457 transitions, 1022 flow [2023-11-30 04:32:37,588 INFO L124 PetriNetUnfolderBase]: 91/590 cut-off events. [2023-11-30 04:32:37,588 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-11-30 04:32:37,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 590 events. 91/590 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2268 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 572. Up to 20 conditions per place. [2023-11-30 04:32:37,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 394 places, 457 transitions, 1022 flow [2023-11-30 04:32:37,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 394 places, 457 transitions, 1022 flow [2023-11-30 04:32:37,617 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:37,619 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:37,619 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:37,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:37,620 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-30 04:32:37,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:37,620 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:37,620 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:37,620 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:37,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1775841351, now seen corresponding path program 1 times [2023-11-30 04:32:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:37,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884693261] [2023-11-30 04:32:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:37,639 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:32:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884693261] [2023-11-30 04:32:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884693261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:37,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:37,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976724590] [2023-11-30 04:32:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:37,639 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:37,641 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 457 [2023-11-30 04:32:37,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 457 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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:32:37,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:37,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 457 [2023-11-30 04:32:37,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:37,743 INFO L124 PetriNetUnfolderBase]: 36/438 cut-off events. [2023-11-30 04:32:37,743 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-11-30 04:32:37,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 438 events. 36/438 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1584 event pairs, 0 based on Foata normal form. 440/823 useless extension candidates. Maximal degree in co-relation 465. Up to 30 conditions per place. [2023-11-30 04:32:37,758 INFO L140 encePairwiseOnDemand]: 408/457 looper letters, 15 selfloop transitions, 1 changer transitions 0/377 dead transitions. [2023-11-30 04:32:37,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 377 transitions, 894 flow [2023-11-30 04:32:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2023-11-30 04:32:37,761 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8803792851932896 [2023-11-30 04:32:37,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2023-11-30 04:32:37,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2023-11-30 04:32:37,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:37,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2023-11-30 04:32:37,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 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:32:37,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 457.0) internal successors, (1828), 4 states have internal predecessors, (1828), 0 states have call successors, (0), 0 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:32:37,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 457.0) internal successors, (1828), 4 states have internal predecessors, (1828), 0 states have call successors, (0), 0 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:32:37,776 INFO L307 CegarLoopForPetriNet]: 394 programPoint places, -32 predicate places. [2023-11-30 04:32:37,776 INFO L500 AbstractCegarLoop]: Abstraction has has 362 places, 377 transitions, 894 flow [2023-11-30 04:32:37,776 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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:32:37,776 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:37,776 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:37,777 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-30 04:32:37,777 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:37,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1775841350, now seen corresponding path program 1 times [2023-11-30 04:32:37,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:37,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703809248] [2023-11-30 04:32:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:37,809 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:32:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703809248] [2023-11-30 04:32:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703809248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189342615] [2023-11-30 04:32:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:37,810 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:37,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:37,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:37,812 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 457 [2023-11-30 04:32:37,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 377 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 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:32:37,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:37,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 457 [2023-11-30 04:32:37,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:38,042 INFO L124 PetriNetUnfolderBase]: 36/428 cut-off events. [2023-11-30 04:32:38,043 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2023-11-30 04:32:38,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 428 events. 36/428 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1513 event pairs, 0 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 468. Up to 20 conditions per place. [2023-11-30 04:32:38,054 INFO L140 encePairwiseOnDemand]: 455/457 looper letters, 13 selfloop transitions, 1 changer transitions 0/376 dead transitions. [2023-11-30 04:32:38,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 376 transitions, 918 flow [2023-11-30 04:32:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1161 transitions. [2023-11-30 04:32:38,056 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8468271334792122 [2023-11-30 04:32:38,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1161 transitions. [2023-11-30 04:32:38,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1161 transitions. [2023-11-30 04:32:38,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:38,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1161 transitions. [2023-11-30 04:32:38,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 387.0) internal successors, (1161), 3 states have internal predecessors, (1161), 0 states have call successors, (0), 0 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:32:38,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 457.0) internal successors, (1828), 4 states have internal predecessors, (1828), 0 states have call successors, (0), 0 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:32:38,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 457.0) internal successors, (1828), 4 states have internal predecessors, (1828), 0 states have call successors, (0), 0 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:32:38,060 INFO L307 CegarLoopForPetriNet]: 394 programPoint places, -31 predicate places. [2023-11-30 04:32:38,060 INFO L500 AbstractCegarLoop]: Abstraction has has 363 places, 376 transitions, 918 flow [2023-11-30 04:32:38,061 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 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:32:38,061 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:38,061 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:38,061 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-30 04:32:38,061 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:38,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -504579631, now seen corresponding path program 1 times [2023-11-30 04:32:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215262705] [2023-11-30 04:32:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:38,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:38,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:38,087 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:38,087 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:38,087 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:38,087 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:38,087 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-30 04:32:38,087 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:38,088 WARN L227 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:38,088 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2023-11-30 04:32:38,149 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:38,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 505 transitions, 1140 flow [2023-11-30 04:32:38,271 INFO L124 PetriNetUnfolderBase]: 101/653 cut-off events. [2023-11-30 04:32:38,272 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-11-30 04:32:38,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 653 events. 101/653 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2547 event pairs, 0 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 646. Up to 22 conditions per place. [2023-11-30 04:32:38,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 435 places, 505 transitions, 1140 flow [2023-11-30 04:32:38,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 435 places, 505 transitions, 1140 flow [2023-11-30 04:32:38,299 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:38,299 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:38,299 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:38,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:38,301 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:38,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:38,301 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:38,301 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:38,301 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:38,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash 451340018, now seen corresponding path program 1 times [2023-11-30 04:32:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:38,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841139478] [2023-11-30 04:32:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:38,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:38,316 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:32:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841139478] [2023-11-30 04:32:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841139478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:38,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:38,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125674697] [2023-11-30 04:32:38,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:38,316 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:38,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:38,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:38,318 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 505 [2023-11-30 04:32:38,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 505 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:32:38,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:38,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 505 [2023-11-30 04:32:38,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:38,418 INFO L124 PetriNetUnfolderBase]: 40/485 cut-off events. [2023-11-30 04:32:38,418 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-11-30 04:32:38,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 485 events. 40/485 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1787 event pairs, 0 based on Foata normal form. 561/985 useless extension candidates. Maximal degree in co-relation 525. Up to 33 conditions per place. [2023-11-30 04:32:38,431 INFO L140 encePairwiseOnDemand]: 451/505 looper letters, 16 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2023-11-30 04:32:38,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 417 transitions, 998 flow [2023-11-30 04:32:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1336 transitions. [2023-11-30 04:32:38,433 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8818481848184818 [2023-11-30 04:32:38,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1336 transitions. [2023-11-30 04:32:38,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1336 transitions. [2023-11-30 04:32:38,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:38,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1336 transitions. [2023-11-30 04:32:38,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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:32:38,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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:32:38,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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:32:38,438 INFO L307 CegarLoopForPetriNet]: 435 programPoint places, -35 predicate places. [2023-11-30 04:32:38,438 INFO L500 AbstractCegarLoop]: Abstraction has has 400 places, 417 transitions, 998 flow [2023-11-30 04:32:38,438 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:32:38,438 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:38,438 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:38,438 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-30 04:32:38,438 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:38,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash 451340019, now seen corresponding path program 1 times [2023-11-30 04:32:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54759257] [2023-11-30 04:32:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:38,460 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:32:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:38,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54759257] [2023-11-30 04:32:38,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54759257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:38,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:38,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279810491] [2023-11-30 04:32:38,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:38,461 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:38,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:38,463 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 505 [2023-11-30 04:32:38,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 417 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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:32:38,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:38,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 505 [2023-11-30 04:32:38,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:38,615 INFO L124 PetriNetUnfolderBase]: 40/474 cut-off events. [2023-11-30 04:32:38,615 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2023-11-30 04:32:38,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 474 events. 40/474 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1711 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 528. Up to 22 conditions per place. [2023-11-30 04:32:38,623 INFO L140 encePairwiseOnDemand]: 503/505 looper letters, 14 selfloop transitions, 1 changer transitions 0/416 dead transitions. [2023-11-30 04:32:38,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 416 transitions, 1024 flow [2023-11-30 04:32:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2023-11-30 04:32:38,625 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8481848184818482 [2023-11-30 04:32:38,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2023-11-30 04:32:38,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2023-11-30 04:32:38,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:38,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2023-11-30 04:32:38,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:32:38,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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:32:38,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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:32:38,630 INFO L307 CegarLoopForPetriNet]: 435 programPoint places, -34 predicate places. [2023-11-30 04:32:38,630 INFO L500 AbstractCegarLoop]: Abstraction has has 401 places, 416 transitions, 1024 flow [2023-11-30 04:32:38,630 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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:32:38,630 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:38,630 INFO L232 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:38,630 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-30 04:32:38,630 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:38,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2074014753, now seen corresponding path program 1 times [2023-11-30 04:32:38,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:38,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321539327] [2023-11-30 04:32:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:38,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:38,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:38,657 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:38,657 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:38,657 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:38,657 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:38,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-30 04:32:38,657 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:38,657 WARN L227 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:38,657 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2023-11-30 04:32:38,715 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:38,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 553 transitions, 1260 flow [2023-11-30 04:32:38,841 INFO L124 PetriNetUnfolderBase]: 111/716 cut-off events. [2023-11-30 04:32:38,841 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2023-11-30 04:32:38,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 716 events. 111/716 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2780 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 721. Up to 24 conditions per place. [2023-11-30 04:32:38,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 476 places, 553 transitions, 1260 flow [2023-11-30 04:32:38,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 476 places, 553 transitions, 1260 flow [2023-11-30 04:32:38,880 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:38,880 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:38,880 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:38,881 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:38,881 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:38,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:38,881 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:38,881 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:38,881 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:38,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash 151640667, now seen corresponding path program 1 times [2023-11-30 04:32:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:38,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778929250] [2023-11-30 04:32:38,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:38,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:38,898 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:32:38,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:38,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778929250] [2023-11-30 04:32:38,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778929250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:38,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:38,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942135122] [2023-11-30 04:32:38,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:38,899 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:38,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:38,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:38,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:38,901 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 553 [2023-11-30 04:32:38,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 553 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 465.0) internal successors, (1395), 3 states have internal predecessors, (1395), 0 states have call successors, (0), 0 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:32:38,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:38,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 553 [2023-11-30 04:32:38,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:39,028 INFO L124 PetriNetUnfolderBase]: 44/532 cut-off events. [2023-11-30 04:32:39,028 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2023-11-30 04:32:39,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 532 events. 44/532 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1984 event pairs, 0 based on Foata normal form. 697/1162 useless extension candidates. Maximal degree in co-relation 586. Up to 36 conditions per place. [2023-11-30 04:32:39,052 INFO L140 encePairwiseOnDemand]: 494/553 looper letters, 17 selfloop transitions, 1 changer transitions 0/457 dead transitions. [2023-11-30 04:32:39,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 457 transitions, 1104 flow [2023-11-30 04:32:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2023-11-30 04:32:39,055 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8830620855937311 [2023-11-30 04:32:39,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1465 transitions. [2023-11-30 04:32:39,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1465 transitions. [2023-11-30 04:32:39,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:39,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1465 transitions. [2023-11-30 04:32:39,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 488.3333333333333) internal successors, (1465), 3 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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:32:39,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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:32:39,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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:32:39,060 INFO L307 CegarLoopForPetriNet]: 476 programPoint places, -38 predicate places. [2023-11-30 04:32:39,060 INFO L500 AbstractCegarLoop]: Abstraction has has 438 places, 457 transitions, 1104 flow [2023-11-30 04:32:39,060 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 465.0) internal successors, (1395), 3 states have internal predecessors, (1395), 0 states have call successors, (0), 0 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:32:39,060 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:39,060 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:39,060 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-30 04:32:39,060 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:39,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash 151640668, now seen corresponding path program 1 times [2023-11-30 04:32:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:39,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672920224] [2023-11-30 04:32:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:39,085 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:32:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:39,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672920224] [2023-11-30 04:32:39,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672920224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:39,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:39,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:39,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780000860] [2023-11-30 04:32:39,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:39,085 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:39,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:39,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:39,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:39,087 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 553 [2023-11-30 04:32:39,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 457 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 465.6666666666667) internal successors, (1397), 3 states have internal predecessors, (1397), 0 states have call successors, (0), 0 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:32:39,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:39,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 553 [2023-11-30 04:32:39,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:39,278 INFO L124 PetriNetUnfolderBase]: 44/520 cut-off events. [2023-11-30 04:32:39,278 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2023-11-30 04:32:39,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 520 events. 44/520 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1898 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 589. Up to 24 conditions per place. [2023-11-30 04:32:39,290 INFO L140 encePairwiseOnDemand]: 551/553 looper letters, 15 selfloop transitions, 1 changer transitions 0/456 dead transitions. [2023-11-30 04:32:39,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 456 transitions, 1132 flow [2023-11-30 04:32:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1409 transitions. [2023-11-30 04:32:39,292 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8493068113321278 [2023-11-30 04:32:39,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1409 transitions. [2023-11-30 04:32:39,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1409 transitions. [2023-11-30 04:32:39,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:39,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1409 transitions. [2023-11-30 04:32:39,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 469.6666666666667) internal successors, (1409), 3 states have internal predecessors, (1409), 0 states have call successors, (0), 0 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:32:39,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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:32:39,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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:32:39,297 INFO L307 CegarLoopForPetriNet]: 476 programPoint places, -37 predicate places. [2023-11-30 04:32:39,297 INFO L500 AbstractCegarLoop]: Abstraction has has 439 places, 456 transitions, 1132 flow [2023-11-30 04:32:39,298 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 465.6666666666667) internal successors, (1397), 3 states have internal predecessors, (1397), 0 states have call successors, (0), 0 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:32:39,298 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:39,298 INFO L232 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 11, 11, 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:32:39,298 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-30 04:32:39,298 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:39,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash 187915762, now seen corresponding path program 1 times [2023-11-30 04:32:39,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:39,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769243921] [2023-11-30 04:32:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:39,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:39,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:39,331 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:39,331 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:39,331 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:39,331 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:39,331 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-30 04:32:39,331 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:39,332 WARN L227 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:39,332 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2023-11-30 04:32:39,394 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:39,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 601 transitions, 1382 flow [2023-11-30 04:32:39,549 INFO L124 PetriNetUnfolderBase]: 121/779 cut-off events. [2023-11-30 04:32:39,550 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2023-11-30 04:32:39,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 779 events. 121/779 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3054 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 797. Up to 26 conditions per place. [2023-11-30 04:32:39,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 517 places, 601 transitions, 1382 flow [2023-11-30 04:32:39,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 517 places, 601 transitions, 1382 flow [2023-11-30 04:32:39,600 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:39,600 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:39,600 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:39,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:39,601 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:39,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:39,601 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:39,601 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:39,601 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:39,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1620027892, now seen corresponding path program 1 times [2023-11-30 04:32:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:39,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183302436] [2023-11-30 04:32:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:39,618 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:32:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183302436] [2023-11-30 04:32:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183302436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:39,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103589353] [2023-11-30 04:32:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:39,619 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:39,620 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 601 [2023-11-30 04:32:39,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 601 transitions, 1382 flow. Second operand has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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:32:39,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:39,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 601 [2023-11-30 04:32:39,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:39,776 INFO L124 PetriNetUnfolderBase]: 48/579 cut-off events. [2023-11-30 04:32:39,776 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2023-11-30 04:32:39,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 579 events. 48/579 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2177 event pairs, 0 based on Foata normal form. 848/1354 useless extension candidates. Maximal degree in co-relation 648. Up to 39 conditions per place. [2023-11-30 04:32:39,803 INFO L140 encePairwiseOnDemand]: 537/601 looper letters, 18 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2023-11-30 04:32:39,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 497 transitions, 1212 flow [2023-11-30 04:32:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2023-11-30 04:32:39,806 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8840820854132002 [2023-11-30 04:32:39,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2023-11-30 04:32:39,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2023-11-30 04:32:39,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:39,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2023-11-30 04:32:39,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 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:32:39,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 601.0) internal successors, (2404), 4 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:32:39,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 601.0) internal successors, (2404), 4 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:32:39,811 INFO L307 CegarLoopForPetriNet]: 517 programPoint places, -41 predicate places. [2023-11-30 04:32:39,811 INFO L500 AbstractCegarLoop]: Abstraction has has 476 places, 497 transitions, 1212 flow [2023-11-30 04:32:39,811 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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:32:39,811 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:39,811 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:39,811 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-30 04:32:39,812 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:39,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1620027893, now seen corresponding path program 1 times [2023-11-30 04:32:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:39,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330631554] [2023-11-30 04:32:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:39,856 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:32:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330631554] [2023-11-30 04:32:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330631554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:39,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:39,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506050102] [2023-11-30 04:32:39,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:39,857 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:39,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:39,859 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 505 out of 601 [2023-11-30 04:32:39,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 497 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 0 states have call successors, (0), 0 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:32:39,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:39,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 505 of 601 [2023-11-30 04:32:39,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:40,100 INFO L124 PetriNetUnfolderBase]: 48/566 cut-off events. [2023-11-30 04:32:40,100 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-11-30 04:32:40,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 566 events. 48/566 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2100 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 651. Up to 26 conditions per place. [2023-11-30 04:32:40,118 INFO L140 encePairwiseOnDemand]: 599/601 looper letters, 16 selfloop transitions, 1 changer transitions 0/496 dead transitions. [2023-11-30 04:32:40,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 496 transitions, 1242 flow [2023-11-30 04:32:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1533 transitions. [2023-11-30 04:32:40,121 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8502495840266223 [2023-11-30 04:32:40,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1533 transitions. [2023-11-30 04:32:40,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1533 transitions. [2023-11-30 04:32:40,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:40,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1533 transitions. [2023-11-30 04:32:40,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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:32:40,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 601.0) internal successors, (2404), 4 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:32:40,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 601.0) internal successors, (2404), 4 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:32:40,125 INFO L307 CegarLoopForPetriNet]: 517 programPoint places, -40 predicate places. [2023-11-30 04:32:40,126 INFO L500 AbstractCegarLoop]: Abstraction has has 477 places, 496 transitions, 1242 flow [2023-11-30 04:32:40,126 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 0 states have call successors, (0), 0 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:32:40,126 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:40,126 INFO L232 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 12, 12, 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:32:40,126 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-30 04:32:40,126 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:40,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1138772194, now seen corresponding path program 1 times [2023-11-30 04:32:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183628236] [2023-11-30 04:32:40,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:40,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:40,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:40,156 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:40,156 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:40,156 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:40,156 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:40,156 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-30 04:32:40,157 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:40,157 WARN L227 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:40,157 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2023-11-30 04:32:40,224 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:40,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 558 places, 649 transitions, 1506 flow [2023-11-30 04:32:40,392 INFO L124 PetriNetUnfolderBase]: 131/842 cut-off events. [2023-11-30 04:32:40,392 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2023-11-30 04:32:40,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 842 events. 131/842 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3320 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 874. Up to 28 conditions per place. [2023-11-30 04:32:40,432 INFO L82 GeneralOperation]: Start removeDead. Operand has 558 places, 649 transitions, 1506 flow [2023-11-30 04:32:40,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 558 places, 649 transitions, 1506 flow [2023-11-30 04:32:40,443 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:40,443 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:40,443 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:40,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:40,444 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:40,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:40,444 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:40,444 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:40,444 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:40,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash 561534397, now seen corresponding path program 1 times [2023-11-30 04:32:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:40,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853776995] [2023-11-30 04:32:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:40,460 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:32:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:40,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853776995] [2023-11-30 04:32:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853776995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:40,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634063030] [2023-11-30 04:32:40,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:40,461 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:40,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:40,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:40,463 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 649 [2023-11-30 04:32:40,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 649 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 0 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:32:40,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:40,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 649 [2023-11-30 04:32:40,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:40,665 INFO L124 PetriNetUnfolderBase]: 52/626 cut-off events. [2023-11-30 04:32:40,666 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2023-11-30 04:32:40,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 626 events. 52/626 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2379 event pairs, 0 based on Foata normal form. 1014/1561 useless extension candidates. Maximal degree in co-relation 712. Up to 42 conditions per place. [2023-11-30 04:32:40,688 INFO L140 encePairwiseOnDemand]: 580/649 looper letters, 19 selfloop transitions, 1 changer transitions 0/537 dead transitions. [2023-11-30 04:32:40,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 537 transitions, 1322 flow [2023-11-30 04:32:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1723 transitions. [2023-11-30 04:32:40,691 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8849512069851053 [2023-11-30 04:32:40,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1723 transitions. [2023-11-30 04:32:40,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1723 transitions. [2023-11-30 04:32:40,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:40,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1723 transitions. [2023-11-30 04:32:40,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 574.3333333333334) internal successors, (1723), 3 states have internal predecessors, (1723), 0 states have call successors, (0), 0 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:32:40,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 649.0) internal successors, (2596), 4 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:32:40,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 649.0) internal successors, (2596), 4 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:32:40,698 INFO L307 CegarLoopForPetriNet]: 558 programPoint places, -44 predicate places. [2023-11-30 04:32:40,698 INFO L500 AbstractCegarLoop]: Abstraction has has 514 places, 537 transitions, 1322 flow [2023-11-30 04:32:40,698 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 0 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:32:40,698 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:40,698 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:40,698 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-30 04:32:40,698 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:40,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:40,699 INFO L85 PathProgramCache]: Analyzing trace with hash 561534398, now seen corresponding path program 1 times [2023-11-30 04:32:40,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:40,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530634714] [2023-11-30 04:32:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:40,727 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:32:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530634714] [2023-11-30 04:32:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530634714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599798848] [2023-11-30 04:32:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:40,728 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:40,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:40,729 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 649 [2023-11-30 04:32:40,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 537 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 547.6666666666666) internal successors, (1643), 3 states have internal predecessors, (1643), 0 states have call successors, (0), 0 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:32:40,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:40,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 649 [2023-11-30 04:32:40,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:40,919 INFO L124 PetriNetUnfolderBase]: 52/612 cut-off events. [2023-11-30 04:32:40,920 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2023-11-30 04:32:40,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 612 events. 52/612 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2275 event pairs, 0 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 714. Up to 28 conditions per place. [2023-11-30 04:32:40,949 INFO L140 encePairwiseOnDemand]: 647/649 looper letters, 17 selfloop transitions, 1 changer transitions 0/536 dead transitions. [2023-11-30 04:32:40,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 536 transitions, 1354 flow [2023-11-30 04:32:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1657 transitions. [2023-11-30 04:32:40,952 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8510529019003595 [2023-11-30 04:32:40,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1657 transitions. [2023-11-30 04:32:40,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1657 transitions. [2023-11-30 04:32:40,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:40,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1657 transitions. [2023-11-30 04:32:40,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 552.3333333333334) internal successors, (1657), 3 states have internal predecessors, (1657), 0 states have call successors, (0), 0 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:32:40,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 649.0) internal successors, (2596), 4 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:32:40,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 649.0) internal successors, (2596), 4 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:32:40,958 INFO L307 CegarLoopForPetriNet]: 558 programPoint places, -43 predicate places. [2023-11-30 04:32:40,958 INFO L500 AbstractCegarLoop]: Abstraction has has 515 places, 536 transitions, 1354 flow [2023-11-30 04:32:40,958 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.6666666666666) internal successors, (1643), 3 states have internal predecessors, (1643), 0 states have call successors, (0), 0 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:32:40,958 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:40,958 INFO L232 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 13, 13, 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:32:40,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-30 04:32:40,958 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:40,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash -978665517, now seen corresponding path program 1 times [2023-11-30 04:32:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:40,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988304781] [2023-11-30 04:32:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:40,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:40,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:40,996 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:40,996 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:40,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:40,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:40,996 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-30 04:32:40,996 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:40,997 WARN L227 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:40,997 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2023-11-30 04:32:41,077 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:41,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 599 places, 697 transitions, 1632 flow [2023-11-30 04:32:41,318 INFO L124 PetriNetUnfolderBase]: 141/905 cut-off events. [2023-11-30 04:32:41,318 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-11-30 04:32:41,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 905 events. 141/905 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3604 event pairs, 0 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 952. Up to 30 conditions per place. [2023-11-30 04:32:41,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 599 places, 697 transitions, 1632 flow [2023-11-30 04:32:41,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 599 places, 697 transitions, 1632 flow [2023-11-30 04:32:41,388 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:41,388 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:41,388 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:41,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:41,389 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:41,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:41,389 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:41,389 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:41,389 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:41,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1271127478, now seen corresponding path program 1 times [2023-11-30 04:32:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:41,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271509650] [2023-11-30 04:32:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:41,406 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:32:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:41,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271509650] [2023-11-30 04:32:41,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271509650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:41,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:41,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:41,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178542052] [2023-11-30 04:32:41,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:41,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:41,409 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 697 [2023-11-30 04:32:41,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 697 transitions, 1632 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 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:32:41,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:41,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 697 [2023-11-30 04:32:41,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:41,616 INFO L124 PetriNetUnfolderBase]: 56/673 cut-off events. [2023-11-30 04:32:41,617 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-11-30 04:32:41,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 673 events. 56/673 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2576 event pairs, 0 based on Foata normal form. 1195/1783 useless extension candidates. Maximal degree in co-relation 777. Up to 45 conditions per place. [2023-11-30 04:32:41,656 INFO L140 encePairwiseOnDemand]: 623/697 looper letters, 20 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2023-11-30 04:32:41,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 577 transitions, 1434 flow [2023-11-30 04:32:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2023-11-30 04:32:41,659 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8857006217120995 [2023-11-30 04:32:41,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1852 transitions. [2023-11-30 04:32:41,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1852 transitions. [2023-11-30 04:32:41,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:41,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1852 transitions. [2023-11-30 04:32:41,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 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:32:41,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 697.0) internal successors, (2788), 4 states have internal predecessors, (2788), 0 states have call successors, (0), 0 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:32:41,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 697.0) internal successors, (2788), 4 states have internal predecessors, (2788), 0 states have call successors, (0), 0 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:32:41,665 INFO L307 CegarLoopForPetriNet]: 599 programPoint places, -47 predicate places. [2023-11-30 04:32:41,665 INFO L500 AbstractCegarLoop]: Abstraction has has 552 places, 577 transitions, 1434 flow [2023-11-30 04:32:41,666 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 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:32:41,666 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:41,666 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:41,666 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-30 04:32:41,666 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:41,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1271127479, now seen corresponding path program 1 times [2023-11-30 04:32:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978986693] [2023-11-30 04:32:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:41,689 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:32:41,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:41,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978986693] [2023-11-30 04:32:41,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978986693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:41,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:41,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:41,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967819346] [2023-11-30 04:32:41,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:41,690 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:41,691 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 697 [2023-11-30 04:32:41,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 577 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 588.6666666666666) internal successors, (1766), 3 states have internal predecessors, (1766), 0 states have call successors, (0), 0 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:32:41,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:41,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 697 [2023-11-30 04:32:41,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:41,917 INFO L124 PetriNetUnfolderBase]: 56/658 cut-off events. [2023-11-30 04:32:41,917 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2023-11-30 04:32:41,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 658 events. 56/658 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2464 event pairs, 0 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 778. Up to 30 conditions per place. [2023-11-30 04:32:41,943 INFO L140 encePairwiseOnDemand]: 695/697 looper letters, 18 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2023-11-30 04:32:41,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 576 transitions, 1468 flow [2023-11-30 04:32:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1781 transitions. [2023-11-30 04:32:41,946 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8517455762792921 [2023-11-30 04:32:41,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1781 transitions. [2023-11-30 04:32:41,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1781 transitions. [2023-11-30 04:32:41,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:41,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1781 transitions. [2023-11-30 04:32:41,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 593.6666666666666) internal successors, (1781), 3 states have internal predecessors, (1781), 0 states have call successors, (0), 0 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:32:41,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 697.0) internal successors, (2788), 4 states have internal predecessors, (2788), 0 states have call successors, (0), 0 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:32:41,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 697.0) internal successors, (2788), 4 states have internal predecessors, (2788), 0 states have call successors, (0), 0 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:32:41,951 INFO L307 CegarLoopForPetriNet]: 599 programPoint places, -46 predicate places. [2023-11-30 04:32:41,951 INFO L500 AbstractCegarLoop]: Abstraction has has 553 places, 576 transitions, 1468 flow [2023-11-30 04:32:41,952 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.6666666666666) internal successors, (1766), 3 states have internal predecessors, (1766), 0 states have call successors, (0), 0 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:32:41,952 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:41,952 INFO L232 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 14, 14, 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:32:41,952 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-30 04:32:41,952 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:41,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1896622821, now seen corresponding path program 1 times [2023-11-30 04:32:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:41,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980521624] [2023-11-30 04:32:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:41,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:41,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:41,991 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:41,991 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:41,991 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:41,991 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:41,991 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-30 04:32:41,991 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:41,992 WARN L227 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:41,992 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2023-11-30 04:32:42,064 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:42,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 640 places, 745 transitions, 1760 flow [2023-11-30 04:32:42,338 INFO L124 PetriNetUnfolderBase]: 151/968 cut-off events. [2023-11-30 04:32:42,338 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2023-11-30 04:32:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 968 events. 151/968 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3872 event pairs, 0 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1031. Up to 32 conditions per place. [2023-11-30 04:32:42,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 640 places, 745 transitions, 1760 flow [2023-11-30 04:32:42,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 640 places, 745 transitions, 1760 flow [2023-11-30 04:32:42,418 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:42,418 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:42,418 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:42,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:42,419 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:42,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:42,419 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:42,419 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:42,419 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:42,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash -546160161, now seen corresponding path program 1 times [2023-11-30 04:32:42,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:42,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086268400] [2023-11-30 04:32:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:42,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:42,441 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:32:42,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:42,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086268400] [2023-11-30 04:32:42,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086268400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:42,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:42,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253618582] [2023-11-30 04:32:42,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:42,442 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:42,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:42,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:42,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:42,443 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 745 [2023-11-30 04:32:42,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 745 transitions, 1760 flow. Second operand has 3 states, 3 states have (on average 629.0) internal successors, (1887), 3 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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:32:42,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:42,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 745 [2023-11-30 04:32:42,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:42,775 INFO L124 PetriNetUnfolderBase]: 60/720 cut-off events. [2023-11-30 04:32:42,775 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2023-11-30 04:32:42,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 720 events. 60/720 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2765 event pairs, 0 based on Foata normal form. 1391/2020 useless extension candidates. Maximal degree in co-relation 843. Up to 48 conditions per place. [2023-11-30 04:32:42,838 INFO L140 encePairwiseOnDemand]: 666/745 looper letters, 21 selfloop transitions, 1 changer transitions 0/617 dead transitions. [2023-11-30 04:32:42,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 617 transitions, 1548 flow [2023-11-30 04:32:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions. [2023-11-30 04:32:42,841 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8863534675615212 [2023-11-30 04:32:42,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1981 transitions. [2023-11-30 04:32:42,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1981 transitions. [2023-11-30 04:32:42,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:42,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1981 transitions. [2023-11-30 04:32:42,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 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:32:42,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 745.0) internal successors, (2980), 4 states have internal predecessors, (2980), 0 states have call successors, (0), 0 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:32:42,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 745.0) internal successors, (2980), 4 states have internal predecessors, (2980), 0 states have call successors, (0), 0 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:32:42,847 INFO L307 CegarLoopForPetriNet]: 640 programPoint places, -50 predicate places. [2023-11-30 04:32:42,847 INFO L500 AbstractCegarLoop]: Abstraction has has 590 places, 617 transitions, 1548 flow [2023-11-30 04:32:42,848 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 629.0) internal successors, (1887), 3 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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:32:42,848 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:42,848 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:42,848 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-30 04:32:42,848 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:42,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash -546160160, now seen corresponding path program 1 times [2023-11-30 04:32:42,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:42,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982828182] [2023-11-30 04:32:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:42,871 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:32:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982828182] [2023-11-30 04:32:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982828182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:42,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:42,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641995058] [2023-11-30 04:32:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:42,872 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:42,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:42,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:42,874 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 745 [2023-11-30 04:32:42,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 617 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 0 states have call successors, (0), 0 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:32:42,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:42,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 745 [2023-11-30 04:32:42,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:43,121 INFO L124 PetriNetUnfolderBase]: 60/704 cut-off events. [2023-11-30 04:32:43,121 INFO L125 PetriNetUnfolderBase]: For 684/684 co-relation queries the response was YES. [2023-11-30 04:32:43,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 704 events. 60/704 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2669 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 843. Up to 32 conditions per place. [2023-11-30 04:32:43,142 INFO L140 encePairwiseOnDemand]: 743/745 looper letters, 19 selfloop transitions, 1 changer transitions 0/616 dead transitions. [2023-11-30 04:32:43,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 616 transitions, 1584 flow [2023-11-30 04:32:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1905 transitions. [2023-11-30 04:32:43,145 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8523489932885906 [2023-11-30 04:32:43,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1905 transitions. [2023-11-30 04:32:43,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1905 transitions. [2023-11-30 04:32:43,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:43,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1905 transitions. [2023-11-30 04:32:43,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.0) internal successors, (1905), 3 states have internal predecessors, (1905), 0 states have call successors, (0), 0 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:32:43,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 745.0) internal successors, (2980), 4 states have internal predecessors, (2980), 0 states have call successors, (0), 0 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:32:43,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 745.0) internal successors, (2980), 4 states have internal predecessors, (2980), 0 states have call successors, (0), 0 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:32:43,151 INFO L307 CegarLoopForPetriNet]: 640 programPoint places, -49 predicate places. [2023-11-30 04:32:43,151 INFO L500 AbstractCegarLoop]: Abstraction has has 591 places, 616 transitions, 1584 flow [2023-11-30 04:32:43,151 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 0 states have call successors, (0), 0 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:32:43,151 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:43,151 INFO L232 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 15, 15, 1, 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:32:43,151 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-30 04:32:43,151 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:43,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1248151412, now seen corresponding path program 1 times [2023-11-30 04:32:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108287219] [2023-11-30 04:32:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:43,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:43,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:43,191 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:43,191 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:43,191 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:43,191 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:43,191 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-30 04:32:43,191 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:43,192 WARN L227 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:43,192 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2023-11-30 04:32:43,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:43,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 681 places, 793 transitions, 1890 flow [2023-11-30 04:32:43,529 INFO L124 PetriNetUnfolderBase]: 161/1031 cut-off events. [2023-11-30 04:32:43,529 INFO L125 PetriNetUnfolderBase]: For 800/800 co-relation queries the response was YES. [2023-11-30 04:32:43,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1031 events. 161/1031 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4127 event pairs, 0 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1111. Up to 34 conditions per place. [2023-11-30 04:32:43,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 681 places, 793 transitions, 1890 flow [2023-11-30 04:32:43,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 681 places, 793 transitions, 1890 flow [2023-11-30 04:32:43,620 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:43,620 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:43,620 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:43,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:43,621 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:43,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:43,621 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:43,621 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:43,621 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:43,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash -595361224, now seen corresponding path program 1 times [2023-11-30 04:32:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:43,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512355483] [2023-11-30 04:32:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:43,637 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:32:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:43,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512355483] [2023-11-30 04:32:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512355483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:43,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:43,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747580901] [2023-11-30 04:32:43,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:43,638 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:43,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:43,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:43,640 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 793 [2023-11-30 04:32:43,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 793 transitions, 1890 flow. Second operand has 3 states, 3 states have (on average 670.0) internal successors, (2010), 3 states have internal predecessors, (2010), 0 states have call successors, (0), 0 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:32:43,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:43,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 793 [2023-11-30 04:32:43,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:43,865 INFO L124 PetriNetUnfolderBase]: 64/767 cut-off events. [2023-11-30 04:32:43,865 INFO L125 PetriNetUnfolderBase]: For 800/800 co-relation queries the response was YES. [2023-11-30 04:32:43,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 767 events. 64/767 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2969 event pairs, 0 based on Foata normal form. 1602/2272 useless extension candidates. Maximal degree in co-relation 910. Up to 51 conditions per place. [2023-11-30 04:32:43,914 INFO L140 encePairwiseOnDemand]: 709/793 looper letters, 22 selfloop transitions, 1 changer transitions 0/657 dead transitions. [2023-11-30 04:32:43,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 657 transitions, 1664 flow [2023-11-30 04:32:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2110 transitions. [2023-11-30 04:32:43,918 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8869272803699033 [2023-11-30 04:32:43,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2110 transitions. [2023-11-30 04:32:43,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2110 transitions. [2023-11-30 04:32:43,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:43,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2110 transitions. [2023-11-30 04:32:43,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 703.3333333333334) internal successors, (2110), 3 states have internal predecessors, (2110), 0 states have call successors, (0), 0 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:32:43,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 793.0) internal successors, (3172), 4 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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:32:43,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 793.0) internal successors, (3172), 4 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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:32:43,923 INFO L307 CegarLoopForPetriNet]: 681 programPoint places, -53 predicate places. [2023-11-30 04:32:43,923 INFO L500 AbstractCegarLoop]: Abstraction has has 628 places, 657 transitions, 1664 flow [2023-11-30 04:32:43,923 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 670.0) internal successors, (2010), 3 states have internal predecessors, (2010), 0 states have call successors, (0), 0 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:32:43,923 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:43,923 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:43,923 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-30 04:32:43,923 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:43,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash -595361223, now seen corresponding path program 1 times [2023-11-30 04:32:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:43,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684413187] [2023-11-30 04:32:43,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:43,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:43,950 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:32:43,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:43,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684413187] [2023-11-30 04:32:43,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684413187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:43,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:43,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:43,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413877694] [2023-11-30 04:32:43,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:43,950 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:43,952 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 669 out of 793 [2023-11-30 04:32:43,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 657 transitions, 1664 flow. Second operand has 3 states, 3 states have (on average 670.6666666666666) internal successors, (2012), 3 states have internal predecessors, (2012), 0 states have call successors, (0), 0 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:32:43,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:43,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 669 of 793 [2023-11-30 04:32:43,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:44,254 INFO L124 PetriNetUnfolderBase]: 64/750 cut-off events. [2023-11-30 04:32:44,254 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2023-11-30 04:32:44,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 750 events. 64/750 cut-off events. For 820/820 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2840 event pairs, 0 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 909. Up to 34 conditions per place. [2023-11-30 04:32:44,288 INFO L140 encePairwiseOnDemand]: 791/793 looper letters, 20 selfloop transitions, 1 changer transitions 0/656 dead transitions. [2023-11-30 04:32:44,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 656 transitions, 1702 flow [2023-11-30 04:32:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2023-11-30 04:32:44,291 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8528793610760824 [2023-11-30 04:32:44,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2029 transitions. [2023-11-30 04:32:44,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2029 transitions. [2023-11-30 04:32:44,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:44,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2029 transitions. [2023-11-30 04:32:44,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 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:32:44,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 793.0) internal successors, (3172), 4 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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:32:44,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 793.0) internal successors, (3172), 4 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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:32:44,296 INFO L307 CegarLoopForPetriNet]: 681 programPoint places, -52 predicate places. [2023-11-30 04:32:44,296 INFO L500 AbstractCegarLoop]: Abstraction has has 629 places, 656 transitions, 1702 flow [2023-11-30 04:32:44,296 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 670.6666666666666) internal successors, (2012), 3 states have internal predecessors, (2012), 0 states have call successors, (0), 0 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:32:44,296 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:44,297 INFO L232 CegarLoopForPetriNet]: trace histogram [17, 17, 17, 17, 16, 16, 1, 1, 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:32:44,297 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-30 04:32:44,297 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:44,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:44,297 INFO L85 PathProgramCache]: Analyzing trace with hash -857283048, now seen corresponding path program 1 times [2023-11-30 04:32:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221257670] [2023-11-30 04:32:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:44,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:44,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:44,339 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:44,339 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:44,339 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:44,339 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:44,339 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-30 04:32:44,339 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:44,340 WARN L227 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:44,340 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2023-11-30 04:32:44,423 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:44,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 722 places, 841 transitions, 2022 flow [2023-11-30 04:32:44,724 INFO L124 PetriNetUnfolderBase]: 171/1094 cut-off events. [2023-11-30 04:32:44,724 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2023-11-30 04:32:44,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 1094 events. 171/1094 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4409 event pairs, 0 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1192. Up to 36 conditions per place. [2023-11-30 04:32:44,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 722 places, 841 transitions, 2022 flow [2023-11-30 04:32:44,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 722 places, 841 transitions, 2022 flow [2023-11-30 04:32:44,828 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:44,828 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:44,828 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:44,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:44,829 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:44,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:44,829 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:44,829 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:44,829 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:44,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1123524289, now seen corresponding path program 1 times [2023-11-30 04:32:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:44,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115309592] [2023-11-30 04:32:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:44,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:44,861 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:32:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115309592] [2023-11-30 04:32:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115309592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:44,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:44,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:44,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112379486] [2023-11-30 04:32:44,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:44,861 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:44,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:44,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:44,863 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 841 [2023-11-30 04:32:44,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 841 transitions, 2022 flow. Second operand has 3 states, 3 states have (on average 711.0) internal successors, (2133), 3 states have internal predecessors, (2133), 0 states have call successors, (0), 0 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:32:44,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:44,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 841 [2023-11-30 04:32:44,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:45,099 INFO L124 PetriNetUnfolderBase]: 68/814 cut-off events. [2023-11-30 04:32:45,099 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2023-11-30 04:32:45,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 814 events. 68/814 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3145 event pairs, 0 based on Foata normal form. 1828/2539 useless extension candidates. Maximal degree in co-relation 978. Up to 54 conditions per place. [2023-11-30 04:32:45,149 INFO L140 encePairwiseOnDemand]: 752/841 looper letters, 23 selfloop transitions, 1 changer transitions 0/697 dead transitions. [2023-11-30 04:32:45,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 697 transitions, 1782 flow [2023-11-30 04:32:45,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2023-11-30 04:32:45,153 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8874355925485533 [2023-11-30 04:32:45,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2239 transitions. [2023-11-30 04:32:45,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2239 transitions. [2023-11-30 04:32:45,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:45,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2239 transitions. [2023-11-30 04:32:45,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 746.3333333333334) internal successors, (2239), 3 states have internal predecessors, (2239), 0 states have call successors, (0), 0 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:32:45,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 841.0) internal successors, (3364), 4 states have internal predecessors, (3364), 0 states have call successors, (0), 0 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:32:45,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 841.0) internal successors, (3364), 4 states have internal predecessors, (3364), 0 states have call successors, (0), 0 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:32:45,158 INFO L307 CegarLoopForPetriNet]: 722 programPoint places, -56 predicate places. [2023-11-30 04:32:45,158 INFO L500 AbstractCegarLoop]: Abstraction has has 666 places, 697 transitions, 1782 flow [2023-11-30 04:32:45,159 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 711.0) internal successors, (2133), 3 states have internal predecessors, (2133), 0 states have call successors, (0), 0 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:32:45,159 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:45,159 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:45,159 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-30 04:32:45,159 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:45,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1123524290, now seen corresponding path program 1 times [2023-11-30 04:32:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:45,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870308667] [2023-11-30 04:32:45,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:32:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:45,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870308667] [2023-11-30 04:32:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870308667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:45,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949918349] [2023-11-30 04:32:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:45,183 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:45,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:45,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:45,185 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 841 [2023-11-30 04:32:45,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 697 transitions, 1782 flow. Second operand has 3 states, 3 states have (on average 711.6666666666666) internal successors, (2135), 3 states have internal predecessors, (2135), 0 states have call successors, (0), 0 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:32:45,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:45,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 841 [2023-11-30 04:32:45,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:45,549 INFO L124 PetriNetUnfolderBase]: 68/796 cut-off events. [2023-11-30 04:32:45,549 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-11-30 04:32:45,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 796 events. 68/796 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3041 event pairs, 0 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 977. Up to 36 conditions per place. [2023-11-30 04:32:45,601 INFO L140 encePairwiseOnDemand]: 839/841 looper letters, 21 selfloop transitions, 1 changer transitions 0/696 dead transitions. [2023-11-30 04:32:45,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 696 transitions, 1822 flow [2023-11-30 04:32:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2023-11-30 04:32:45,604 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8533491874752279 [2023-11-30 04:32:45,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2023-11-30 04:32:45,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2023-11-30 04:32:45,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:45,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2023-11-30 04:32:45,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 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:32:45,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 841.0) internal successors, (3364), 4 states have internal predecessors, (3364), 0 states have call successors, (0), 0 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:32:45,609 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 841.0) internal successors, (3364), 4 states have internal predecessors, (3364), 0 states have call successors, (0), 0 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:32:45,609 INFO L307 CegarLoopForPetriNet]: 722 programPoint places, -55 predicate places. [2023-11-30 04:32:45,609 INFO L500 AbstractCegarLoop]: Abstraction has has 667 places, 696 transitions, 1822 flow [2023-11-30 04:32:45,610 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 711.6666666666666) internal successors, (2135), 3 states have internal predecessors, (2135), 0 states have call successors, (0), 0 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:32:45,610 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:45,610 INFO L232 CegarLoopForPetriNet]: trace histogram [18, 18, 18, 18, 17, 17, 1, 1, 1, 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:32:45,610 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-11-30 04:32:45,610 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:45,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1526291669, now seen corresponding path program 1 times [2023-11-30 04:32:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445994306] [2023-11-30 04:32:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:45,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:45,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:45,675 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:45,675 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:45,676 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:45,676 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:45,676 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-11-30 04:32:45,676 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:45,676 WARN L227 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:45,676 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2023-11-30 04:32:45,766 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:45,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 763 places, 889 transitions, 2156 flow [2023-11-30 04:32:46,179 INFO L124 PetriNetUnfolderBase]: 181/1157 cut-off events. [2023-11-30 04:32:46,180 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2023-11-30 04:32:46,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 1157 events. 181/1157 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4659 event pairs, 0 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1274. Up to 38 conditions per place. [2023-11-30 04:32:46,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 763 places, 889 transitions, 2156 flow [2023-11-30 04:32:46,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 763 places, 889 transitions, 2156 flow [2023-11-30 04:32:46,302 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:46,302 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:46,302 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:46,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:46,303 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:46,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:46,303 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:46,303 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:46,303 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:46,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash 315529082, now seen corresponding path program 1 times [2023-11-30 04:32:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986570912] [2023-11-30 04:32:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:32:46,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:46,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986570912] [2023-11-30 04:32:46,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986570912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:46,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:46,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350357537] [2023-11-30 04:32:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:46,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:46,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:46,328 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 889 [2023-11-30 04:32:46,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 889 transitions, 2156 flow. Second operand has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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:32:46,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:46,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 889 [2023-11-30 04:32:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:46,672 INFO L124 PetriNetUnfolderBase]: 72/861 cut-off events. [2023-11-30 04:32:46,672 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2023-11-30 04:32:46,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 861 events. 72/861 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3339 event pairs, 0 based on Foata normal form. 2069/2821 useless extension candidates. Maximal degree in co-relation 1047. Up to 57 conditions per place. [2023-11-30 04:32:46,731 INFO L140 encePairwiseOnDemand]: 795/889 looper letters, 24 selfloop transitions, 1 changer transitions 0/737 dead transitions. [2023-11-30 04:32:46,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 737 transitions, 1902 flow [2023-11-30 04:32:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2368 transitions. [2023-11-30 04:32:46,735 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8878890138732658 [2023-11-30 04:32:46,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2368 transitions. [2023-11-30 04:32:46,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2368 transitions. [2023-11-30 04:32:46,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:46,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2368 transitions. [2023-11-30 04:32:46,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 789.3333333333334) internal successors, (2368), 3 states have internal predecessors, (2368), 0 states have call successors, (0), 0 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:32:46,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:32:46,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:32:46,741 INFO L307 CegarLoopForPetriNet]: 763 programPoint places, -59 predicate places. [2023-11-30 04:32:46,741 INFO L500 AbstractCegarLoop]: Abstraction has has 704 places, 737 transitions, 1902 flow [2023-11-30 04:32:46,741 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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:32:46,741 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:46,741 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:46,741 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-11-30 04:32:46,741 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:46,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash 315529083, now seen corresponding path program 1 times [2023-11-30 04:32:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044586734] [2023-11-30 04:32:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:46,763 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:32:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044586734] [2023-11-30 04:32:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044586734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:46,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964890925] [2023-11-30 04:32:46,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:46,764 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:46,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:46,766 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 889 [2023-11-30 04:32:46,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 737 transitions, 1902 flow. Second operand has 3 states, 3 states have (on average 752.6666666666666) internal successors, (2258), 3 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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:32:46,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:46,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 889 [2023-11-30 04:32:46,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:47,043 INFO L124 PetriNetUnfolderBase]: 72/842 cut-off events. [2023-11-30 04:32:47,043 INFO L125 PetriNetUnfolderBase]: For 1144/1144 co-relation queries the response was YES. [2023-11-30 04:32:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 842 events. 72/842 cut-off events. For 1144/1144 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3228 event pairs, 0 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 1046. Up to 38 conditions per place. [2023-11-30 04:32:47,100 INFO L140 encePairwiseOnDemand]: 887/889 looper letters, 22 selfloop transitions, 1 changer transitions 0/736 dead transitions. [2023-11-30 04:32:47,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 736 transitions, 1944 flow [2023-11-30 04:32:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2023-11-30 04:32:47,106 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8537682789651294 [2023-11-30 04:32:47,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2277 transitions. [2023-11-30 04:32:47,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2277 transitions. [2023-11-30 04:32:47,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:47,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2277 transitions. [2023-11-30 04:32:47,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 759.0) internal successors, (2277), 3 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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:32:47,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:32:47,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:32:47,111 INFO L307 CegarLoopForPetriNet]: 763 programPoint places, -58 predicate places. [2023-11-30 04:32:47,111 INFO L500 AbstractCegarLoop]: Abstraction has has 705 places, 736 transitions, 1944 flow [2023-11-30 04:32:47,111 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.6666666666666) internal successors, (2258), 3 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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:32:47,112 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:47,112 INFO L232 CegarLoopForPetriNet]: trace histogram [19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 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:32:47,115 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-11-30 04:32:47,115 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:47,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash -641695211, now seen corresponding path program 1 times [2023-11-30 04:32:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237212462] [2023-11-30 04:32:47,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:47,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:47,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:47,225 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:47,226 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:47,226 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:47,226 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:47,226 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-11-30 04:32:47,226 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:47,226 WARN L227 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:47,226 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2023-11-30 04:32:47,331 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:47,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 804 places, 937 transitions, 2292 flow [2023-11-30 04:32:47,749 INFO L124 PetriNetUnfolderBase]: 191/1220 cut-off events. [2023-11-30 04:32:47,749 INFO L125 PetriNetUnfolderBase]: For 1311/1311 co-relation queries the response was YES. [2023-11-30 04:32:47,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1220 events. 191/1220 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4956 event pairs, 0 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1357. Up to 40 conditions per place. [2023-11-30 04:32:47,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 804 places, 937 transitions, 2292 flow [2023-11-30 04:32:47,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 804 places, 937 transitions, 2292 flow [2023-11-30 04:32:47,873 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:47,873 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:47,873 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:47,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:47,888 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:47,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:47,888 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:47,888 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:47,888 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:47,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1275620451, now seen corresponding path program 1 times [2023-11-30 04:32:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:47,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91715777] [2023-11-30 04:32:47,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:47,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:47,962 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:32:47,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91715777] [2023-11-30 04:32:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91715777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:47,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790841435] [2023-11-30 04:32:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:47,963 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:47,965 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 791 out of 937 [2023-11-30 04:32:47,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 804 places, 937 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 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:32:47,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:47,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 791 of 937 [2023-11-30 04:32:47,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:48,332 INFO L124 PetriNetUnfolderBase]: 76/908 cut-off events. [2023-11-30 04:32:48,332 INFO L125 PetriNetUnfolderBase]: For 1311/1311 co-relation queries the response was YES. [2023-11-30 04:32:48,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 908 events. 76/908 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3557 event pairs, 0 based on Foata normal form. 2325/3118 useless extension candidates. Maximal degree in co-relation 1117. Up to 60 conditions per place. [2023-11-30 04:32:48,405 INFO L140 encePairwiseOnDemand]: 838/937 looper letters, 25 selfloop transitions, 1 changer transitions 0/777 dead transitions. [2023-11-30 04:32:48,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 777 transitions, 2024 flow [2023-11-30 04:32:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2497 transitions. [2023-11-30 04:32:48,407 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8882959800782639 [2023-11-30 04:32:48,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2497 transitions. [2023-11-30 04:32:48,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2497 transitions. [2023-11-30 04:32:48,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:48,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2497 transitions. [2023-11-30 04:32:48,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 832.3333333333334) internal successors, (2497), 3 states have internal predecessors, (2497), 0 states have call successors, (0), 0 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:32:48,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 937.0) internal successors, (3748), 4 states have internal predecessors, (3748), 0 states have call successors, (0), 0 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:32:48,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 937.0) internal successors, (3748), 4 states have internal predecessors, (3748), 0 states have call successors, (0), 0 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:32:48,412 INFO L307 CegarLoopForPetriNet]: 804 programPoint places, -62 predicate places. [2023-11-30 04:32:48,412 INFO L500 AbstractCegarLoop]: Abstraction has has 742 places, 777 transitions, 2024 flow [2023-11-30 04:32:48,412 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 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:32:48,412 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:48,412 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:48,413 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-11-30 04:32:48,413 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:48,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1275620452, now seen corresponding path program 1 times [2023-11-30 04:32:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:48,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150494483] [2023-11-30 04:32:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:48,438 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:32:48,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:48,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150494483] [2023-11-30 04:32:48,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150494483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:48,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:48,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:48,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51723752] [2023-11-30 04:32:48,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:48,439 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:48,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:48,441 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 792 out of 937 [2023-11-30 04:32:48,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 777 transitions, 2024 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 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:32:48,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:48,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 792 of 937 [2023-11-30 04:32:48,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:48,710 INFO L124 PetriNetUnfolderBase]: 76/888 cut-off events. [2023-11-30 04:32:48,711 INFO L125 PetriNetUnfolderBase]: For 1334/1334 co-relation queries the response was YES. [2023-11-30 04:32:48,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 888 events. 76/888 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3419 event pairs, 0 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1116. Up to 40 conditions per place. [2023-11-30 04:32:48,773 INFO L140 encePairwiseOnDemand]: 935/937 looper letters, 23 selfloop transitions, 1 changer transitions 0/776 dead transitions. [2023-11-30 04:32:48,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 776 transitions, 2068 flow [2023-11-30 04:32:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2401 transitions. [2023-11-30 04:32:48,775 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8541444325862683 [2023-11-30 04:32:48,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2401 transitions. [2023-11-30 04:32:48,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2401 transitions. [2023-11-30 04:32:48,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:48,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2401 transitions. [2023-11-30 04:32:48,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 800.3333333333334) internal successors, (2401), 3 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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:32:48,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 937.0) internal successors, (3748), 4 states have internal predecessors, (3748), 0 states have call successors, (0), 0 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:32:48,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 937.0) internal successors, (3748), 4 states have internal predecessors, (3748), 0 states have call successors, (0), 0 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:32:48,781 INFO L307 CegarLoopForPetriNet]: 804 programPoint places, -61 predicate places. [2023-11-30 04:32:48,781 INFO L500 AbstractCegarLoop]: Abstraction has has 743 places, 776 transitions, 2068 flow [2023-11-30 04:32:48,781 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 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:32:48,781 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:48,781 INFO L232 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 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:32:48,781 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-11-30 04:32:48,781 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:48,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1031706634, now seen corresponding path program 1 times [2023-11-30 04:32:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:48,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131750845] [2023-11-30 04:32:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:48,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:48,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:48,829 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:48,829 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:48,829 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:48,829 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:48,829 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-11-30 04:32:48,829 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:48,830 WARN L227 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:48,830 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2023-11-30 04:32:48,905 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:48,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 845 places, 985 transitions, 2430 flow [2023-11-30 04:32:49,398 INFO L124 PetriNetUnfolderBase]: 201/1283 cut-off events. [2023-11-30 04:32:49,399 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2023-11-30 04:32:49,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 1283 events. 201/1283 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5204 event pairs, 0 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 1441. Up to 42 conditions per place. [2023-11-30 04:32:49,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 845 places, 985 transitions, 2430 flow [2023-11-30 04:32:49,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 845 places, 985 transitions, 2430 flow [2023-11-30 04:32:49,477 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:49,478 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:49,478 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:49,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:49,479 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:49,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:49,479 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:49,479 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:49,479 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:49,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash -291168900, now seen corresponding path program 1 times [2023-11-30 04:32:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:49,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475801061] [2023-11-30 04:32:49,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:49,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:49,504 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:32:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475801061] [2023-11-30 04:32:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475801061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:49,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:49,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296160870] [2023-11-30 04:32:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:49,504 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:49,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:49,506 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 832 out of 985 [2023-11-30 04:32:49,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 985 transitions, 2430 flow. Second operand has 3 states, 3 states have (on average 834.0) internal successors, (2502), 3 states have internal predecessors, (2502), 0 states have call successors, (0), 0 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:32:49,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:49,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 832 of 985 [2023-11-30 04:32:49,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:49,886 INFO L124 PetriNetUnfolderBase]: 80/955 cut-off events. [2023-11-30 04:32:49,886 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2023-11-30 04:32:49,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 955 events. 80/955 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3765 event pairs, 0 based on Foata normal form. 2596/3430 useless extension candidates. Maximal degree in co-relation 1188. Up to 63 conditions per place. [2023-11-30 04:32:49,966 INFO L140 encePairwiseOnDemand]: 881/985 looper letters, 26 selfloop transitions, 1 changer transitions 0/817 dead transitions. [2023-11-30 04:32:49,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 817 transitions, 2148 flow [2023-11-30 04:32:49,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2626 transitions. [2023-11-30 04:32:49,968 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.888663282571912 [2023-11-30 04:32:49,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2626 transitions. [2023-11-30 04:32:49,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2626 transitions. [2023-11-30 04:32:49,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:49,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2626 transitions. [2023-11-30 04:32:49,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 875.3333333333334) internal successors, (2626), 3 states have internal predecessors, (2626), 0 states have call successors, (0), 0 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:32:49,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 985.0) internal successors, (3940), 4 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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:32:49,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 985.0) internal successors, (3940), 4 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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:32:49,973 INFO L307 CegarLoopForPetriNet]: 845 programPoint places, -65 predicate places. [2023-11-30 04:32:49,973 INFO L500 AbstractCegarLoop]: Abstraction has has 780 places, 817 transitions, 2148 flow [2023-11-30 04:32:49,973 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 834.0) internal successors, (2502), 3 states have internal predecessors, (2502), 0 states have call successors, (0), 0 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:32:49,973 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:49,973 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:49,973 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-11-30 04:32:49,973 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:49,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:49,973 INFO L85 PathProgramCache]: Analyzing trace with hash -291168899, now seen corresponding path program 1 times [2023-11-30 04:32:49,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:49,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250075999] [2023-11-30 04:32:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:49,996 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:32:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250075999] [2023-11-30 04:32:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250075999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:49,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:49,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:49,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434924664] [2023-11-30 04:32:49,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:49,996 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:49,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:49,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:49,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:49,998 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 833 out of 985 [2023-11-30 04:32:49,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 817 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 834.6666666666666) internal successors, (2504), 3 states have internal predecessors, (2504), 0 states have call successors, (0), 0 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:32:49,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:49,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 833 of 985 [2023-11-30 04:32:49,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:50,384 INFO L124 PetriNetUnfolderBase]: 80/934 cut-off events. [2023-11-30 04:32:50,385 INFO L125 PetriNetUnfolderBase]: For 1544/1544 co-relation queries the response was YES. [2023-11-30 04:32:50,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 934 events. 80/934 cut-off events. For 1544/1544 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3609 event pairs, 0 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 1187. Up to 42 conditions per place. [2023-11-30 04:32:50,455 INFO L140 encePairwiseOnDemand]: 983/985 looper letters, 24 selfloop transitions, 1 changer transitions 0/816 dead transitions. [2023-11-30 04:32:50,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 816 transitions, 2194 flow [2023-11-30 04:32:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2525 transitions. [2023-11-30 04:32:50,457 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8544839255499154 [2023-11-30 04:32:50,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2525 transitions. [2023-11-30 04:32:50,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2525 transitions. [2023-11-30 04:32:50,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:50,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2525 transitions. [2023-11-30 04:32:50,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 841.6666666666666) internal successors, (2525), 3 states have internal predecessors, (2525), 0 states have call successors, (0), 0 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:32:50,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 985.0) internal successors, (3940), 4 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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:32:50,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 985.0) internal successors, (3940), 4 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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:32:50,490 INFO L307 CegarLoopForPetriNet]: 845 programPoint places, -64 predicate places. [2023-11-30 04:32:50,490 INFO L500 AbstractCegarLoop]: Abstraction has has 781 places, 816 transitions, 2194 flow [2023-11-30 04:32:50,490 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 834.6666666666666) internal successors, (2504), 3 states have internal predecessors, (2504), 0 states have call successors, (0), 0 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:32:50,490 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:50,490 INFO L232 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 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:32:50,490 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-11-30 04:32:50,490 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:50,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash -750501614, now seen corresponding path program 1 times [2023-11-30 04:32:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376936469] [2023-11-30 04:32:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:50,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:50,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:50,541 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:50,541 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:50,541 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:50,541 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:50,541 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-11-30 04:32:50,541 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:50,542 WARN L227 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:50,542 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2023-11-30 04:32:50,619 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:50,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 886 places, 1033 transitions, 2570 flow [2023-11-30 04:32:51,138 INFO L124 PetriNetUnfolderBase]: 211/1346 cut-off events. [2023-11-30 04:32:51,139 INFO L125 PetriNetUnfolderBase]: For 1750/1750 co-relation queries the response was YES. [2023-11-30 04:32:51,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 1346 events. 211/1346 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5470 event pairs, 0 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 1526. Up to 44 conditions per place. [2023-11-30 04:32:51,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 886 places, 1033 transitions, 2570 flow [2023-11-30 04:32:51,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 886 places, 1033 transitions, 2570 flow [2023-11-30 04:32:51,213 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:51,213 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:51,213 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:51,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:51,214 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:51,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:51,214 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:51,214 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:51,214 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:51,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -89871675, now seen corresponding path program 1 times [2023-11-30 04:32:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775737527] [2023-11-30 04:32:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:51,231 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:32:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775737527] [2023-11-30 04:32:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775737527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424734970] [2023-11-30 04:32:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:51,232 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:51,233 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 873 out of 1033 [2023-11-30 04:32:51,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 1033 transitions, 2570 flow. Second operand has 3 states, 3 states have (on average 875.0) internal successors, (2625), 3 states have internal predecessors, (2625), 0 states have call successors, (0), 0 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:32:51,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:51,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 873 of 1033 [2023-11-30 04:32:51,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:51,673 INFO L124 PetriNetUnfolderBase]: 84/1002 cut-off events. [2023-11-30 04:32:51,673 INFO L125 PetriNetUnfolderBase]: For 1750/1750 co-relation queries the response was YES. [2023-11-30 04:32:51,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1002 events. 84/1002 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3964 event pairs, 0 based on Foata normal form. 2882/3757 useless extension candidates. Maximal degree in co-relation 1260. Up to 66 conditions per place. [2023-11-30 04:32:51,764 INFO L140 encePairwiseOnDemand]: 924/1033 looper letters, 27 selfloop transitions, 1 changer transitions 0/857 dead transitions. [2023-11-30 04:32:51,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 818 places, 857 transitions, 2274 flow [2023-11-30 04:32:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2755 transitions. [2023-11-30 04:32:51,767 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8889964504678929 [2023-11-30 04:32:51,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2755 transitions. [2023-11-30 04:32:51,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2755 transitions. [2023-11-30 04:32:51,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:51,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2755 transitions. [2023-11-30 04:32:51,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 918.3333333333334) internal successors, (2755), 3 states have internal predecessors, (2755), 0 states have call successors, (0), 0 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:32:51,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1033.0) internal successors, (4132), 4 states have internal predecessors, (4132), 0 states have call successors, (0), 0 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:32:51,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1033.0) internal successors, (4132), 4 states have internal predecessors, (4132), 0 states have call successors, (0), 0 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:32:51,771 INFO L307 CegarLoopForPetriNet]: 886 programPoint places, -68 predicate places. [2023-11-30 04:32:51,771 INFO L500 AbstractCegarLoop]: Abstraction has has 818 places, 857 transitions, 2274 flow [2023-11-30 04:32:51,771 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 875.0) internal successors, (2625), 3 states have internal predecessors, (2625), 0 states have call successors, (0), 0 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:32:51,771 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:51,771 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:51,771 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-11-30 04:32:51,772 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:51,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash -89871674, now seen corresponding path program 1 times [2023-11-30 04:32:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:51,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553264978] [2023-11-30 04:32:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:51,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:51,794 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:32:51,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553264978] [2023-11-30 04:32:51,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553264978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:51,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:51,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:51,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907832752] [2023-11-30 04:32:51,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:51,795 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:51,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:51,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:51,797 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 874 out of 1033 [2023-11-30 04:32:51,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 818 places, 857 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 875.6666666666666) internal successors, (2627), 3 states have internal predecessors, (2627), 0 states have call successors, (0), 0 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:32:51,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:51,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 874 of 1033 [2023-11-30 04:32:51,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:52,185 INFO L124 PetriNetUnfolderBase]: 84/980 cut-off events. [2023-11-30 04:32:52,186 INFO L125 PetriNetUnfolderBase]: For 1775/1775 co-relation queries the response was YES. [2023-11-30 04:32:52,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 980 events. 84/980 cut-off events. For 1775/1775 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3793 event pairs, 0 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1259. Up to 44 conditions per place. [2023-11-30 04:32:52,273 INFO L140 encePairwiseOnDemand]: 1031/1033 looper letters, 25 selfloop transitions, 1 changer transitions 0/856 dead transitions. [2023-11-30 04:32:52,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 856 transitions, 2322 flow [2023-11-30 04:32:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2649 transitions. [2023-11-30 04:32:52,275 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8547918683446273 [2023-11-30 04:32:52,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2649 transitions. [2023-11-30 04:32:52,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2649 transitions. [2023-11-30 04:32:52,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:52,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2649 transitions. [2023-11-30 04:32:52,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 883.0) internal successors, (2649), 3 states have internal predecessors, (2649), 0 states have call successors, (0), 0 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:32:52,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1033.0) internal successors, (4132), 4 states have internal predecessors, (4132), 0 states have call successors, (0), 0 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:32:52,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1033.0) internal successors, (4132), 4 states have internal predecessors, (4132), 0 states have call successors, (0), 0 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:32:52,279 INFO L307 CegarLoopForPetriNet]: 886 programPoint places, -67 predicate places. [2023-11-30 04:32:52,279 INFO L500 AbstractCegarLoop]: Abstraction has has 819 places, 856 transitions, 2322 flow [2023-11-30 04:32:52,279 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 875.6666666666666) internal successors, (2627), 3 states have internal predecessors, (2627), 0 states have call successors, (0), 0 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:32:52,279 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:52,280 INFO L232 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 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:32:52,280 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-11-30 04:32:52,280 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:52,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:52,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1989923031, now seen corresponding path program 1 times [2023-11-30 04:32:52,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:52,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401034345] [2023-11-30 04:32:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:52,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:52,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:52,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:52,333 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:52,333 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:52,334 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:52,334 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:52,334 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2023-11-30 04:32:52,334 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:52,334 WARN L227 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:52,334 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2023-11-30 04:32:52,416 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:52,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 927 places, 1081 transitions, 2712 flow [2023-11-30 04:32:52,999 INFO L124 PetriNetUnfolderBase]: 221/1409 cut-off events. [2023-11-30 04:32:52,999 INFO L125 PetriNetUnfolderBase]: For 2002/2002 co-relation queries the response was YES. [2023-11-30 04:32:53,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 1409 events. 221/1409 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5753 event pairs, 0 based on Foata normal form. 0/1119 useless extension candidates. Maximal degree in co-relation 1612. Up to 46 conditions per place. [2023-11-30 04:32:53,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 927 places, 1081 transitions, 2712 flow [2023-11-30 04:32:53,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 927 places, 1081 transitions, 2712 flow [2023-11-30 04:32:53,101 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:53,102 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:53,102 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:53,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:53,104 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:53,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:53,104 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:53,104 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:53,105 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:53,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1879512126, now seen corresponding path program 1 times [2023-11-30 04:32:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:53,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669084279] [2023-11-30 04:32:53,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:53,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:53,157 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:32:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669084279] [2023-11-30 04:32:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669084279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:53,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:53,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764127711] [2023-11-30 04:32:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:53,158 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:53,162 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 914 out of 1081 [2023-11-30 04:32:53,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 1081 transitions, 2712 flow. Second operand has 3 states, 3 states have (on average 916.0) internal successors, (2748), 3 states have internal predecessors, (2748), 0 states have call successors, (0), 0 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:32:53,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:53,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 914 of 1081 [2023-11-30 04:32:53,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:53,705 INFO L124 PetriNetUnfolderBase]: 88/1049 cut-off events. [2023-11-30 04:32:53,705 INFO L125 PetriNetUnfolderBase]: For 2002/2002 co-relation queries the response was YES. [2023-11-30 04:32:53,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 1049 events. 88/1049 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4160 event pairs, 0 based on Foata normal form. 3183/4099 useless extension candidates. Maximal degree in co-relation 1333. Up to 69 conditions per place. [2023-11-30 04:32:53,800 INFO L140 encePairwiseOnDemand]: 967/1081 looper letters, 28 selfloop transitions, 1 changer transitions 0/897 dead transitions. [2023-11-30 04:32:53,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 856 places, 897 transitions, 2402 flow [2023-11-30 04:32:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2884 transitions. [2023-11-30 04:32:53,803 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.889300030835646 [2023-11-30 04:32:53,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2884 transitions. [2023-11-30 04:32:53,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2884 transitions. [2023-11-30 04:32:53,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:53,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2884 transitions. [2023-11-30 04:32:53,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 961.3333333333334) internal successors, (2884), 3 states have internal predecessors, (2884), 0 states have call successors, (0), 0 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:32:53,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1081.0) internal successors, (4324), 4 states have internal predecessors, (4324), 0 states have call successors, (0), 0 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:32:53,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1081.0) internal successors, (4324), 4 states have internal predecessors, (4324), 0 states have call successors, (0), 0 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:32:53,812 INFO L307 CegarLoopForPetriNet]: 927 programPoint places, -71 predicate places. [2023-11-30 04:32:53,812 INFO L500 AbstractCegarLoop]: Abstraction has has 856 places, 897 transitions, 2402 flow [2023-11-30 04:32:53,812 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 916.0) internal successors, (2748), 3 states have internal predecessors, (2748), 0 states have call successors, (0), 0 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:32:53,813 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:53,813 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:53,813 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2023-11-30 04:32:53,813 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:53,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1879512127, now seen corresponding path program 1 times [2023-11-30 04:32:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504142934] [2023-11-30 04:32:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:53,842 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:32:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504142934] [2023-11-30 04:32:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504142934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:53,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:53,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:53,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052831834] [2023-11-30 04:32:53,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:53,843 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:53,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:53,845 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 915 out of 1081 [2023-11-30 04:32:53,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 897 transitions, 2402 flow. Second operand has 3 states, 3 states have (on average 916.6666666666666) internal successors, (2750), 3 states have internal predecessors, (2750), 0 states have call successors, (0), 0 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:32:53,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:53,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 915 of 1081 [2023-11-30 04:32:53,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:54,326 INFO L124 PetriNetUnfolderBase]: 88/1026 cut-off events. [2023-11-30 04:32:54,327 INFO L125 PetriNetUnfolderBase]: For 2028/2028 co-relation queries the response was YES. [2023-11-30 04:32:54,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1026 events. 88/1026 cut-off events. For 2028/2028 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3997 event pairs, 0 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 1332. Up to 46 conditions per place. [2023-11-30 04:32:54,418 INFO L140 encePairwiseOnDemand]: 1079/1081 looper letters, 26 selfloop transitions, 1 changer transitions 0/896 dead transitions. [2023-11-30 04:32:54,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 857 places, 896 transitions, 2452 flow [2023-11-30 04:32:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2773 transitions. [2023-11-30 04:32:54,421 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.855072463768116 [2023-11-30 04:32:54,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2773 transitions. [2023-11-30 04:32:54,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2773 transitions. [2023-11-30 04:32:54,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:54,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2773 transitions. [2023-11-30 04:32:54,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 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:32:54,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1081.0) internal successors, (4324), 4 states have internal predecessors, (4324), 0 states have call successors, (0), 0 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:32:54,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1081.0) internal successors, (4324), 4 states have internal predecessors, (4324), 0 states have call successors, (0), 0 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:32:54,447 INFO L307 CegarLoopForPetriNet]: 927 programPoint places, -70 predicate places. [2023-11-30 04:32:54,447 INFO L500 AbstractCegarLoop]: Abstraction has has 857 places, 896 transitions, 2452 flow [2023-11-30 04:32:54,447 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 916.6666666666666) internal successors, (2750), 3 states have internal predecessors, (2750), 0 states have call successors, (0), 0 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:32:54,447 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:54,447 INFO L232 CegarLoopForPetriNet]: trace histogram [23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:54,447 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2023-11-30 04:32:54,447 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:54,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash 540130063, now seen corresponding path program 1 times [2023-11-30 04:32:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026736693] [2023-11-30 04:32:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:54,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:54,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:54,522 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:54,523 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:54,523 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:54,523 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:54,523 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2023-11-30 04:32:54,523 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:54,523 WARN L227 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:54,523 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2023-11-30 04:32:54,640 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:54,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 968 places, 1129 transitions, 2856 flow [2023-11-30 04:32:55,394 INFO L124 PetriNetUnfolderBase]: 231/1472 cut-off events. [2023-11-30 04:32:55,394 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2023-11-30 04:32:55,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 1472 events. 231/1472 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6033 event pairs, 0 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1699. Up to 48 conditions per place. [2023-11-30 04:32:55,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 968 places, 1129 transitions, 2856 flow [2023-11-30 04:32:55,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 968 places, 1129 transitions, 2856 flow [2023-11-30 04:32:55,482 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:55,483 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:55,483 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:55,483 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:55,484 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:55,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:55,484 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:55,484 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:55,484 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:55,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1322015207, now seen corresponding path program 1 times [2023-11-30 04:32:55,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:55,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7702793] [2023-11-30 04:32:55,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:55,508 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:32:55,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:55,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7702793] [2023-11-30 04:32:55,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7702793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:55,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:55,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:55,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794509067] [2023-11-30 04:32:55,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:55,508 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:55,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:55,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:55,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:55,510 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 955 out of 1129 [2023-11-30 04:32:55,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 1129 transitions, 2856 flow. Second operand has 3 states, 3 states have (on average 957.0) internal successors, (2871), 3 states have internal predecessors, (2871), 0 states have call successors, (0), 0 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:32:55,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:55,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 955 of 1129 [2023-11-30 04:32:55,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:56,018 INFO L124 PetriNetUnfolderBase]: 92/1096 cut-off events. [2023-11-30 04:32:56,018 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2023-11-30 04:32:56,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1096 events. 92/1096 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4358 event pairs, 0 based on Foata normal form. 3499/4456 useless extension candidates. Maximal degree in co-relation 1407. Up to 72 conditions per place. [2023-11-30 04:32:56,128 INFO L140 encePairwiseOnDemand]: 1010/1129 looper letters, 29 selfloop transitions, 1 changer transitions 0/937 dead transitions. [2023-11-30 04:32:56,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 937 transitions, 2532 flow [2023-11-30 04:32:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3013 transitions. [2023-11-30 04:32:56,130 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8895777974608798 [2023-11-30 04:32:56,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3013 transitions. [2023-11-30 04:32:56,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3013 transitions. [2023-11-30 04:32:56,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:56,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3013 transitions. [2023-11-30 04:32:56,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 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:32:56,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1129.0) internal successors, (4516), 4 states have internal predecessors, (4516), 0 states have call successors, (0), 0 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:32:56,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1129.0) internal successors, (4516), 4 states have internal predecessors, (4516), 0 states have call successors, (0), 0 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:32:56,134 INFO L307 CegarLoopForPetriNet]: 968 programPoint places, -74 predicate places. [2023-11-30 04:32:56,134 INFO L500 AbstractCegarLoop]: Abstraction has has 894 places, 937 transitions, 2532 flow [2023-11-30 04:32:56,135 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 957.0) internal successors, (2871), 3 states have internal predecessors, (2871), 0 states have call successors, (0), 0 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:32:56,135 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:56,135 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:56,135 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2023-11-30 04:32:56,135 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:56,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1322015208, now seen corresponding path program 1 times [2023-11-30 04:32:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540595742] [2023-11-30 04:32:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:56,159 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:32:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540595742] [2023-11-30 04:32:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540595742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:56,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:56,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721448628] [2023-11-30 04:32:56,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:56,159 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:56,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:56,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:56,161 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 956 out of 1129 [2023-11-30 04:32:56,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 937 transitions, 2532 flow. Second operand has 3 states, 3 states have (on average 957.6666666666666) internal successors, (2873), 3 states have internal predecessors, (2873), 0 states have call successors, (0), 0 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:32:56,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:56,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 956 of 1129 [2023-11-30 04:32:56,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:56,628 INFO L124 PetriNetUnfolderBase]: 92/1072 cut-off events. [2023-11-30 04:32:56,628 INFO L125 PetriNetUnfolderBase]: For 2304/2304 co-relation queries the response was YES. [2023-11-30 04:32:56,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 1072 events. 92/1072 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4187 event pairs, 0 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 1406. Up to 48 conditions per place. [2023-11-30 04:32:56,735 INFO L140 encePairwiseOnDemand]: 1127/1129 looper letters, 27 selfloop transitions, 1 changer transitions 0/936 dead transitions. [2023-11-30 04:32:56,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 895 places, 936 transitions, 2584 flow [2023-11-30 04:32:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2897 transitions. [2023-11-30 04:32:56,737 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8553291998819014 [2023-11-30 04:32:56,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2897 transitions. [2023-11-30 04:32:56,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2897 transitions. [2023-11-30 04:32:56,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:56,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2897 transitions. [2023-11-30 04:32:56,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 965.6666666666666) internal successors, (2897), 3 states have internal predecessors, (2897), 0 states have call successors, (0), 0 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:32:56,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1129.0) internal successors, (4516), 4 states have internal predecessors, (4516), 0 states have call successors, (0), 0 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:32:56,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1129.0) internal successors, (4516), 4 states have internal predecessors, (4516), 0 states have call successors, (0), 0 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:32:56,741 INFO L307 CegarLoopForPetriNet]: 968 programPoint places, -73 predicate places. [2023-11-30 04:32:56,741 INFO L500 AbstractCegarLoop]: Abstraction has has 895 places, 936 transitions, 2584 flow [2023-11-30 04:32:56,741 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 957.6666666666666) internal successors, (2873), 3 states have internal predecessors, (2873), 0 states have call successors, (0), 0 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:32:56,741 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:56,741 INFO L232 CegarLoopForPetriNet]: trace histogram [24, 24, 24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:56,741 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2023-11-30 04:32:56,742 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:56,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1483407224, now seen corresponding path program 1 times [2023-11-30 04:32:56,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:56,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000025999] [2023-11-30 04:32:56,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:56,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:56,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:56,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:56,799 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:56,799 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:56,799 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:56,799 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:56,799 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2023-11-30 04:32:56,799 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:56,800 WARN L227 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:56,800 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2023-11-30 04:32:56,884 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:56,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1009 places, 1177 transitions, 3002 flow [2023-11-30 04:32:57,501 INFO L124 PetriNetUnfolderBase]: 241/1535 cut-off events. [2023-11-30 04:32:57,501 INFO L125 PetriNetUnfolderBase]: For 2576/2576 co-relation queries the response was YES. [2023-11-30 04:32:57,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 1535 events. 241/1535 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 6291 event pairs, 0 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1787. Up to 50 conditions per place. [2023-11-30 04:32:57,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 1009 places, 1177 transitions, 3002 flow [2023-11-30 04:32:57,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1009 places, 1177 transitions, 3002 flow [2023-11-30 04:32:57,719 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:32:57,719 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:32:57,719 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:32:57,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:32:57,720 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:32:57,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:32:57,720 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:57,720 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:57,720 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:57,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1762362432, now seen corresponding path program 1 times [2023-11-30 04:32:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215121741] [2023-11-30 04:32:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:57,741 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:32:57,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:57,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215121741] [2023-11-30 04:32:57,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215121741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:57,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:57,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:57,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862081690] [2023-11-30 04:32:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:57,742 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:57,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:57,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:57,744 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1177 [2023-11-30 04:32:57,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1177 transitions, 3002 flow. Second operand has 3 states, 3 states have (on average 998.0) internal successors, (2994), 3 states have internal predecessors, (2994), 0 states have call successors, (0), 0 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:32:57,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:57,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1177 [2023-11-30 04:32:57,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:58,389 INFO L124 PetriNetUnfolderBase]: 96/1143 cut-off events. [2023-11-30 04:32:58,389 INFO L125 PetriNetUnfolderBase]: For 2576/2576 co-relation queries the response was YES. [2023-11-30 04:32:58,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1143 events. 96/1143 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4552 event pairs, 0 based on Foata normal form. 3830/4828 useless extension candidates. Maximal degree in co-relation 1482. Up to 75 conditions per place. [2023-11-30 04:32:58,503 INFO L140 encePairwiseOnDemand]: 1053/1177 looper letters, 30 selfloop transitions, 1 changer transitions 0/977 dead transitions. [2023-11-30 04:32:58,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 977 transitions, 2664 flow [2023-11-30 04:32:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3142 transitions. [2023-11-30 04:32:58,507 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8898329085244973 [2023-11-30 04:32:58,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3142 transitions. [2023-11-30 04:32:58,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3142 transitions. [2023-11-30 04:32:58,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:58,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3142 transitions. [2023-11-30 04:32:58,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 0 states have call successors, (0), 0 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:32:58,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1177.0) internal successors, (4708), 4 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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:32:58,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1177.0) internal successors, (4708), 4 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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:32:58,511 INFO L307 CegarLoopForPetriNet]: 1009 programPoint places, -77 predicate places. [2023-11-30 04:32:58,511 INFO L500 AbstractCegarLoop]: Abstraction has has 932 places, 977 transitions, 2664 flow [2023-11-30 04:32:58,511 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 998.0) internal successors, (2994), 3 states have internal predecessors, (2994), 0 states have call successors, (0), 0 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:32:58,511 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:58,512 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:32:58,512 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2023-11-30 04:32:58,512 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:58,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1762362431, now seen corresponding path program 1 times [2023-11-30 04:32:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954419603] [2023-11-30 04:32:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:32:58,717 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:32:58,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:32:58,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954419603] [2023-11-30 04:32:58,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954419603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:32:58,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:32:58,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:32:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109779269] [2023-11-30 04:32:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:32:58,717 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:32:58,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:32:58,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:32:58,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:32:58,719 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 997 out of 1177 [2023-11-30 04:32:58,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 977 transitions, 2664 flow. Second operand has 3 states, 3 states have (on average 998.6666666666666) internal successors, (2996), 3 states have internal predecessors, (2996), 0 states have call successors, (0), 0 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:32:58,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:32:58,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 997 of 1177 [2023-11-30 04:32:58,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:32:59,199 INFO L124 PetriNetUnfolderBase]: 96/1118 cut-off events. [2023-11-30 04:32:59,199 INFO L125 PetriNetUnfolderBase]: For 2604/2604 co-relation queries the response was YES. [2023-11-30 04:32:59,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1118 events. 96/1118 cut-off events. For 2604/2604 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4377 event pairs, 0 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 1481. Up to 50 conditions per place. [2023-11-30 04:32:59,310 INFO L140 encePairwiseOnDemand]: 1175/1177 looper letters, 28 selfloop transitions, 1 changer transitions 0/976 dead transitions. [2023-11-30 04:32:59,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 976 transitions, 2718 flow [2023-11-30 04:32:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:32:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:32:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2023-11-30 04:32:59,312 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8555649957519117 [2023-11-30 04:32:59,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3021 transitions. [2023-11-30 04:32:59,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3021 transitions. [2023-11-30 04:32:59,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:32:59,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3021 transitions. [2023-11-30 04:32:59,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1007.0) internal successors, (3021), 3 states have internal predecessors, (3021), 0 states have call successors, (0), 0 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:32:59,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1177.0) internal successors, (4708), 4 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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:32:59,316 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1177.0) internal successors, (4708), 4 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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:32:59,316 INFO L307 CegarLoopForPetriNet]: 1009 programPoint places, -76 predicate places. [2023-11-30 04:32:59,317 INFO L500 AbstractCegarLoop]: Abstraction has has 933 places, 976 transitions, 2718 flow [2023-11-30 04:32:59,317 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 998.6666666666666) internal successors, (2996), 3 states have internal predecessors, (2996), 0 states have call successors, (0), 0 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:32:59,317 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:32:59,317 INFO L232 CegarLoopForPetriNet]: trace histogram [25, 25, 25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:59,317 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2023-11-30 04:32:59,317 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:32:59,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:32:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1598326796, now seen corresponding path program 1 times [2023-11-30 04:32:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:32:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885737998] [2023-11-30 04:32:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:32:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:32:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:59,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:32:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:32:59,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:32:59,386 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:32:59,386 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:32:59,386 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:32:59,386 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:32:59,386 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2023-11-30 04:32:59,387 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:32:59,387 WARN L227 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:32:59,387 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2023-11-30 04:32:59,467 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:32:59,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1050 places, 1225 transitions, 3150 flow [2023-11-30 04:33:00,086 INFO L124 PetriNetUnfolderBase]: 251/1598 cut-off events. [2023-11-30 04:33:00,087 INFO L125 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2023-11-30 04:33:00,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 1598 events. 251/1598 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6553 event pairs, 0 based on Foata normal form. 0/1269 useless extension candidates. Maximal degree in co-relation 1876. Up to 52 conditions per place. [2023-11-30 04:33:00,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 1050 places, 1225 transitions, 3150 flow [2023-11-30 04:33:00,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1050 places, 1225 transitions, 3150 flow [2023-11-30 04:33:00,324 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:00,324 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:00,324 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:00,326 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:00,326 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:00,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:00,326 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:00,326 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:00,326 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:00,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1216313801, now seen corresponding path program 1 times [2023-11-30 04:33:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741784636] [2023-11-30 04:33:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:00,356 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:33:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:00,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741784636] [2023-11-30 04:33:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741784636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:00,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:00,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:00,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667436016] [2023-11-30 04:33:00,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:00,357 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:00,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:00,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:00,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:00,359 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1037 out of 1225 [2023-11-30 04:33:00,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1050 places, 1225 transitions, 3150 flow. Second operand has 3 states, 3 states have (on average 1039.0) internal successors, (3117), 3 states have internal predecessors, (3117), 0 states have call successors, (0), 0 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:33:00,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:00,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1037 of 1225 [2023-11-30 04:33:00,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:00,969 INFO L124 PetriNetUnfolderBase]: 100/1190 cut-off events. [2023-11-30 04:33:00,970 INFO L125 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2023-11-30 04:33:01,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 1190 events. 100/1190 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4750 event pairs, 0 based on Foata normal form. 4176/5215 useless extension candidates. Maximal degree in co-relation 1558. Up to 78 conditions per place. [2023-11-30 04:33:01,110 INFO L140 encePairwiseOnDemand]: 1096/1225 looper letters, 31 selfloop transitions, 1 changer transitions 0/1017 dead transitions. [2023-11-30 04:33:01,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 1017 transitions, 2798 flow [2023-11-30 04:33:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3271 transitions. [2023-11-30 04:33:01,112 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8900680272108844 [2023-11-30 04:33:01,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3271 transitions. [2023-11-30 04:33:01,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3271 transitions. [2023-11-30 04:33:01,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:01,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3271 transitions. [2023-11-30 04:33:01,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1090.3333333333333) internal successors, (3271), 3 states have internal predecessors, (3271), 0 states have call successors, (0), 0 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:33:01,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1225.0) internal successors, (4900), 4 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:33:01,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1225.0) internal successors, (4900), 4 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:33:01,117 INFO L307 CegarLoopForPetriNet]: 1050 programPoint places, -80 predicate places. [2023-11-30 04:33:01,117 INFO L500 AbstractCegarLoop]: Abstraction has has 970 places, 1017 transitions, 2798 flow [2023-11-30 04:33:01,117 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1039.0) internal successors, (3117), 3 states have internal predecessors, (3117), 0 states have call successors, (0), 0 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:33:01,117 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:01,117 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:01,117 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2023-11-30 04:33:01,118 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:01,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1216313802, now seen corresponding path program 1 times [2023-11-30 04:33:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:01,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414942799] [2023-11-30 04:33:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:01,142 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:33:01,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:01,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414942799] [2023-11-30 04:33:01,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414942799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:01,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:01,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:01,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384967526] [2023-11-30 04:33:01,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:01,143 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:01,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:01,145 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1038 out of 1225 [2023-11-30 04:33:01,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 1017 transitions, 2798 flow. Second operand has 3 states, 3 states have (on average 1039.6666666666667) internal successors, (3119), 3 states have internal predecessors, (3119), 0 states have call successors, (0), 0 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:33:01,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:01,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1038 of 1225 [2023-11-30 04:33:01,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:01,902 INFO L124 PetriNetUnfolderBase]: 100/1164 cut-off events. [2023-11-30 04:33:01,902 INFO L125 PetriNetUnfolderBase]: For 2929/2929 co-relation queries the response was YES. [2023-11-30 04:33:01,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 1164 events. 100/1164 cut-off events. For 2929/2929 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4559 event pairs, 0 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1557. Up to 52 conditions per place. [2023-11-30 04:33:01,969 INFO L140 encePairwiseOnDemand]: 1223/1225 looper letters, 29 selfloop transitions, 1 changer transitions 0/1016 dead transitions. [2023-11-30 04:33:01,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 1016 transitions, 2854 flow [2023-11-30 04:33:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3145 transitions. [2023-11-30 04:33:01,971 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.85578231292517 [2023-11-30 04:33:01,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3145 transitions. [2023-11-30 04:33:01,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3145 transitions. [2023-11-30 04:33:01,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:01,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3145 transitions. [2023-11-30 04:33:01,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1048.3333333333333) internal successors, (3145), 3 states have internal predecessors, (3145), 0 states have call successors, (0), 0 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:33:01,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1225.0) internal successors, (4900), 4 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:33:01,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1225.0) internal successors, (4900), 4 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:33:01,977 INFO L307 CegarLoopForPetriNet]: 1050 programPoint places, -79 predicate places. [2023-11-30 04:33:01,977 INFO L500 AbstractCegarLoop]: Abstraction has has 971 places, 1016 transitions, 2854 flow [2023-11-30 04:33:01,977 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1039.6666666666667) internal successors, (3119), 3 states have internal predecessors, (3119), 0 states have call successors, (0), 0 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:33:01,977 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:01,977 INFO L232 CegarLoopForPetriNet]: trace histogram [26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:01,977 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2023-11-30 04:33:01,977 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:01,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1785373735, now seen corresponding path program 1 times [2023-11-30 04:33:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680815640] [2023-11-30 04:33:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:02,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:02,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:02,043 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:02,043 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:02,043 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:02,043 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:02,043 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2023-11-30 04:33:02,043 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:02,043 WARN L227 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:02,043 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2023-11-30 04:33:02,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:02,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1091 places, 1273 transitions, 3300 flow [2023-11-30 04:33:02,855 INFO L124 PetriNetUnfolderBase]: 261/1661 cut-off events. [2023-11-30 04:33:02,855 INFO L125 PetriNetUnfolderBase]: For 3250/3250 co-relation queries the response was YES. [2023-11-30 04:33:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 1661 events. 261/1661 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6832 event pairs, 0 based on Foata normal form. 0/1319 useless extension candidates. Maximal degree in co-relation 1966. Up to 54 conditions per place. [2023-11-30 04:33:03,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 1091 places, 1273 transitions, 3300 flow [2023-11-30 04:33:03,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1091 places, 1273 transitions, 3300 flow [2023-11-30 04:33:03,121 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:03,121 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:03,121 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:03,122 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:03,122 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:03,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:03,122 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:03,122 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:03,122 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:03,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1668109314, now seen corresponding path program 1 times [2023-11-30 04:33:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472330012] [2023-11-30 04:33:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:03,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:03,142 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:33:03,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:03,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472330012] [2023-11-30 04:33:03,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472330012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565319046] [2023-11-30 04:33:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:03,143 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:03,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:03,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:03,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:03,145 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1273 [2023-11-30 04:33:03,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1091 places, 1273 transitions, 3300 flow. Second operand has 3 states, 3 states have (on average 1080.0) internal successors, (3240), 3 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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:33:03,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:03,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1273 [2023-11-30 04:33:03,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:04,181 INFO L124 PetriNetUnfolderBase]: 104/1237 cut-off events. [2023-11-30 04:33:04,181 INFO L125 PetriNetUnfolderBase]: For 3250/3250 co-relation queries the response was YES. [2023-11-30 04:33:04,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 1237 events. 104/1237 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4950 event pairs, 0 based on Foata normal form. 4537/5617 useless extension candidates. Maximal degree in co-relation 1635. Up to 81 conditions per place. [2023-11-30 04:33:04,297 INFO L140 encePairwiseOnDemand]: 1139/1273 looper letters, 32 selfloop transitions, 1 changer transitions 0/1057 dead transitions. [2023-11-30 04:33:04,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 1057 transitions, 2934 flow [2023-11-30 04:33:04,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3400 transitions. [2023-11-30 04:33:04,299 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8902854150301126 [2023-11-30 04:33:04,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3400 transitions. [2023-11-30 04:33:04,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3400 transitions. [2023-11-30 04:33:04,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:04,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3400 transitions. [2023-11-30 04:33:04,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1133.3333333333333) internal successors, (3400), 3 states have internal predecessors, (3400), 0 states have call successors, (0), 0 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:33:04,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1273.0) internal successors, (5092), 4 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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:33:04,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1273.0) internal successors, (5092), 4 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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:33:04,305 INFO L307 CegarLoopForPetriNet]: 1091 programPoint places, -83 predicate places. [2023-11-30 04:33:04,305 INFO L500 AbstractCegarLoop]: Abstraction has has 1008 places, 1057 transitions, 2934 flow [2023-11-30 04:33:04,305 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.0) internal successors, (3240), 3 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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:33:04,305 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:04,305 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:04,305 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2023-11-30 04:33:04,305 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:04,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1668109315, now seen corresponding path program 1 times [2023-11-30 04:33:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001833653] [2023-11-30 04:33:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:04,337 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:33:04,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:04,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001833653] [2023-11-30 04:33:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001833653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:04,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534589402] [2023-11-30 04:33:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:04,338 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:04,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:04,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:04,342 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1079 out of 1273 [2023-11-30 04:33:04,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 1057 transitions, 2934 flow. Second operand has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 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:33:04,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:04,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1079 of 1273 [2023-11-30 04:33:04,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:05,059 INFO L124 PetriNetUnfolderBase]: 104/1210 cut-off events. [2023-11-30 04:33:05,059 INFO L125 PetriNetUnfolderBase]: For 3280/3280 co-relation queries the response was YES. [2023-11-30 04:33:05,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 1210 events. 104/1210 cut-off events. For 3280/3280 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4743 event pairs, 0 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 1634. Up to 54 conditions per place. [2023-11-30 04:33:05,204 INFO L140 encePairwiseOnDemand]: 1271/1273 looper letters, 30 selfloop transitions, 1 changer transitions 0/1056 dead transitions. [2023-11-30 04:33:05,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1056 transitions, 2992 flow [2023-11-30 04:33:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3269 transitions. [2023-11-30 04:33:05,208 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8559832416863054 [2023-11-30 04:33:05,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3269 transitions. [2023-11-30 04:33:05,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3269 transitions. [2023-11-30 04:33:05,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:05,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3269 transitions. [2023-11-30 04:33:05,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1089.6666666666667) internal successors, (3269), 3 states have internal predecessors, (3269), 0 states have call successors, (0), 0 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:33:05,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1273.0) internal successors, (5092), 4 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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:33:05,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1273.0) internal successors, (5092), 4 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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:33:05,213 INFO L307 CegarLoopForPetriNet]: 1091 programPoint places, -82 predicate places. [2023-11-30 04:33:05,213 INFO L500 AbstractCegarLoop]: Abstraction has has 1009 places, 1056 transitions, 2992 flow [2023-11-30 04:33:05,213 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 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:33:05,213 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:05,214 INFO L232 CegarLoopForPetriNet]: trace histogram [27, 27, 27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:05,214 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2023-11-30 04:33:05,214 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:05,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1238089719, now seen corresponding path program 1 times [2023-11-30 04:33:05,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:05,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136377450] [2023-11-30 04:33:05,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:05,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:05,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:05,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:05,289 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:05,290 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:05,290 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:05,290 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:05,290 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2023-11-30 04:33:05,290 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:05,290 WARN L227 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:05,290 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2023-11-30 04:33:05,398 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:05,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1132 places, 1321 transitions, 3452 flow [2023-11-30 04:33:06,269 INFO L124 PetriNetUnfolderBase]: 271/1724 cut-off events. [2023-11-30 04:33:06,269 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2023-11-30 04:33:06,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1724 events. 271/1724 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 7126 event pairs, 0 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 2057. Up to 56 conditions per place. [2023-11-30 04:33:06,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 1132 places, 1321 transitions, 3452 flow [2023-11-30 04:33:06,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1132 places, 1321 transitions, 3452 flow [2023-11-30 04:33:06,560 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:06,562 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:06,562 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:06,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:06,563 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:06,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:06,563 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:06,563 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:06,563 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:06,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash -406975893, now seen corresponding path program 1 times [2023-11-30 04:33:06,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:06,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070891156] [2023-11-30 04:33:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:06,585 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:33:06,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:06,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070891156] [2023-11-30 04:33:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070891156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:06,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782227987] [2023-11-30 04:33:06,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:06,586 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:06,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:06,589 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1119 out of 1321 [2023-11-30 04:33:06,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1132 places, 1321 transitions, 3452 flow. Second operand has 3 states, 3 states have (on average 1121.0) internal successors, (3363), 3 states have internal predecessors, (3363), 0 states have call successors, (0), 0 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:33:06,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:06,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1119 of 1321 [2023-11-30 04:33:06,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:07,268 INFO L124 PetriNetUnfolderBase]: 108/1284 cut-off events. [2023-11-30 04:33:07,268 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2023-11-30 04:33:07,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 1284 events. 108/1284 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5148 event pairs, 0 based on Foata normal form. 4913/6034 useless extension candidates. Maximal degree in co-relation 1713. Up to 84 conditions per place. [2023-11-30 04:33:07,423 INFO L140 encePairwiseOnDemand]: 1182/1321 looper letters, 33 selfloop transitions, 1 changer transitions 0/1097 dead transitions. [2023-11-30 04:33:07,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 1097 transitions, 3072 flow [2023-11-30 04:33:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3529 transitions. [2023-11-30 04:33:07,426 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8904870047943477 [2023-11-30 04:33:07,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3529 transitions. [2023-11-30 04:33:07,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3529 transitions. [2023-11-30 04:33:07,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:07,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3529 transitions. [2023-11-30 04:33:07,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1176.3333333333333) internal successors, (3529), 3 states have internal predecessors, (3529), 0 states have call successors, (0), 0 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:33:07,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1321.0) internal successors, (5284), 4 states have internal predecessors, (5284), 0 states have call successors, (0), 0 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:33:07,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1321.0) internal successors, (5284), 4 states have internal predecessors, (5284), 0 states have call successors, (0), 0 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:33:07,431 INFO L307 CegarLoopForPetriNet]: 1132 programPoint places, -86 predicate places. [2023-11-30 04:33:07,431 INFO L500 AbstractCegarLoop]: Abstraction has has 1046 places, 1097 transitions, 3072 flow [2023-11-30 04:33:07,431 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1121.0) internal successors, (3363), 3 states have internal predecessors, (3363), 0 states have call successors, (0), 0 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:33:07,431 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:07,431 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:07,431 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2023-11-30 04:33:07,431 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:07,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash -406975892, now seen corresponding path program 1 times [2023-11-30 04:33:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537618913] [2023-11-30 04:33:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:07,458 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:33:07,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537618913] [2023-11-30 04:33:07,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537618913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:07,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:07,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:07,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608684913] [2023-11-30 04:33:07,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:07,459 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:07,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:07,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:07,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:07,461 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1120 out of 1321 [2023-11-30 04:33:07,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 1097 transitions, 3072 flow. Second operand has 3 states, 3 states have (on average 1121.6666666666667) internal successors, (3365), 3 states have internal predecessors, (3365), 0 states have call successors, (0), 0 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:33:07,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:07,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1120 of 1321 [2023-11-30 04:33:07,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:08,130 INFO L124 PetriNetUnfolderBase]: 108/1256 cut-off events. [2023-11-30 04:33:08,131 INFO L125 PetriNetUnfolderBase]: For 3658/3658 co-relation queries the response was YES. [2023-11-30 04:33:08,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1256 events. 108/1256 cut-off events. For 3658/3658 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4945 event pairs, 0 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 1712. Up to 56 conditions per place. [2023-11-30 04:33:08,287 INFO L140 encePairwiseOnDemand]: 1319/1321 looper letters, 31 selfloop transitions, 1 changer transitions 0/1096 dead transitions. [2023-11-30 04:33:08,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 1096 transitions, 3132 flow [2023-11-30 04:33:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3393 transitions. [2023-11-30 04:33:08,289 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8561695685087055 [2023-11-30 04:33:08,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3393 transitions. [2023-11-30 04:33:08,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3393 transitions. [2023-11-30 04:33:08,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:08,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3393 transitions. [2023-11-30 04:33:08,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1131.0) internal successors, (3393), 3 states have internal predecessors, (3393), 0 states have call successors, (0), 0 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:33:08,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1321.0) internal successors, (5284), 4 states have internal predecessors, (5284), 0 states have call successors, (0), 0 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:33:08,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1321.0) internal successors, (5284), 4 states have internal predecessors, (5284), 0 states have call successors, (0), 0 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:33:08,294 INFO L307 CegarLoopForPetriNet]: 1132 programPoint places, -85 predicate places. [2023-11-30 04:33:08,294 INFO L500 AbstractCegarLoop]: Abstraction has has 1047 places, 1096 transitions, 3132 flow [2023-11-30 04:33:08,294 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1121.6666666666667) internal successors, (3365), 3 states have internal predecessors, (3365), 0 states have call successors, (0), 0 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:33:08,294 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:08,295 INFO L232 CegarLoopForPetriNet]: trace histogram [28, 28, 28, 28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:08,295 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2023-11-30 04:33:08,295 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:08,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1455075846, now seen corresponding path program 1 times [2023-11-30 04:33:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:08,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856635390] [2023-11-30 04:33:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:08,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:08,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:08,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:08,377 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:08,377 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:08,377 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:08,377 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:08,377 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2023-11-30 04:33:08,377 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:08,378 WARN L227 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:08,378 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2023-11-30 04:33:08,476 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:08,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1173 places, 1369 transitions, 3606 flow [2023-11-30 04:33:09,340 INFO L124 PetriNetUnfolderBase]: 281/1787 cut-off events. [2023-11-30 04:33:09,341 INFO L125 PetriNetUnfolderBase]: For 4032/4032 co-relation queries the response was YES. [2023-11-30 04:33:09,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 1787 events. 281/1787 cut-off events. For 4032/4032 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 7380 event pairs, 0 based on Foata normal form. 0/1419 useless extension candidates. Maximal degree in co-relation 2149. Up to 58 conditions per place. [2023-11-30 04:33:09,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 1173 places, 1369 transitions, 3606 flow [2023-11-30 04:33:09,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1173 places, 1369 transitions, 3606 flow [2023-11-30 04:33:09,643 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:09,643 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:09,643 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:09,644 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:09,644 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:09,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:09,644 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:09,644 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:09,644 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:09,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -713974524, now seen corresponding path program 1 times [2023-11-30 04:33:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:09,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217583198] [2023-11-30 04:33:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:09,668 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:33:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217583198] [2023-11-30 04:33:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217583198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840025185] [2023-11-30 04:33:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:09,668 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:09,670 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1160 out of 1369 [2023-11-30 04:33:09,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1173 places, 1369 transitions, 3606 flow. Second operand has 3 states, 3 states have (on average 1162.0) internal successors, (3486), 3 states have internal predecessors, (3486), 0 states have call successors, (0), 0 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:33:09,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:09,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1160 of 1369 [2023-11-30 04:33:09,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:10,330 INFO L124 PetriNetUnfolderBase]: 112/1331 cut-off events. [2023-11-30 04:33:10,330 INFO L125 PetriNetUnfolderBase]: For 4032/4032 co-relation queries the response was YES. [2023-11-30 04:33:10,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1331 events. 112/1331 cut-off events. For 4032/4032 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5348 event pairs, 0 based on Foata normal form. 5304/6466 useless extension candidates. Maximal degree in co-relation 1792. Up to 87 conditions per place. [2023-11-30 04:33:10,490 INFO L140 encePairwiseOnDemand]: 1225/1369 looper letters, 34 selfloop transitions, 1 changer transitions 0/1137 dead transitions. [2023-11-30 04:33:10,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1084 places, 1137 transitions, 3212 flow [2023-11-30 04:33:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3658 transitions. [2023-11-30 04:33:10,519 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8906744582420258 [2023-11-30 04:33:10,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3658 transitions. [2023-11-30 04:33:10,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3658 transitions. [2023-11-30 04:33:10,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:10,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3658 transitions. [2023-11-30 04:33:10,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1219.3333333333333) internal successors, (3658), 3 states have internal predecessors, (3658), 0 states have call successors, (0), 0 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:33:10,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1369.0) internal successors, (5476), 4 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:33:10,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1369.0) internal successors, (5476), 4 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:33:10,524 INFO L307 CegarLoopForPetriNet]: 1173 programPoint places, -89 predicate places. [2023-11-30 04:33:10,524 INFO L500 AbstractCegarLoop]: Abstraction has has 1084 places, 1137 transitions, 3212 flow [2023-11-30 04:33:10,524 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1162.0) internal successors, (3486), 3 states have internal predecessors, (3486), 0 states have call successors, (0), 0 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:33:10,524 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:10,524 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:10,524 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2023-11-30 04:33:10,524 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:10,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -713974523, now seen corresponding path program 1 times [2023-11-30 04:33:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976821065] [2023-11-30 04:33:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:10,581 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:33:10,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:10,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976821065] [2023-11-30 04:33:10,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976821065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:10,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:10,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601536451] [2023-11-30 04:33:10,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:10,582 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:10,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:10,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:10,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:10,584 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1161 out of 1369 [2023-11-30 04:33:10,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1084 places, 1137 transitions, 3212 flow. Second operand has 3 states, 3 states have (on average 1162.6666666666667) internal successors, (3488), 3 states have internal predecessors, (3488), 0 states have call successors, (0), 0 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:33:10,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:10,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1161 of 1369 [2023-11-30 04:33:10,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:11,219 INFO L124 PetriNetUnfolderBase]: 112/1302 cut-off events. [2023-11-30 04:33:11,219 INFO L125 PetriNetUnfolderBase]: For 4064/4064 co-relation queries the response was YES. [2023-11-30 04:33:11,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1302 events. 112/1302 cut-off events. For 4064/4064 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5132 event pairs, 0 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 1791. Up to 58 conditions per place. [2023-11-30 04:33:11,374 INFO L140 encePairwiseOnDemand]: 1367/1369 looper letters, 32 selfloop transitions, 1 changer transitions 0/1136 dead transitions. [2023-11-30 04:33:11,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1085 places, 1136 transitions, 3274 flow [2023-11-30 04:33:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3517 transitions. [2023-11-30 04:33:11,376 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8563428293158023 [2023-11-30 04:33:11,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3517 transitions. [2023-11-30 04:33:11,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3517 transitions. [2023-11-30 04:33:11,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:11,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3517 transitions. [2023-11-30 04:33:11,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 0 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:33:11,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1369.0) internal successors, (5476), 4 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:33:11,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1369.0) internal successors, (5476), 4 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:33:11,380 INFO L307 CegarLoopForPetriNet]: 1173 programPoint places, -88 predicate places. [2023-11-30 04:33:11,380 INFO L500 AbstractCegarLoop]: Abstraction has has 1085 places, 1136 transitions, 3274 flow [2023-11-30 04:33:11,381 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1162.6666666666667) internal successors, (3488), 3 states have internal predecessors, (3488), 0 states have call successors, (0), 0 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:33:11,381 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:11,381 INFO L232 CegarLoopForPetriNet]: trace histogram [29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:11,381 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2023-11-30 04:33:11,381 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:11,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2135655674, now seen corresponding path program 1 times [2023-11-30 04:33:11,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:11,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018619548] [2023-11-30 04:33:11,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:11,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:11,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:11,447 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:11,448 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:11,448 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:11,448 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:11,448 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2023-11-30 04:33:11,448 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:11,448 WARN L227 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:11,448 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2023-11-30 04:33:11,539 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:11,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1214 places, 1417 transitions, 3762 flow [2023-11-30 04:33:12,361 INFO L124 PetriNetUnfolderBase]: 291/1850 cut-off events. [2023-11-30 04:33:12,361 INFO L125 PetriNetUnfolderBase]: For 4466/4466 co-relation queries the response was YES. [2023-11-30 04:33:12,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1850 events. 291/1850 cut-off events. For 4466/4466 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 7631 event pairs, 0 based on Foata normal form. 0/1469 useless extension candidates. Maximal degree in co-relation 2242. Up to 60 conditions per place. [2023-11-30 04:33:12,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 1214 places, 1417 transitions, 3762 flow [2023-11-30 04:33:12,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1214 places, 1417 transitions, 3762 flow [2023-11-30 04:33:12,679 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:12,679 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:12,679 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:12,680 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:12,680 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:12,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:12,680 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:12,680 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:12,680 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:12,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash 747113421, now seen corresponding path program 1 times [2023-11-30 04:33:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:12,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363344440] [2023-11-30 04:33:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:12,704 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:33:12,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363344440] [2023-11-30 04:33:12,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363344440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:12,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:12,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:12,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940028701] [2023-11-30 04:33:12,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:12,705 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:12,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:12,707 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1201 out of 1417 [2023-11-30 04:33:12,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1214 places, 1417 transitions, 3762 flow. Second operand has 3 states, 3 states have (on average 1203.0) internal successors, (3609), 3 states have internal predecessors, (3609), 0 states have call successors, (0), 0 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:33:12,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:12,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1201 of 1417 [2023-11-30 04:33:12,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:13,424 INFO L124 PetriNetUnfolderBase]: 116/1378 cut-off events. [2023-11-30 04:33:13,424 INFO L125 PetriNetUnfolderBase]: For 4466/4466 co-relation queries the response was YES. [2023-11-30 04:33:13,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1378 events. 116/1378 cut-off events. For 4466/4466 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5529 event pairs, 0 based on Foata normal form. 5710/6913 useless extension candidates. Maximal degree in co-relation 1872. Up to 90 conditions per place. [2023-11-30 04:33:13,574 INFO L140 encePairwiseOnDemand]: 1268/1417 looper letters, 35 selfloop transitions, 1 changer transitions 0/1177 dead transitions. [2023-11-30 04:33:13,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1122 places, 1177 transitions, 3354 flow [2023-11-30 04:33:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3787 transitions. [2023-11-30 04:33:13,578 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8908492119501293 [2023-11-30 04:33:13,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3787 transitions. [2023-11-30 04:33:13,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3787 transitions. [2023-11-30 04:33:13,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:13,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3787 transitions. [2023-11-30 04:33:13,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1262.3333333333333) internal successors, (3787), 3 states have internal predecessors, (3787), 0 states have call successors, (0), 0 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:33:13,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1417.0) internal successors, (5668), 4 states have internal predecessors, (5668), 0 states have call successors, (0), 0 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:33:13,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1417.0) internal successors, (5668), 4 states have internal predecessors, (5668), 0 states have call successors, (0), 0 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:33:13,583 INFO L307 CegarLoopForPetriNet]: 1214 programPoint places, -92 predicate places. [2023-11-30 04:33:13,583 INFO L500 AbstractCegarLoop]: Abstraction has has 1122 places, 1177 transitions, 3354 flow [2023-11-30 04:33:13,584 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1203.0) internal successors, (3609), 3 states have internal predecessors, (3609), 0 states have call successors, (0), 0 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:33:13,584 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:13,584 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:13,584 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2023-11-30 04:33:13,584 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:13,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash 747113422, now seen corresponding path program 1 times [2023-11-30 04:33:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849752482] [2023-11-30 04:33:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:13,637 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:33:13,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:13,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849752482] [2023-11-30 04:33:13,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849752482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:13,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:13,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:13,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487087920] [2023-11-30 04:33:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:13,637 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:13,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:13,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:13,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:13,639 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1202 out of 1417 [2023-11-30 04:33:13,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1122 places, 1177 transitions, 3354 flow. Second operand has 3 states, 3 states have (on average 1203.6666666666667) internal successors, (3611), 3 states have internal predecessors, (3611), 0 states have call successors, (0), 0 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:33:13,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:13,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1202 of 1417 [2023-11-30 04:33:13,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:14,326 INFO L124 PetriNetUnfolderBase]: 116/1348 cut-off events. [2023-11-30 04:33:14,326 INFO L125 PetriNetUnfolderBase]: For 4499/4499 co-relation queries the response was YES. [2023-11-30 04:33:14,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 1348 events. 116/1348 cut-off events. For 4499/4499 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5310 event pairs, 0 based on Foata normal form. 0/1203 useless extension candidates. Maximal degree in co-relation 1871. Up to 60 conditions per place. [2023-11-30 04:33:14,496 INFO L140 encePairwiseOnDemand]: 1415/1417 looper letters, 33 selfloop transitions, 1 changer transitions 0/1176 dead transitions. [2023-11-30 04:33:14,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1123 places, 1176 transitions, 3418 flow [2023-11-30 04:33:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3641 transitions. [2023-11-30 04:33:14,507 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.856504351917196 [2023-11-30 04:33:14,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3641 transitions. [2023-11-30 04:33:14,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3641 transitions. [2023-11-30 04:33:14,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:14,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3641 transitions. [2023-11-30 04:33:14,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1213.6666666666667) internal successors, (3641), 3 states have internal predecessors, (3641), 0 states have call successors, (0), 0 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:33:14,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1417.0) internal successors, (5668), 4 states have internal predecessors, (5668), 0 states have call successors, (0), 0 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:33:14,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1417.0) internal successors, (5668), 4 states have internal predecessors, (5668), 0 states have call successors, (0), 0 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:33:14,527 INFO L307 CegarLoopForPetriNet]: 1214 programPoint places, -91 predicate places. [2023-11-30 04:33:14,528 INFO L500 AbstractCegarLoop]: Abstraction has has 1123 places, 1176 transitions, 3418 flow [2023-11-30 04:33:14,528 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1203.6666666666667) internal successors, (3611), 3 states have internal predecessors, (3611), 0 states have call successors, (0), 0 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:33:14,528 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:14,528 INFO L232 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:14,528 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2023-11-30 04:33:14,528 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:14,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash -47628837, now seen corresponding path program 1 times [2023-11-30 04:33:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35249622] [2023-11-30 04:33:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:14,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:14,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:14,600 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:14,600 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:14,600 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:14,601 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:14,601 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2023-11-30 04:33:14,601 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:14,601 WARN L227 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:14,601 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2023-11-30 04:33:14,700 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:14,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1255 places, 1465 transitions, 3920 flow [2023-11-30 04:33:15,625 INFO L124 PetriNetUnfolderBase]: 301/1913 cut-off events. [2023-11-30 04:33:15,625 INFO L125 PetriNetUnfolderBase]: For 4930/4930 co-relation queries the response was YES. [2023-11-30 04:33:15,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1913 events. 301/1913 cut-off events. For 4930/4930 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 7897 event pairs, 0 based on Foata normal form. 0/1519 useless extension candidates. Maximal degree in co-relation 2336. Up to 62 conditions per place. [2023-11-30 04:33:15,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 1255 places, 1465 transitions, 3920 flow [2023-11-30 04:33:15,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1255 places, 1465 transitions, 3920 flow [2023-11-30 04:33:15,973 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:15,974 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:15,974 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:15,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:15,975 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:15,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:15,975 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:15,975 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:15,975 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:15,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash -318679354, now seen corresponding path program 1 times [2023-11-30 04:33:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:15,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005230544] [2023-11-30 04:33:15,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:15,999 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:33:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005230544] [2023-11-30 04:33:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005230544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:16,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:16,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135445882] [2023-11-30 04:33:16,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:16,000 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:16,003 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1242 out of 1465 [2023-11-30 04:33:16,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1255 places, 1465 transitions, 3920 flow. Second operand has 3 states, 3 states have (on average 1244.0) internal successors, (3732), 3 states have internal predecessors, (3732), 0 states have call successors, (0), 0 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:33:16,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:16,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1242 of 1465 [2023-11-30 04:33:16,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:16,816 INFO L124 PetriNetUnfolderBase]: 120/1425 cut-off events. [2023-11-30 04:33:16,817 INFO L125 PetriNetUnfolderBase]: For 4930/4930 co-relation queries the response was YES. [2023-11-30 04:33:17,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1425 events. 120/1425 cut-off events. For 4930/4930 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5743 event pairs, 0 based on Foata normal form. 6131/7375 useless extension candidates. Maximal degree in co-relation 1953. Up to 93 conditions per place. [2023-11-30 04:33:17,028 INFO L140 encePairwiseOnDemand]: 1311/1465 looper letters, 36 selfloop transitions, 1 changer transitions 0/1217 dead transitions. [2023-11-30 04:33:17,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1160 places, 1217 transitions, 3498 flow [2023-11-30 04:33:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3916 transitions. [2023-11-30 04:33:17,031 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8910125142207054 [2023-11-30 04:33:17,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3916 transitions. [2023-11-30 04:33:17,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3916 transitions. [2023-11-30 04:33:17,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:17,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3916 transitions. [2023-11-30 04:33:17,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1305.3333333333333) internal successors, (3916), 3 states have internal predecessors, (3916), 0 states have call successors, (0), 0 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:33:17,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1465.0) internal successors, (5860), 4 states have internal predecessors, (5860), 0 states have call successors, (0), 0 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:33:17,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1465.0) internal successors, (5860), 4 states have internal predecessors, (5860), 0 states have call successors, (0), 0 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:33:17,044 INFO L307 CegarLoopForPetriNet]: 1255 programPoint places, -95 predicate places. [2023-11-30 04:33:17,044 INFO L500 AbstractCegarLoop]: Abstraction has has 1160 places, 1217 transitions, 3498 flow [2023-11-30 04:33:17,045 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1244.0) internal successors, (3732), 3 states have internal predecessors, (3732), 0 states have call successors, (0), 0 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:33:17,045 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:17,045 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:17,045 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2023-11-30 04:33:17,045 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:17,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash -318679353, now seen corresponding path program 1 times [2023-11-30 04:33:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286795816] [2023-11-30 04:33:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:17,074 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:33:17,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:17,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286795816] [2023-11-30 04:33:17,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286795816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:17,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:17,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:17,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117194034] [2023-11-30 04:33:17,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:17,075 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:17,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:17,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:17,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:17,077 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1243 out of 1465 [2023-11-30 04:33:17,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1160 places, 1217 transitions, 3498 flow. Second operand has 3 states, 3 states have (on average 1244.6666666666667) internal successors, (3734), 3 states have internal predecessors, (3734), 0 states have call successors, (0), 0 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:33:17,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:17,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1243 of 1465 [2023-11-30 04:33:17,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:17,952 INFO L124 PetriNetUnfolderBase]: 120/1394 cut-off events. [2023-11-30 04:33:17,952 INFO L125 PetriNetUnfolderBase]: For 4964/4964 co-relation queries the response was YES. [2023-11-30 04:33:18,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1394 events. 120/1394 cut-off events. For 4964/4964 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5518 event pairs, 0 based on Foata normal form. 0/1244 useless extension candidates. Maximal degree in co-relation 1952. Up to 62 conditions per place. [2023-11-30 04:33:18,120 INFO L140 encePairwiseOnDemand]: 1463/1465 looper letters, 34 selfloop transitions, 1 changer transitions 0/1216 dead transitions. [2023-11-30 04:33:18,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1161 places, 1216 transitions, 3564 flow [2023-11-30 04:33:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3765 transitions. [2023-11-30 04:33:18,123 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.856655290102389 [2023-11-30 04:33:18,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3765 transitions. [2023-11-30 04:33:18,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3765 transitions. [2023-11-30 04:33:18,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:18,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3765 transitions. [2023-11-30 04:33:18,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1255.0) internal successors, (3765), 3 states have internal predecessors, (3765), 0 states have call successors, (0), 0 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:33:18,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1465.0) internal successors, (5860), 4 states have internal predecessors, (5860), 0 states have call successors, (0), 0 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:33:18,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1465.0) internal successors, (5860), 4 states have internal predecessors, (5860), 0 states have call successors, (0), 0 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:33:18,148 INFO L307 CegarLoopForPetriNet]: 1255 programPoint places, -94 predicate places. [2023-11-30 04:33:18,149 INFO L500 AbstractCegarLoop]: Abstraction has has 1161 places, 1216 transitions, 3564 flow [2023-11-30 04:33:18,149 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1244.6666666666667) internal successors, (3734), 3 states have internal predecessors, (3734), 0 states have call successors, (0), 0 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:33:18,149 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:18,149 INFO L232 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:18,149 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2023-11-30 04:33:18,149 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:18,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1601491203, now seen corresponding path program 1 times [2023-11-30 04:33:18,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:18,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783533279] [2023-11-30 04:33:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:18,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:18,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:18,228 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:18,228 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:18,228 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:18,228 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:18,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2023-11-30 04:33:18,228 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:18,229 WARN L227 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:18,229 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2023-11-30 04:33:18,331 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:18,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1296 places, 1513 transitions, 4080 flow [2023-11-30 04:33:19,314 INFO L124 PetriNetUnfolderBase]: 311/1976 cut-off events. [2023-11-30 04:33:19,314 INFO L125 PetriNetUnfolderBase]: For 5425/5425 co-relation queries the response was YES. [2023-11-30 04:33:19,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 1976 events. 311/1976 cut-off events. For 5425/5425 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 8194 event pairs, 0 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 2431. Up to 64 conditions per place. [2023-11-30 04:33:19,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 1296 places, 1513 transitions, 4080 flow [2023-11-30 04:33:19,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1296 places, 1513 transitions, 4080 flow [2023-11-30 04:33:19,687 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:19,687 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:19,687 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:19,688 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:19,688 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:19,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:19,688 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:19,688 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:19,689 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:19,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 383614447, now seen corresponding path program 1 times [2023-11-30 04:33:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433704393] [2023-11-30 04:33:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:19,715 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:33:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433704393] [2023-11-30 04:33:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433704393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433496413] [2023-11-30 04:33:19,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:19,716 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:19,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:19,718 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1283 out of 1513 [2023-11-30 04:33:19,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1296 places, 1513 transitions, 4080 flow. Second operand has 3 states, 3 states have (on average 1285.0) internal successors, (3855), 3 states have internal predecessors, (3855), 0 states have call successors, (0), 0 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:33:19,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:19,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1283 of 1513 [2023-11-30 04:33:19,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:20,550 INFO L124 PetriNetUnfolderBase]: 124/1472 cut-off events. [2023-11-30 04:33:20,550 INFO L125 PetriNetUnfolderBase]: For 5425/5425 co-relation queries the response was YES. [2023-11-30 04:33:20,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 1472 events. 124/1472 cut-off events. For 5425/5425 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5939 event pairs, 0 based on Foata normal form. 6567/7852 useless extension candidates. Maximal degree in co-relation 2035. Up to 96 conditions per place. [2023-11-30 04:33:20,752 INFO L140 encePairwiseOnDemand]: 1354/1513 looper letters, 37 selfloop transitions, 1 changer transitions 0/1257 dead transitions. [2023-11-30 04:33:20,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1198 places, 1257 transitions, 3644 flow [2023-11-30 04:33:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:20,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4045 transitions. [2023-11-30 04:33:20,754 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8911654549460234 [2023-11-30 04:33:20,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4045 transitions. [2023-11-30 04:33:20,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4045 transitions. [2023-11-30 04:33:20,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:20,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4045 transitions. [2023-11-30 04:33:20,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1348.3333333333333) internal successors, (4045), 3 states have internal predecessors, (4045), 0 states have call successors, (0), 0 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:33:20,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 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:33:20,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 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:33:20,765 INFO L307 CegarLoopForPetriNet]: 1296 programPoint places, -98 predicate places. [2023-11-30 04:33:20,765 INFO L500 AbstractCegarLoop]: Abstraction has has 1198 places, 1257 transitions, 3644 flow [2023-11-30 04:33:20,765 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1285.0) internal successors, (3855), 3 states have internal predecessors, (3855), 0 states have call successors, (0), 0 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:33:20,765 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:20,765 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:20,765 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2023-11-30 04:33:20,765 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:20,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash 383614448, now seen corresponding path program 1 times [2023-11-30 04:33:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:20,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821819078] [2023-11-30 04:33:20,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:20,814 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:33:20,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:20,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821819078] [2023-11-30 04:33:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821819078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:20,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:20,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085843812] [2023-11-30 04:33:20,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:20,815 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:20,817 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1284 out of 1513 [2023-11-30 04:33:20,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1198 places, 1257 transitions, 3644 flow. Second operand has 3 states, 3 states have (on average 1285.6666666666667) internal successors, (3857), 3 states have internal predecessors, (3857), 0 states have call successors, (0), 0 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:33:20,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:20,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1284 of 1513 [2023-11-30 04:33:20,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:21,755 INFO L124 PetriNetUnfolderBase]: 124/1440 cut-off events. [2023-11-30 04:33:21,755 INFO L125 PetriNetUnfolderBase]: For 5460/5460 co-relation queries the response was YES. [2023-11-30 04:33:21,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2136 conditions, 1440 events. 124/1440 cut-off events. For 5460/5460 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5708 event pairs, 0 based on Foata normal form. 0/1285 useless extension candidates. Maximal degree in co-relation 2034. Up to 64 conditions per place. [2023-11-30 04:33:21,871 INFO L140 encePairwiseOnDemand]: 1511/1513 looper letters, 35 selfloop transitions, 1 changer transitions 0/1256 dead transitions. [2023-11-30 04:33:21,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1199 places, 1256 transitions, 3712 flow [2023-11-30 04:33:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3889 transitions. [2023-11-30 04:33:21,873 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8567966512447676 [2023-11-30 04:33:21,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3889 transitions. [2023-11-30 04:33:21,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3889 transitions. [2023-11-30 04:33:21,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:21,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3889 transitions. [2023-11-30 04:33:21,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1296.3333333333333) internal successors, (3889), 3 states have internal predecessors, (3889), 0 states have call successors, (0), 0 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:33:21,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 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:33:21,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 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:33:21,878 INFO L307 CegarLoopForPetriNet]: 1296 programPoint places, -97 predicate places. [2023-11-30 04:33:21,878 INFO L500 AbstractCegarLoop]: Abstraction has has 1199 places, 1256 transitions, 3712 flow [2023-11-30 04:33:21,878 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1285.6666666666667) internal successors, (3857), 3 states have internal predecessors, (3857), 0 states have call successors, (0), 0 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:33:21,878 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:21,878 INFO L232 CegarLoopForPetriNet]: trace histogram [32, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:21,878 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2023-11-30 04:33:21,879 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:21,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash 712217468, now seen corresponding path program 1 times [2023-11-30 04:33:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:21,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325474891] [2023-11-30 04:33:21,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:21,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:21,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:21,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:21,960 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:21,960 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:21,960 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:21,960 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:21,960 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2023-11-30 04:33:21,960 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:21,961 WARN L227 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:21,961 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2023-11-30 04:33:22,093 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:22,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1337 places, 1561 transitions, 4242 flow [2023-11-30 04:33:23,211 INFO L124 PetriNetUnfolderBase]: 321/2039 cut-off events. [2023-11-30 04:33:23,211 INFO L125 PetriNetUnfolderBase]: For 5952/5952 co-relation queries the response was YES. [2023-11-30 04:33:23,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 2039 events. 321/2039 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 8454 event pairs, 0 based on Foata normal form. 0/1619 useless extension candidates. Maximal degree in co-relation 2527. Up to 66 conditions per place. [2023-11-30 04:33:23,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 1337 places, 1561 transitions, 4242 flow [2023-11-30 04:33:23,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1337 places, 1561 transitions, 4242 flow [2023-11-30 04:33:23,476 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:23,476 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:23,477 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:23,478 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:23,478 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:23,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:23,481 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:23,481 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:23,481 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:23,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1440972472, now seen corresponding path program 1 times [2023-11-30 04:33:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685982439] [2023-11-30 04:33:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:23,508 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:33:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685982439] [2023-11-30 04:33:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685982439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:23,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:23,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350744241] [2023-11-30 04:33:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:23,509 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:23,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:23,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:23,511 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1324 out of 1561 [2023-11-30 04:33:23,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1337 places, 1561 transitions, 4242 flow. Second operand has 3 states, 3 states have (on average 1326.0) internal successors, (3978), 3 states have internal predecessors, (3978), 0 states have call successors, (0), 0 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:33:23,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:23,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1324 of 1561 [2023-11-30 04:33:23,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:24,507 INFO L124 PetriNetUnfolderBase]: 128/1519 cut-off events. [2023-11-30 04:33:24,508 INFO L125 PetriNetUnfolderBase]: For 5952/5952 co-relation queries the response was YES. [2023-11-30 04:33:24,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 1519 events. 128/1519 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6091 event pairs, 0 based on Foata normal form. 7018/8344 useless extension candidates. Maximal degree in co-relation 2118. Up to 99 conditions per place. [2023-11-30 04:33:24,726 INFO L140 encePairwiseOnDemand]: 1397/1561 looper letters, 38 selfloop transitions, 1 changer transitions 0/1297 dead transitions. [2023-11-30 04:33:24,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1236 places, 1297 transitions, 3792 flow [2023-11-30 04:33:24,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4174 transitions. [2023-11-30 04:33:24,728 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8913089899636985 [2023-11-30 04:33:24,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4174 transitions. [2023-11-30 04:33:24,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4174 transitions. [2023-11-30 04:33:24,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:24,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4174 transitions. [2023-11-30 04:33:24,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1391.3333333333333) internal successors, (4174), 3 states have internal predecessors, (4174), 0 states have call successors, (0), 0 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:33:24,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1561.0) internal successors, (6244), 4 states have internal predecessors, (6244), 0 states have call successors, (0), 0 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:33:24,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1561.0) internal successors, (6244), 4 states have internal predecessors, (6244), 0 states have call successors, (0), 0 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:33:24,736 INFO L307 CegarLoopForPetriNet]: 1337 programPoint places, -101 predicate places. [2023-11-30 04:33:24,736 INFO L500 AbstractCegarLoop]: Abstraction has has 1236 places, 1297 transitions, 3792 flow [2023-11-30 04:33:24,736 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1326.0) internal successors, (3978), 3 states have internal predecessors, (3978), 0 states have call successors, (0), 0 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:33:24,736 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:24,736 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:24,736 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2023-11-30 04:33:24,736 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:24,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1440972471, now seen corresponding path program 1 times [2023-11-30 04:33:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389151448] [2023-11-30 04:33:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:24,789 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:33:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389151448] [2023-11-30 04:33:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389151448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423278207] [2023-11-30 04:33:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:24,790 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:24,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:24,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:24,793 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1325 out of 1561 [2023-11-30 04:33:24,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1236 places, 1297 transitions, 3792 flow. Second operand has 3 states, 3 states have (on average 1326.6666666666667) internal successors, (3980), 3 states have internal predecessors, (3980), 0 states have call successors, (0), 0 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:33:24,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:24,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1325 of 1561 [2023-11-30 04:33:24,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:25,733 INFO L124 PetriNetUnfolderBase]: 128/1486 cut-off events. [2023-11-30 04:33:25,734 INFO L125 PetriNetUnfolderBase]: For 5988/5988 co-relation queries the response was YES. [2023-11-30 04:33:25,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 1486 events. 128/1486 cut-off events. For 5988/5988 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5892 event pairs, 0 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 2117. Up to 66 conditions per place. [2023-11-30 04:33:25,958 INFO L140 encePairwiseOnDemand]: 1559/1561 looper letters, 36 selfloop transitions, 1 changer transitions 0/1296 dead transitions. [2023-11-30 04:33:25,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1237 places, 1296 transitions, 3862 flow [2023-11-30 04:33:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4013 transitions. [2023-11-30 04:33:25,961 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8569293188127269 [2023-11-30 04:33:25,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4013 transitions. [2023-11-30 04:33:25,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4013 transitions. [2023-11-30 04:33:25,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:25,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4013 transitions. [2023-11-30 04:33:25,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1337.6666666666667) internal successors, (4013), 3 states have internal predecessors, (4013), 0 states have call successors, (0), 0 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:33:25,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1561.0) internal successors, (6244), 4 states have internal predecessors, (6244), 0 states have call successors, (0), 0 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:33:25,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1561.0) internal successors, (6244), 4 states have internal predecessors, (6244), 0 states have call successors, (0), 0 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:33:25,967 INFO L307 CegarLoopForPetriNet]: 1337 programPoint places, -100 predicate places. [2023-11-30 04:33:25,967 INFO L500 AbstractCegarLoop]: Abstraction has has 1237 places, 1296 transitions, 3862 flow [2023-11-30 04:33:25,967 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1326.6666666666667) internal successors, (3980), 3 states have internal predecessors, (3980), 0 states have call successors, (0), 0 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:33:25,967 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:25,967 INFO L232 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:25,967 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2023-11-30 04:33:25,968 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:25,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1491019264, now seen corresponding path program 1 times [2023-11-30 04:33:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:25,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680626685] [2023-11-30 04:33:25,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:26,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:26,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:26,059 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:26,059 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:26,059 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:26,059 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:26,059 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2023-11-30 04:33:26,059 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:26,060 WARN L227 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:26,060 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2023-11-30 04:33:26,172 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:26,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1378 places, 1609 transitions, 4406 flow [2023-11-30 04:33:27,429 INFO L124 PetriNetUnfolderBase]: 331/2102 cut-off events. [2023-11-30 04:33:27,429 INFO L125 PetriNetUnfolderBase]: For 6512/6512 co-relation queries the response was YES. [2023-11-30 04:33:27,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2730 conditions, 2102 events. 331/2102 cut-off events. For 6512/6512 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 8724 event pairs, 0 based on Foata normal form. 0/1669 useless extension candidates. Maximal degree in co-relation 2624. Up to 68 conditions per place. [2023-11-30 04:33:27,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 1378 places, 1609 transitions, 4406 flow [2023-11-30 04:33:27,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1378 places, 1609 transitions, 4406 flow [2023-11-30 04:33:27,665 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:27,665 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:27,665 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:27,666 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:27,666 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:27,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:27,666 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:27,666 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:27,666 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:27,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:27,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1497472815, now seen corresponding path program 1 times [2023-11-30 04:33:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610661637] [2023-11-30 04:33:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:27,729 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:33:27,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:27,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610661637] [2023-11-30 04:33:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610661637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:27,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:27,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060780983] [2023-11-30 04:33:27,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:27,730 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:27,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:27,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:27,732 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1365 out of 1609 [2023-11-30 04:33:27,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1378 places, 1609 transitions, 4406 flow. Second operand has 3 states, 3 states have (on average 1367.0) internal successors, (4101), 3 states have internal predecessors, (4101), 0 states have call successors, (0), 0 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:33:27,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:27,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1365 of 1609 [2023-11-30 04:33:27,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:28,694 INFO L124 PetriNetUnfolderBase]: 132/1566 cut-off events. [2023-11-30 04:33:28,694 INFO L125 PetriNetUnfolderBase]: For 6512/6512 co-relation queries the response was YES. [2023-11-30 04:33:28,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 1566 events. 132/1566 cut-off events. For 6512/6512 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6337 event pairs, 0 based on Foata normal form. 7484/8851 useless extension candidates. Maximal degree in co-relation 2202. Up to 102 conditions per place. [2023-11-30 04:33:28,934 INFO L140 encePairwiseOnDemand]: 1440/1609 looper letters, 39 selfloop transitions, 1 changer transitions 0/1337 dead transitions. [2023-11-30 04:33:28,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1274 places, 1337 transitions, 3942 flow [2023-11-30 04:33:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4303 transitions. [2023-11-30 04:33:28,937 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8914439610524135 [2023-11-30 04:33:28,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4303 transitions. [2023-11-30 04:33:28,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4303 transitions. [2023-11-30 04:33:28,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:28,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4303 transitions. [2023-11-30 04:33:28,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1434.3333333333333) internal successors, (4303), 3 states have internal predecessors, (4303), 0 states have call successors, (0), 0 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:33:28,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1609.0) internal successors, (6436), 4 states have internal predecessors, (6436), 0 states have call successors, (0), 0 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:33:28,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1609.0) internal successors, (6436), 4 states have internal predecessors, (6436), 0 states have call successors, (0), 0 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:33:28,942 INFO L307 CegarLoopForPetriNet]: 1378 programPoint places, -104 predicate places. [2023-11-30 04:33:28,942 INFO L500 AbstractCegarLoop]: Abstraction has has 1274 places, 1337 transitions, 3942 flow [2023-11-30 04:33:28,943 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1367.0) internal successors, (4101), 3 states have internal predecessors, (4101), 0 states have call successors, (0), 0 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:33:28,943 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:28,943 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:28,943 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2023-11-30 04:33:28,943 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:28,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1497472814, now seen corresponding path program 1 times [2023-11-30 04:33:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:28,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134951726] [2023-11-30 04:33:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:28,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:28,973 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:33:28,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:28,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134951726] [2023-11-30 04:33:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134951726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833369749] [2023-11-30 04:33:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:28,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:28,976 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1366 out of 1609 [2023-11-30 04:33:28,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1274 places, 1337 transitions, 3942 flow. Second operand has 3 states, 3 states have (on average 1367.6666666666667) internal successors, (4103), 3 states have internal predecessors, (4103), 0 states have call successors, (0), 0 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:33:28,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:28,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1366 of 1609 [2023-11-30 04:33:28,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:29,877 INFO L124 PetriNetUnfolderBase]: 132/1532 cut-off events. [2023-11-30 04:33:29,877 INFO L125 PetriNetUnfolderBase]: For 6549/6549 co-relation queries the response was YES. [2023-11-30 04:33:30,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2305 conditions, 1532 events. 132/1532 cut-off events. For 6549/6549 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6074 event pairs, 0 based on Foata normal form. 0/1367 useless extension candidates. Maximal degree in co-relation 2201. Up to 68 conditions per place. [2023-11-30 04:33:30,122 INFO L140 encePairwiseOnDemand]: 1607/1609 looper letters, 37 selfloop transitions, 1 changer transitions 0/1336 dead transitions. [2023-11-30 04:33:30,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1275 places, 1336 transitions, 4014 flow [2023-11-30 04:33:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4137 transitions. [2023-11-30 04:33:30,124 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8570540708514606 [2023-11-30 04:33:30,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4137 transitions. [2023-11-30 04:33:30,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4137 transitions. [2023-11-30 04:33:30,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:30,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4137 transitions. [2023-11-30 04:33:30,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1379.0) internal successors, (4137), 3 states have internal predecessors, (4137), 0 states have call successors, (0), 0 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:33:30,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1609.0) internal successors, (6436), 4 states have internal predecessors, (6436), 0 states have call successors, (0), 0 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:33:30,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1609.0) internal successors, (6436), 4 states have internal predecessors, (6436), 0 states have call successors, (0), 0 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:33:30,130 INFO L307 CegarLoopForPetriNet]: 1378 programPoint places, -103 predicate places. [2023-11-30 04:33:30,130 INFO L500 AbstractCegarLoop]: Abstraction has has 1275 places, 1336 transitions, 4014 flow [2023-11-30 04:33:30,130 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1367.6666666666667) internal successors, (4103), 3 states have internal predecessors, (4103), 0 states have call successors, (0), 0 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:33:30,130 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:30,130 INFO L232 CegarLoopForPetriNet]: trace histogram [34, 34, 34, 34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:30,130 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2023-11-30 04:33:30,130 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:30,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash -623200547, now seen corresponding path program 1 times [2023-11-30 04:33:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213276355] [2023-11-30 04:33:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:30,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:30,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:30,227 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:30,227 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:30,227 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:30,228 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:30,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2023-11-30 04:33:30,228 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:30,228 WARN L227 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:30,228 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2023-11-30 04:33:30,338 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:30,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1419 places, 1657 transitions, 4572 flow [2023-11-30 04:33:31,709 INFO L124 PetriNetUnfolderBase]: 341/2165 cut-off events. [2023-11-30 04:33:31,710 INFO L125 PetriNetUnfolderBase]: For 7106/7106 co-relation queries the response was YES. [2023-11-30 04:33:31,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2165 events. 341/2165 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 9014 event pairs, 0 based on Foata normal form. 0/1719 useless extension candidates. Maximal degree in co-relation 2722. Up to 70 conditions per place. [2023-11-30 04:33:31,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 1419 places, 1657 transitions, 4572 flow [2023-11-30 04:33:31,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1419 places, 1657 transitions, 4572 flow [2023-11-30 04:33:31,969 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:31,969 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:31,969 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:31,970 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:31,970 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:31,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:31,970 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:31,970 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:31,970 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:31,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash 214113418, now seen corresponding path program 1 times [2023-11-30 04:33:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166711754] [2023-11-30 04:33:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:31,999 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:33:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166711754] [2023-11-30 04:33:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166711754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942121581] [2023-11-30 04:33:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:31,999 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:32,002 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1406 out of 1657 [2023-11-30 04:33:32,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1419 places, 1657 transitions, 4572 flow. Second operand has 3 states, 3 states have (on average 1408.0) internal successors, (4224), 3 states have internal predecessors, (4224), 0 states have call successors, (0), 0 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:33:32,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:32,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1406 of 1657 [2023-11-30 04:33:32,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:33,129 INFO L124 PetriNetUnfolderBase]: 136/1613 cut-off events. [2023-11-30 04:33:33,129 INFO L125 PetriNetUnfolderBase]: For 7106/7106 co-relation queries the response was YES. [2023-11-30 04:33:33,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1613 events. 136/1613 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6525 event pairs, 0 based on Foata normal form. 7965/9373 useless extension candidates. Maximal degree in co-relation 2287. Up to 105 conditions per place. [2023-11-30 04:33:33,384 INFO L140 encePairwiseOnDemand]: 1483/1657 looper letters, 40 selfloop transitions, 1 changer transitions 0/1377 dead transitions. [2023-11-30 04:33:33,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1312 places, 1377 transitions, 4094 flow [2023-11-30 04:33:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4432 transitions. [2023-11-30 04:33:33,387 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8915711124522229 [2023-11-30 04:33:33,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4432 transitions. [2023-11-30 04:33:33,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4432 transitions. [2023-11-30 04:33:33,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:33,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4432 transitions. [2023-11-30 04:33:33,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1477.3333333333333) internal successors, (4432), 3 states have internal predecessors, (4432), 0 states have call successors, (0), 0 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:33:33,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1657.0) internal successors, (6628), 4 states have internal predecessors, (6628), 0 states have call successors, (0), 0 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:33:33,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1657.0) internal successors, (6628), 4 states have internal predecessors, (6628), 0 states have call successors, (0), 0 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:33:33,392 INFO L307 CegarLoopForPetriNet]: 1419 programPoint places, -107 predicate places. [2023-11-30 04:33:33,392 INFO L500 AbstractCegarLoop]: Abstraction has has 1312 places, 1377 transitions, 4094 flow [2023-11-30 04:33:33,392 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1408.0) internal successors, (4224), 3 states have internal predecessors, (4224), 0 states have call successors, (0), 0 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:33:33,392 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:33,392 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:33,392 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2023-11-30 04:33:33,392 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:33,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 214113419, now seen corresponding path program 1 times [2023-11-30 04:33:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875769504] [2023-11-30 04:33:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:33,455 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:33:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:33,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875769504] [2023-11-30 04:33:33,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875769504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:33,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:33,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:33,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148155803] [2023-11-30 04:33:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:33,455 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:33,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:33,458 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1407 out of 1657 [2023-11-30 04:33:33,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1312 places, 1377 transitions, 4094 flow. Second operand has 3 states, 3 states have (on average 1408.6666666666667) internal successors, (4226), 3 states have internal predecessors, (4226), 0 states have call successors, (0), 0 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:33:33,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:33,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1407 of 1657 [2023-11-30 04:33:33,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:34,550 INFO L124 PetriNetUnfolderBase]: 136/1578 cut-off events. [2023-11-30 04:33:34,550 INFO L125 PetriNetUnfolderBase]: For 7144/7144 co-relation queries the response was YES. [2023-11-30 04:33:34,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 1578 events. 136/1578 cut-off events. For 7144/7144 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6253 event pairs, 0 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 2286. Up to 70 conditions per place. [2023-11-30 04:33:34,808 INFO L140 encePairwiseOnDemand]: 1655/1657 looper letters, 38 selfloop transitions, 1 changer transitions 0/1376 dead transitions. [2023-11-30 04:33:34,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1313 places, 1376 transitions, 4168 flow [2023-11-30 04:33:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4261 transitions. [2023-11-30 04:33:34,810 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8571715952524643 [2023-11-30 04:33:34,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4261 transitions. [2023-11-30 04:33:34,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4261 transitions. [2023-11-30 04:33:34,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:34,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4261 transitions. [2023-11-30 04:33:34,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1420.3333333333333) internal successors, (4261), 3 states have internal predecessors, (4261), 0 states have call successors, (0), 0 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:33:34,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1657.0) internal successors, (6628), 4 states have internal predecessors, (6628), 0 states have call successors, (0), 0 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:33:34,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1657.0) internal successors, (6628), 4 states have internal predecessors, (6628), 0 states have call successors, (0), 0 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:33:34,817 INFO L307 CegarLoopForPetriNet]: 1419 programPoint places, -106 predicate places. [2023-11-30 04:33:34,817 INFO L500 AbstractCegarLoop]: Abstraction has has 1313 places, 1376 transitions, 4168 flow [2023-11-30 04:33:34,818 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1408.6666666666667) internal successors, (4226), 3 states have internal predecessors, (4226), 0 states have call successors, (0), 0 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:33:34,818 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:34,818 INFO L232 CegarLoopForPetriNet]: trace histogram [35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:34,818 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2023-11-30 04:33:34,818 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:34,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:34,818 INFO L85 PathProgramCache]: Analyzing trace with hash 794832381, now seen corresponding path program 1 times [2023-11-30 04:33:34,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517723619] [2023-11-30 04:33:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:34,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:34,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:34,916 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:34,916 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:34,916 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:34,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:34,917 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2023-11-30 04:33:34,917 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:34,917 WARN L227 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:34,917 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2023-11-30 04:33:35,033 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:35,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1460 places, 1705 transitions, 4740 flow [2023-11-30 04:33:36,414 INFO L124 PetriNetUnfolderBase]: 351/2228 cut-off events. [2023-11-30 04:33:36,414 INFO L125 PetriNetUnfolderBase]: For 7735/7735 co-relation queries the response was YES. [2023-11-30 04:33:36,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 2228 events. 351/2228 cut-off events. For 7735/7735 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 9265 event pairs, 0 based on Foata normal form. 0/1769 useless extension candidates. Maximal degree in co-relation 2821. Up to 72 conditions per place. [2023-11-30 04:33:36,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 1460 places, 1705 transitions, 4740 flow [2023-11-30 04:33:36,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1460 places, 1705 transitions, 4740 flow [2023-11-30 04:33:36,736 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:36,736 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:36,736 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:36,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:36,737 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:36,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:36,738 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:36,738 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:36,738 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:36,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash -601181069, now seen corresponding path program 1 times [2023-11-30 04:33:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:36,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032588131] [2023-11-30 04:33:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:36,769 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:33:36,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:36,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032588131] [2023-11-30 04:33:36,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032588131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:36,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:36,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:36,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885114222] [2023-11-30 04:33:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:36,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:36,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:36,772 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1447 out of 1705 [2023-11-30 04:33:36,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1460 places, 1705 transitions, 4740 flow. Second operand has 3 states, 3 states have (on average 1449.0) internal successors, (4347), 3 states have internal predecessors, (4347), 0 states have call successors, (0), 0 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:33:36,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:36,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1447 of 1705 [2023-11-30 04:33:36,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:37,814 INFO L124 PetriNetUnfolderBase]: 140/1660 cut-off events. [2023-11-30 04:33:37,814 INFO L125 PetriNetUnfolderBase]: For 7735/7735 co-relation queries the response was YES. [2023-11-30 04:33:38,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 1660 events. 140/1660 cut-off events. For 7735/7735 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6676 event pairs, 0 based on Foata normal form. 8461/9910 useless extension candidates. Maximal degree in co-relation 2373. Up to 108 conditions per place. [2023-11-30 04:33:38,080 INFO L140 encePairwiseOnDemand]: 1526/1705 looper letters, 41 selfloop transitions, 1 changer transitions 0/1417 dead transitions. [2023-11-30 04:33:38,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1350 places, 1417 transitions, 4248 flow [2023-11-30 04:33:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4561 transitions. [2023-11-30 04:33:38,083 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8916911045943304 [2023-11-30 04:33:38,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4561 transitions. [2023-11-30 04:33:38,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4561 transitions. [2023-11-30 04:33:38,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:38,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4561 transitions. [2023-11-30 04:33:38,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1520.3333333333333) internal successors, (4561), 3 states have internal predecessors, (4561), 0 states have call successors, (0), 0 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:33:38,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1705.0) internal successors, (6820), 4 states have internal predecessors, (6820), 0 states have call successors, (0), 0 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:33:38,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1705.0) internal successors, (6820), 4 states have internal predecessors, (6820), 0 states have call successors, (0), 0 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:33:38,089 INFO L307 CegarLoopForPetriNet]: 1460 programPoint places, -110 predicate places. [2023-11-30 04:33:38,089 INFO L500 AbstractCegarLoop]: Abstraction has has 1350 places, 1417 transitions, 4248 flow [2023-11-30 04:33:38,089 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1449.0) internal successors, (4347), 3 states have internal predecessors, (4347), 0 states have call successors, (0), 0 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:33:38,089 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:38,089 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:38,089 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2023-11-30 04:33:38,089 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:38,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash -601181068, now seen corresponding path program 1 times [2023-11-30 04:33:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167049446] [2023-11-30 04:33:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:38,150 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:33:38,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:38,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167049446] [2023-11-30 04:33:38,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167049446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:38,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:38,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007125698] [2023-11-30 04:33:38,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:38,150 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:38,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:38,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:38,153 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1448 out of 1705 [2023-11-30 04:33:38,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1350 places, 1417 transitions, 4248 flow. Second operand has 3 states, 3 states have (on average 1449.6666666666667) internal successors, (4349), 3 states have internal predecessors, (4349), 0 states have call successors, (0), 0 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:33:38,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:38,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1448 of 1705 [2023-11-30 04:33:38,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:39,157 INFO L124 PetriNetUnfolderBase]: 140/1624 cut-off events. [2023-11-30 04:33:39,157 INFO L125 PetriNetUnfolderBase]: For 7774/7774 co-relation queries the response was YES. [2023-11-30 04:33:39,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 1624 events. 140/1624 cut-off events. For 7774/7774 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6473 event pairs, 0 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 2372. Up to 72 conditions per place. [2023-11-30 04:33:39,422 INFO L140 encePairwiseOnDemand]: 1703/1705 looper letters, 39 selfloop transitions, 1 changer transitions 0/1416 dead transitions. [2023-11-30 04:33:39,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1351 places, 1416 transitions, 4324 flow [2023-11-30 04:33:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4385 transitions. [2023-11-30 04:33:39,424 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8572825024437928 [2023-11-30 04:33:39,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4385 transitions. [2023-11-30 04:33:39,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4385 transitions. [2023-11-30 04:33:39,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:39,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4385 transitions. [2023-11-30 04:33:39,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1461.6666666666667) internal successors, (4385), 3 states have internal predecessors, (4385), 0 states have call successors, (0), 0 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:33:39,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1705.0) internal successors, (6820), 4 states have internal predecessors, (6820), 0 states have call successors, (0), 0 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:33:39,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1705.0) internal successors, (6820), 4 states have internal predecessors, (6820), 0 states have call successors, (0), 0 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:33:39,430 INFO L307 CegarLoopForPetriNet]: 1460 programPoint places, -109 predicate places. [2023-11-30 04:33:39,430 INFO L500 AbstractCegarLoop]: Abstraction has has 1351 places, 1416 transitions, 4324 flow [2023-11-30 04:33:39,430 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1449.6666666666667) internal successors, (4349), 3 states have internal predecessors, (4349), 0 states have call successors, (0), 0 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:33:39,430 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:39,430 INFO L232 CegarLoopForPetriNet]: trace histogram [36, 36, 36, 36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:39,430 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2023-11-30 04:33:39,430 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:39,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1234767870, now seen corresponding path program 1 times [2023-11-30 04:33:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:39,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872772904] [2023-11-30 04:33:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:39,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:39,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:39,543 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:39,543 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:39,543 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:39,543 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:39,543 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2023-11-30 04:33:39,543 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:39,544 WARN L227 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:39,544 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2023-11-30 04:33:39,671 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:39,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1501 places, 1753 transitions, 4910 flow [2023-11-30 04:33:41,270 INFO L124 PetriNetUnfolderBase]: 361/2291 cut-off events. [2023-11-30 04:33:41,270 INFO L125 PetriNetUnfolderBase]: For 8400/8400 co-relation queries the response was YES. [2023-11-30 04:33:41,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3030 conditions, 2291 events. 361/2291 cut-off events. For 8400/8400 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 9594 event pairs, 0 based on Foata normal form. 0/1819 useless extension candidates. Maximal degree in co-relation 2921. Up to 74 conditions per place. [2023-11-30 04:33:41,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 1501 places, 1753 transitions, 4910 flow [2023-11-30 04:33:41,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1501 places, 1753 transitions, 4910 flow [2023-11-30 04:33:41,729 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:41,730 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:41,730 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:41,731 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:41,731 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:41,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:41,731 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:41,731 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:41,731 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:41,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash 351611020, now seen corresponding path program 1 times [2023-11-30 04:33:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:41,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586670570] [2023-11-30 04:33:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:41,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:41,768 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:33:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:41,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586670570] [2023-11-30 04:33:41,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586670570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:41,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972160392] [2023-11-30 04:33:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:41,768 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:41,771 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1488 out of 1753 [2023-11-30 04:33:41,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1501 places, 1753 transitions, 4910 flow. Second operand has 3 states, 3 states have (on average 1490.0) internal successors, (4470), 3 states have internal predecessors, (4470), 0 states have call successors, (0), 0 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:33:41,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:41,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1488 of 1753 [2023-11-30 04:33:41,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:42,874 INFO L124 PetriNetUnfolderBase]: 144/1707 cut-off events. [2023-11-30 04:33:42,875 INFO L125 PetriNetUnfolderBase]: For 8400/8400 co-relation queries the response was YES. [2023-11-30 04:33:43,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 1707 events. 144/1707 cut-off events. For 8400/8400 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6933 event pairs, 0 based on Foata normal form. 8972/10462 useless extension candidates. Maximal degree in co-relation 2460. Up to 111 conditions per place. [2023-11-30 04:33:43,162 INFO L140 encePairwiseOnDemand]: 1569/1753 looper letters, 42 selfloop transitions, 1 changer transitions 0/1457 dead transitions. [2023-11-30 04:33:43,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1388 places, 1457 transitions, 4404 flow [2023-11-30 04:33:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4690 transitions. [2023-11-30 04:33:43,165 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8918045255752044 [2023-11-30 04:33:43,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4690 transitions. [2023-11-30 04:33:43,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4690 transitions. [2023-11-30 04:33:43,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:43,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4690 transitions. [2023-11-30 04:33:43,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1563.3333333333333) internal successors, (4690), 3 states have internal predecessors, (4690), 0 states have call successors, (0), 0 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:33:43,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1753.0) internal successors, (7012), 4 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:33:43,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1753.0) internal successors, (7012), 4 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:33:43,172 INFO L307 CegarLoopForPetriNet]: 1501 programPoint places, -113 predicate places. [2023-11-30 04:33:43,172 INFO L500 AbstractCegarLoop]: Abstraction has has 1388 places, 1457 transitions, 4404 flow [2023-11-30 04:33:43,172 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1490.0) internal successors, (4470), 3 states have internal predecessors, (4470), 0 states have call successors, (0), 0 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:33:43,172 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:43,172 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:43,172 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2023-11-30 04:33:43,172 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:43,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash 351611021, now seen corresponding path program 1 times [2023-11-30 04:33:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:43,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79760687] [2023-11-30 04:33:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:43,235 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:33:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79760687] [2023-11-30 04:33:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79760687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:43,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:43,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677232975] [2023-11-30 04:33:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:43,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:43,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:43,238 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1489 out of 1753 [2023-11-30 04:33:43,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1388 places, 1457 transitions, 4404 flow. Second operand has 3 states, 3 states have (on average 1490.6666666666667) internal successors, (4472), 3 states have internal predecessors, (4472), 0 states have call successors, (0), 0 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:33:43,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:43,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1489 of 1753 [2023-11-30 04:33:43,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:44,302 INFO L124 PetriNetUnfolderBase]: 144/1670 cut-off events. [2023-11-30 04:33:44,302 INFO L125 PetriNetUnfolderBase]: For 8440/8440 co-relation queries the response was YES. [2023-11-30 04:33:44,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566 conditions, 1670 events. 144/1670 cut-off events. For 8440/8440 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6662 event pairs, 0 based on Foata normal form. 0/1490 useless extension candidates. Maximal degree in co-relation 2459. Up to 74 conditions per place. [2023-11-30 04:33:45,011 INFO L140 encePairwiseOnDemand]: 1751/1753 looper letters, 40 selfloop transitions, 1 changer transitions 0/1456 dead transitions. [2023-11-30 04:33:45,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1389 places, 1456 transitions, 4482 flow [2023-11-30 04:33:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4509 transitions. [2023-11-30 04:33:45,014 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8573873359954364 [2023-11-30 04:33:45,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4509 transitions. [2023-11-30 04:33:45,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4509 transitions. [2023-11-30 04:33:45,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:45,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4509 transitions. [2023-11-30 04:33:45,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1503.0) internal successors, (4509), 3 states have internal predecessors, (4509), 0 states have call successors, (0), 0 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:33:45,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1753.0) internal successors, (7012), 4 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:33:45,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1753.0) internal successors, (7012), 4 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:33:45,020 INFO L307 CegarLoopForPetriNet]: 1501 programPoint places, -112 predicate places. [2023-11-30 04:33:45,020 INFO L500 AbstractCegarLoop]: Abstraction has has 1389 places, 1456 transitions, 4482 flow [2023-11-30 04:33:45,020 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1490.6666666666667) internal successors, (4472), 3 states have internal predecessors, (4472), 0 states have call successors, (0), 0 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:33:45,020 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:45,021 INFO L232 CegarLoopForPetriNet]: trace histogram [37, 37, 37, 37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:45,021 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2023-11-30 04:33:45,021 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:45,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2116655878, now seen corresponding path program 1 times [2023-11-30 04:33:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:45,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492103859] [2023-11-30 04:33:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:45,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:45,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:45,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:45,128 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:45,128 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:45,128 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:45,128 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:45,128 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2023-11-30 04:33:45,128 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:45,128 WARN L227 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:45,128 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2023-11-30 04:33:45,247 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:45,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1542 places, 1801 transitions, 5082 flow [2023-11-30 04:33:47,011 INFO L124 PetriNetUnfolderBase]: 371/2354 cut-off events. [2023-11-30 04:33:47,011 INFO L125 PetriNetUnfolderBase]: For 9102/9102 co-relation queries the response was YES. [2023-11-30 04:33:47,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 2354 events. 371/2354 cut-off events. For 9102/9102 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 9822 event pairs, 0 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 3022. Up to 76 conditions per place. [2023-11-30 04:33:47,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 1542 places, 1801 transitions, 5082 flow [2023-11-30 04:33:47,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1542 places, 1801 transitions, 5082 flow [2023-11-30 04:33:47,405 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:47,405 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:47,405 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:47,406 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:47,406 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:47,406 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:47,406 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:47,406 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:47,406 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:47,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1222477611, now seen corresponding path program 1 times [2023-11-30 04:33:47,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856996738] [2023-11-30 04:33:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:47,447 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:33:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856996738] [2023-11-30 04:33:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856996738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952699837] [2023-11-30 04:33:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:47,447 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:47,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:47,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:47,450 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1529 out of 1801 [2023-11-30 04:33:47,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1542 places, 1801 transitions, 5082 flow. Second operand has 3 states, 3 states have (on average 1531.0) internal successors, (4593), 3 states have internal predecessors, (4593), 0 states have call successors, (0), 0 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:33:47,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:47,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1529 of 1801 [2023-11-30 04:33:47,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:48,746 INFO L124 PetriNetUnfolderBase]: 148/1754 cut-off events. [2023-11-30 04:33:48,746 INFO L125 PetriNetUnfolderBase]: For 9102/9102 co-relation queries the response was YES. [2023-11-30 04:33:48,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1754 events. 148/1754 cut-off events. For 9102/9102 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7125 event pairs, 0 based on Foata normal form. 9498/11029 useless extension candidates. Maximal degree in co-relation 2548. Up to 114 conditions per place. [2023-11-30 04:33:48,938 INFO L140 encePairwiseOnDemand]: 1612/1801 looper letters, 43 selfloop transitions, 1 changer transitions 0/1497 dead transitions. [2023-11-30 04:33:48,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1426 places, 1497 transitions, 4562 flow [2023-11-30 04:33:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4819 transitions. [2023-11-30 04:33:48,941 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8919119007958541 [2023-11-30 04:33:48,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4819 transitions. [2023-11-30 04:33:48,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4819 transitions. [2023-11-30 04:33:48,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:48,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4819 transitions. [2023-11-30 04:33:48,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1606.3333333333333) internal successors, (4819), 3 states have internal predecessors, (4819), 0 states have call successors, (0), 0 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:33:48,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1801.0) internal successors, (7204), 4 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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:33:48,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1801.0) internal successors, (7204), 4 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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:33:48,946 INFO L307 CegarLoopForPetriNet]: 1542 programPoint places, -116 predicate places. [2023-11-30 04:33:48,947 INFO L500 AbstractCegarLoop]: Abstraction has has 1426 places, 1497 transitions, 4562 flow [2023-11-30 04:33:48,947 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1531.0) internal successors, (4593), 3 states have internal predecessors, (4593), 0 states have call successors, (0), 0 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:33:48,947 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:48,948 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:48,948 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2023-11-30 04:33:48,948 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:48,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1222477610, now seen corresponding path program 1 times [2023-11-30 04:33:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:48,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755869049] [2023-11-30 04:33:48,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:48,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:48,985 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:33:48,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755869049] [2023-11-30 04:33:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755869049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:48,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515434019] [2023-11-30 04:33:48,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:48,986 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:48,988 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1530 out of 1801 [2023-11-30 04:33:48,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1426 places, 1497 transitions, 4562 flow. Second operand has 3 states, 3 states have (on average 1531.6666666666667) internal successors, (4595), 3 states have internal predecessors, (4595), 0 states have call successors, (0), 0 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:33:48,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:48,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1530 of 1801 [2023-11-30 04:33:48,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:50,103 INFO L124 PetriNetUnfolderBase]: 148/1716 cut-off events. [2023-11-30 04:33:50,103 INFO L125 PetriNetUnfolderBase]: For 9143/9143 co-relation queries the response was YES. [2023-11-30 04:33:50,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 1716 events. 148/1716 cut-off events. For 9143/9143 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6839 event pairs, 0 based on Foata normal form. 0/1531 useless extension candidates. Maximal degree in co-relation 2547. Up to 76 conditions per place. [2023-11-30 04:33:50,409 INFO L140 encePairwiseOnDemand]: 1799/1801 looper letters, 41 selfloop transitions, 1 changer transitions 0/1496 dead transitions. [2023-11-30 04:33:50,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1427 places, 1496 transitions, 4642 flow [2023-11-30 04:33:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4633 transitions. [2023-11-30 04:33:50,412 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8574865815287803 [2023-11-30 04:33:50,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4633 transitions. [2023-11-30 04:33:50,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4633 transitions. [2023-11-30 04:33:50,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:50,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4633 transitions. [2023-11-30 04:33:50,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1544.3333333333333) internal successors, (4633), 3 states have internal predecessors, (4633), 0 states have call successors, (0), 0 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:33:50,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1801.0) internal successors, (7204), 4 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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:33:50,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1801.0) internal successors, (7204), 4 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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:33:50,418 INFO L307 CegarLoopForPetriNet]: 1542 programPoint places, -115 predicate places. [2023-11-30 04:33:50,418 INFO L500 AbstractCegarLoop]: Abstraction has has 1427 places, 1496 transitions, 4642 flow [2023-11-30 04:33:50,418 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1531.6666666666667) internal successors, (4595), 3 states have internal predecessors, (4595), 0 states have call successors, (0), 0 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:33:50,418 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:50,419 INFO L232 CegarLoopForPetriNet]: trace histogram [38, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:50,419 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2023-11-30 04:33:50,419 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:50,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:50,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1684866783, now seen corresponding path program 1 times [2023-11-30 04:33:50,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:50,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542195419] [2023-11-30 04:33:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:50,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:50,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:50,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:50,761 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:50,761 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:50,761 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:50,761 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:50,761 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2023-11-30 04:33:50,761 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:50,762 WARN L227 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:50,762 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2023-11-30 04:33:50,893 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:50,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1583 places, 1849 transitions, 5256 flow [2023-11-30 04:33:52,972 INFO L124 PetriNetUnfolderBase]: 381/2417 cut-off events. [2023-11-30 04:33:52,972 INFO L125 PetriNetUnfolderBase]: For 9842/9842 co-relation queries the response was YES. [2023-11-30 04:33:53,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 2417 events. 381/2417 cut-off events. For 9842/9842 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 10048 event pairs, 0 based on Foata normal form. 0/1919 useless extension candidates. Maximal degree in co-relation 3124. Up to 78 conditions per place. [2023-11-30 04:33:53,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 1583 places, 1849 transitions, 5256 flow [2023-11-30 04:33:53,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1583 places, 1849 transitions, 5256 flow [2023-11-30 04:33:53,244 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:53,244 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:53,244 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:53,245 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:53,245 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:53,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:53,245 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:53,245 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:53,245 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:53,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1028479666, now seen corresponding path program 1 times [2023-11-30 04:33:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798218858] [2023-11-30 04:33:53,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:53,279 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:33:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798218858] [2023-11-30 04:33:53,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798218858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:53,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:53,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:53,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156251150] [2023-11-30 04:33:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:53,279 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:53,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:53,283 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1570 out of 1849 [2023-11-30 04:33:53,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1583 places, 1849 transitions, 5256 flow. Second operand has 3 states, 3 states have (on average 1572.0) internal successors, (4716), 3 states have internal predecessors, (4716), 0 states have call successors, (0), 0 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:33:53,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:53,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1570 of 1849 [2023-11-30 04:33:53,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:54,936 INFO L124 PetriNetUnfolderBase]: 152/1801 cut-off events. [2023-11-30 04:33:54,936 INFO L125 PetriNetUnfolderBase]: For 9842/9842 co-relation queries the response was YES. [2023-11-30 04:33:55,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 1801 events. 152/1801 cut-off events. For 9842/9842 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7327 event pairs, 0 based on Foata normal form. 10039/11611 useless extension candidates. Maximal degree in co-relation 2637. Up to 117 conditions per place. [2023-11-30 04:33:55,078 INFO L140 encePairwiseOnDemand]: 1655/1849 looper letters, 44 selfloop transitions, 1 changer transitions 0/1537 dead transitions. [2023-11-30 04:33:55,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1464 places, 1537 transitions, 4722 flow [2023-11-30 04:33:55,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4948 transitions. [2023-11-30 04:33:55,082 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8920137010996936 [2023-11-30 04:33:55,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4948 transitions. [2023-11-30 04:33:55,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4948 transitions. [2023-11-30 04:33:55,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:55,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4948 transitions. [2023-11-30 04:33:55,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1649.3333333333333) internal successors, (4948), 3 states have internal predecessors, (4948), 0 states have call successors, (0), 0 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:33:55,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1849.0) internal successors, (7396), 4 states have internal predecessors, (7396), 0 states have call successors, (0), 0 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:33:55,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1849.0) internal successors, (7396), 4 states have internal predecessors, (7396), 0 states have call successors, (0), 0 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:33:55,089 INFO L307 CegarLoopForPetriNet]: 1583 programPoint places, -119 predicate places. [2023-11-30 04:33:55,089 INFO L500 AbstractCegarLoop]: Abstraction has has 1464 places, 1537 transitions, 4722 flow [2023-11-30 04:33:55,090 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1572.0) internal successors, (4716), 3 states have internal predecessors, (4716), 0 states have call successors, (0), 0 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:33:55,090 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:55,090 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:55,090 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2023-11-30 04:33:55,090 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:55,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1028479665, now seen corresponding path program 1 times [2023-11-30 04:33:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:55,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745256041] [2023-11-30 04:33:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:55,141 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:33:55,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:55,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745256041] [2023-11-30 04:33:55,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745256041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:55,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:55,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:55,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105490537] [2023-11-30 04:33:55,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:55,142 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:55,145 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1571 out of 1849 [2023-11-30 04:33:55,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1464 places, 1537 transitions, 4722 flow. Second operand has 3 states, 3 states have (on average 1572.6666666666667) internal successors, (4718), 3 states have internal predecessors, (4718), 0 states have call successors, (0), 0 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:33:55,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:55,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1571 of 1849 [2023-11-30 04:33:55,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:56,676 INFO L124 PetriNetUnfolderBase]: 152/1762 cut-off events. [2023-11-30 04:33:56,676 INFO L125 PetriNetUnfolderBase]: For 9884/9884 co-relation queries the response was YES. [2023-11-30 04:33:56,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 1762 events. 152/1762 cut-off events. For 9884/9884 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7038 event pairs, 0 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 2636. Up to 78 conditions per place. [2023-11-30 04:33:56,820 INFO L140 encePairwiseOnDemand]: 1847/1849 looper letters, 42 selfloop transitions, 1 changer transitions 0/1536 dead transitions. [2023-11-30 04:33:56,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1465 places, 1536 transitions, 4804 flow [2023-11-30 04:33:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4757 transitions. [2023-11-30 04:33:56,823 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8575806742383271 [2023-11-30 04:33:56,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4757 transitions. [2023-11-30 04:33:56,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4757 transitions. [2023-11-30 04:33:56,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:56,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4757 transitions. [2023-11-30 04:33:56,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1585.6666666666667) internal successors, (4757), 3 states have internal predecessors, (4757), 0 states have call successors, (0), 0 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:33:56,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1849.0) internal successors, (7396), 4 states have internal predecessors, (7396), 0 states have call successors, (0), 0 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:33:56,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1849.0) internal successors, (7396), 4 states have internal predecessors, (7396), 0 states have call successors, (0), 0 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:33:56,829 INFO L307 CegarLoopForPetriNet]: 1583 programPoint places, -118 predicate places. [2023-11-30 04:33:56,829 INFO L500 AbstractCegarLoop]: Abstraction has has 1465 places, 1536 transitions, 4804 flow [2023-11-30 04:33:56,830 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1572.6666666666667) internal successors, (4718), 3 states have internal predecessors, (4718), 0 states have call successors, (0), 0 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:33:56,830 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:56,830 INFO L232 CegarLoopForPetriNet]: trace histogram [39, 39, 39, 39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:56,830 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2023-11-30 04:33:56,830 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:56,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1763907319, now seen corresponding path program 1 times [2023-11-30 04:33:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423914814] [2023-11-30 04:33:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:56,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:56,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:56,953 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:56,953 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:33:56,953 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:33:56,954 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:33:56,954 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2023-11-30 04:33:56,954 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:56,954 WARN L227 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:56,954 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2023-11-30 04:33:57,081 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:57,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1624 places, 1897 transitions, 5432 flow [2023-11-30 04:33:59,354 INFO L124 PetriNetUnfolderBase]: 391/2480 cut-off events. [2023-11-30 04:33:59,354 INFO L125 PetriNetUnfolderBase]: For 10621/10621 co-relation queries the response was YES. [2023-11-30 04:33:59,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 2480 events. 391/2480 cut-off events. For 10621/10621 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 10376 event pairs, 0 based on Foata normal form. 0/1969 useless extension candidates. Maximal degree in co-relation 3227. Up to 80 conditions per place. [2023-11-30 04:33:59,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 1624 places, 1897 transitions, 5432 flow [2023-11-30 04:33:59,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1624 places, 1897 transitions, 5432 flow [2023-11-30 04:33:59,645 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:59,645 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:59,645 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:33:59,646 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:59,646 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:33:59,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:59,646 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:59,647 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:59,647 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:33:59,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 933604855, now seen corresponding path program 1 times [2023-11-30 04:33:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815470598] [2023-11-30 04:33:59,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:59,681 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:33:59,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:59,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815470598] [2023-11-30 04:33:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815470598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:59,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:59,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133843887] [2023-11-30 04:33:59,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:59,682 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:59,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:59,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:59,685 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1611 out of 1897 [2023-11-30 04:33:59,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1624 places, 1897 transitions, 5432 flow. Second operand has 3 states, 3 states have (on average 1613.0) internal successors, (4839), 3 states have internal predecessors, (4839), 0 states have call successors, (0), 0 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:33:59,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:59,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1611 of 1897 [2023-11-30 04:33:59,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:01,291 INFO L124 PetriNetUnfolderBase]: 156/1848 cut-off events. [2023-11-30 04:34:01,291 INFO L125 PetriNetUnfolderBase]: For 10621/10621 co-relation queries the response was YES. [2023-11-30 04:34:01,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1848 events. 156/1848 cut-off events. For 10621/10621 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7527 event pairs, 0 based on Foata normal form. 10595/12208 useless extension candidates. Maximal degree in co-relation 2727. Up to 120 conditions per place. [2023-11-30 04:34:01,474 INFO L140 encePairwiseOnDemand]: 1698/1897 looper letters, 45 selfloop transitions, 1 changer transitions 0/1577 dead transitions. [2023-11-30 04:34:01,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1502 places, 1577 transitions, 4884 flow [2023-11-30 04:34:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5077 transitions. [2023-11-30 04:34:01,477 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8921103496749253 [2023-11-30 04:34:01,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5077 transitions. [2023-11-30 04:34:01,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5077 transitions. [2023-11-30 04:34:01,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:01,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5077 transitions. [2023-11-30 04:34:01,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 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:34:01,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1897.0) internal successors, (7588), 4 states have internal predecessors, (7588), 0 states have call successors, (0), 0 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:34:01,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1897.0) internal successors, (7588), 4 states have internal predecessors, (7588), 0 states have call successors, (0), 0 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:34:01,484 INFO L307 CegarLoopForPetriNet]: 1624 programPoint places, -122 predicate places. [2023-11-30 04:34:01,484 INFO L500 AbstractCegarLoop]: Abstraction has has 1502 places, 1577 transitions, 4884 flow [2023-11-30 04:34:01,484 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1613.0) internal successors, (4839), 3 states have internal predecessors, (4839), 0 states have call successors, (0), 0 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:34:01,484 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:01,484 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:01,485 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2023-11-30 04:34:01,485 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:01,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash 933604856, now seen corresponding path program 1 times [2023-11-30 04:34:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:01,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824157537] [2023-11-30 04:34:01,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:01,546 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:34:01,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:01,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824157537] [2023-11-30 04:34:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824157537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:01,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:01,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:01,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571584850] [2023-11-30 04:34:01,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:01,547 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:01,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:01,550 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1612 out of 1897 [2023-11-30 04:34:01,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1502 places, 1577 transitions, 4884 flow. Second operand has 3 states, 3 states have (on average 1613.6666666666667) internal successors, (4841), 3 states have internal predecessors, (4841), 0 states have call successors, (0), 0 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:34:01,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:01,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1612 of 1897 [2023-11-30 04:34:01,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:03,000 INFO L124 PetriNetUnfolderBase]: 156/1808 cut-off events. [2023-11-30 04:34:03,001 INFO L125 PetriNetUnfolderBase]: For 10664/10664 co-relation queries the response was YES. [2023-11-30 04:34:03,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 1808 events. 156/1808 cut-off events. For 10664/10664 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7228 event pairs, 0 based on Foata normal form. 0/1613 useless extension candidates. Maximal degree in co-relation 2726. Up to 80 conditions per place. [2023-11-30 04:34:03,205 INFO L140 encePairwiseOnDemand]: 1895/1897 looper letters, 43 selfloop transitions, 1 changer transitions 0/1576 dead transitions. [2023-11-30 04:34:03,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1503 places, 1576 transitions, 4968 flow [2023-11-30 04:34:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4881 transitions. [2023-11-30 04:34:03,209 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8576700052714813 [2023-11-30 04:34:03,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4881 transitions. [2023-11-30 04:34:03,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4881 transitions. [2023-11-30 04:34:03,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:03,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4881 transitions. [2023-11-30 04:34:03,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1627.0) internal successors, (4881), 3 states have internal predecessors, (4881), 0 states have call successors, (0), 0 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:34:03,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1897.0) internal successors, (7588), 4 states have internal predecessors, (7588), 0 states have call successors, (0), 0 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:34:03,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1897.0) internal successors, (7588), 4 states have internal predecessors, (7588), 0 states have call successors, (0), 0 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:34:03,215 INFO L307 CegarLoopForPetriNet]: 1624 programPoint places, -121 predicate places. [2023-11-30 04:34:03,215 INFO L500 AbstractCegarLoop]: Abstraction has has 1503 places, 1576 transitions, 4968 flow [2023-11-30 04:34:03,215 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1613.6666666666667) internal successors, (4841), 3 states have internal predecessors, (4841), 0 states have call successors, (0), 0 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:34:03,215 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:03,215 INFO L232 CegarLoopForPetriNet]: trace histogram [40, 40, 40, 40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:03,215 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2023-11-30 04:34:03,216 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:03,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1936129152, now seen corresponding path program 1 times [2023-11-30 04:34:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263657136] [2023-11-30 04:34:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:03,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:34:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:03,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:34:03,469 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:34:03,470 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:34:03,470 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:34:03,470 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:34:03,470 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2023-11-30 04:34:03,470 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:34:03,470 WARN L227 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:34:03,470 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2023-11-30 04:34:03,615 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:34:03,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1665 places, 1945 transitions, 5610 flow [2023-11-30 04:34:06,134 INFO L124 PetriNetUnfolderBase]: 401/2543 cut-off events. [2023-11-30 04:34:06,135 INFO L125 PetriNetUnfolderBase]: For 11440/11440 co-relation queries the response was YES. [2023-11-30 04:34:06,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 2543 events. 401/2543 cut-off events. For 11440/11440 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 10633 event pairs, 0 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3331. Up to 82 conditions per place. [2023-11-30 04:34:06,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 1665 places, 1945 transitions, 5610 flow [2023-11-30 04:34:06,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1665 places, 1945 transitions, 5610 flow [2023-11-30 04:34:06,417 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:34:06,418 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:34:06,418 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:34:06,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:34:06,419 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:34:06,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:34:06,419 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:06,419 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:06,419 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:06,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash 368808656, now seen corresponding path program 1 times [2023-11-30 04:34:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:06,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891537196] [2023-11-30 04:34:06,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:06,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:06,453 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:34:06,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891537196] [2023-11-30 04:34:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891537196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217383634] [2023-11-30 04:34:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:06,454 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:06,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:06,458 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1652 out of 1945 [2023-11-30 04:34:06,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1665 places, 1945 transitions, 5610 flow. Second operand has 3 states, 3 states have (on average 1654.0) internal successors, (4962), 3 states have internal predecessors, (4962), 0 states have call successors, (0), 0 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:34:06,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:06,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1652 of 1945 [2023-11-30 04:34:06,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:08,086 INFO L124 PetriNetUnfolderBase]: 160/1895 cut-off events. [2023-11-30 04:34:08,086 INFO L125 PetriNetUnfolderBase]: For 11440/11440 co-relation queries the response was YES. [2023-11-30 04:34:08,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 1895 events. 160/1895 cut-off events. For 11440/11440 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7711 event pairs, 0 based on Foata normal form. 11166/12820 useless extension candidates. Maximal degree in co-relation 2818. Up to 123 conditions per place. [2023-11-30 04:34:08,305 INFO L140 encePairwiseOnDemand]: 1741/1945 looper letters, 46 selfloop transitions, 1 changer transitions 0/1617 dead transitions. [2023-11-30 04:34:08,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1540 places, 1617 transitions, 5048 flow [2023-11-30 04:34:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5206 transitions. [2023-11-30 04:34:08,308 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8922022279348758 [2023-11-30 04:34:08,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5206 transitions. [2023-11-30 04:34:08,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5206 transitions. [2023-11-30 04:34:08,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:08,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5206 transitions. [2023-11-30 04:34:08,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1735.3333333333333) internal successors, (5206), 3 states have internal predecessors, (5206), 0 states have call successors, (0), 0 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:34:08,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1945.0) internal successors, (7780), 4 states have internal predecessors, (7780), 0 states have call successors, (0), 0 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:34:08,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1945.0) internal successors, (7780), 4 states have internal predecessors, (7780), 0 states have call successors, (0), 0 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:34:08,320 INFO L307 CegarLoopForPetriNet]: 1665 programPoint places, -125 predicate places. [2023-11-30 04:34:08,320 INFO L500 AbstractCegarLoop]: Abstraction has has 1540 places, 1617 transitions, 5048 flow [2023-11-30 04:34:08,328 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1654.0) internal successors, (4962), 3 states have internal predecessors, (4962), 0 states have call successors, (0), 0 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:34:08,328 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:08,328 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:08,328 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2023-11-30 04:34:08,328 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:08,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 368808657, now seen corresponding path program 1 times [2023-11-30 04:34:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:08,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771739046] [2023-11-30 04:34:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:08,389 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:34:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:08,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771739046] [2023-11-30 04:34:08,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771739046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:08,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:08,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915269694] [2023-11-30 04:34:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:08,390 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:08,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:08,393 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1653 out of 1945 [2023-11-30 04:34:08,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1540 places, 1617 transitions, 5048 flow. Second operand has 3 states, 3 states have (on average 1654.6666666666667) internal successors, (4964), 3 states have internal predecessors, (4964), 0 states have call successors, (0), 0 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:34:08,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:08,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1653 of 1945 [2023-11-30 04:34:08,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:10,138 INFO L124 PetriNetUnfolderBase]: 160/1854 cut-off events. [2023-11-30 04:34:10,138 INFO L125 PetriNetUnfolderBase]: For 11484/11484 co-relation queries the response was YES. [2023-11-30 04:34:10,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1854 events. 160/1854 cut-off events. For 11484/11484 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7411 event pairs, 0 based on Foata normal form. 0/1654 useless extension candidates. Maximal degree in co-relation 2817. Up to 82 conditions per place. [2023-11-30 04:34:10,297 INFO L140 encePairwiseOnDemand]: 1943/1945 looper letters, 44 selfloop transitions, 1 changer transitions 0/1616 dead transitions. [2023-11-30 04:34:10,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1541 places, 1616 transitions, 5134 flow [2023-11-30 04:34:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5005 transitions. [2023-11-30 04:34:10,300 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8577549271636675 [2023-11-30 04:34:10,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5005 transitions. [2023-11-30 04:34:10,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5005 transitions. [2023-11-30 04:34:10,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:10,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5005 transitions. [2023-11-30 04:34:10,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1668.3333333333333) internal successors, (5005), 3 states have internal predecessors, (5005), 0 states have call successors, (0), 0 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:34:10,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1945.0) internal successors, (7780), 4 states have internal predecessors, (7780), 0 states have call successors, (0), 0 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:34:10,306 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1945.0) internal successors, (7780), 4 states have internal predecessors, (7780), 0 states have call successors, (0), 0 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:34:10,306 INFO L307 CegarLoopForPetriNet]: 1665 programPoint places, -124 predicate places. [2023-11-30 04:34:10,306 INFO L500 AbstractCegarLoop]: Abstraction has has 1541 places, 1616 transitions, 5134 flow [2023-11-30 04:34:10,306 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1654.6666666666667) internal successors, (4964), 3 states have internal predecessors, (4964), 0 states have call successors, (0), 0 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:34:10,307 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:10,307 INFO L232 CegarLoopForPetriNet]: trace histogram [41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:10,307 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2023-11-30 04:34:10,307 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:10,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash -538846220, now seen corresponding path program 1 times [2023-11-30 04:34:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646896959] [2023-11-30 04:34:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:10,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:34:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:10,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:34:10,454 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:34:10,454 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:34:10,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:34:10,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:34:10,454 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2023-11-30 04:34:10,454 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:34:10,455 WARN L227 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:34:10,455 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2023-11-30 04:34:10,601 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:34:10,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1706 places, 1993 transitions, 5790 flow [2023-11-30 04:34:13,593 INFO L124 PetriNetUnfolderBase]: 411/2606 cut-off events. [2023-11-30 04:34:13,593 INFO L125 PetriNetUnfolderBase]: For 12300/12300 co-relation queries the response was YES. [2023-11-30 04:34:13,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 2606 events. 411/2606 cut-off events. For 12300/12300 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 10917 event pairs, 0 based on Foata normal form. 0/2069 useless extension candidates. Maximal degree in co-relation 3436. Up to 84 conditions per place. [2023-11-30 04:34:13,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 1706 places, 1993 transitions, 5790 flow [2023-11-30 04:34:13,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1706 places, 1993 transitions, 5790 flow [2023-11-30 04:34:13,905 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:34:13,905 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:34:13,905 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:34:13,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:34:13,906 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:34:13,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:34:13,907 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:13,907 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:13,907 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:13,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1572099033, now seen corresponding path program 1 times [2023-11-30 04:34:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157126805] [2023-11-30 04:34:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:13,973 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:34:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157126805] [2023-11-30 04:34:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157126805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438444339] [2023-11-30 04:34:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:13,973 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:13,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:13,983 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1693 out of 1993 [2023-11-30 04:34:13,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1706 places, 1993 transitions, 5790 flow. Second operand has 3 states, 3 states have (on average 1695.0) internal successors, (5085), 3 states have internal predecessors, (5085), 0 states have call successors, (0), 0 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:34:13,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:13,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1693 of 1993 [2023-11-30 04:34:13,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:15,727 INFO L124 PetriNetUnfolderBase]: 164/1942 cut-off events. [2023-11-30 04:34:15,728 INFO L125 PetriNetUnfolderBase]: For 12300/12300 co-relation queries the response was YES. [2023-11-30 04:34:15,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1942 events. 164/1942 cut-off events. For 12300/12300 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7854 event pairs, 0 based on Foata normal form. 11752/13447 useless extension candidates. Maximal degree in co-relation 2910. Up to 126 conditions per place. [2023-11-30 04:34:15,941 INFO L140 encePairwiseOnDemand]: 1784/1993 looper letters, 47 selfloop transitions, 1 changer transitions 0/1657 dead transitions. [2023-11-30 04:34:15,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1578 places, 1657 transitions, 5214 flow [2023-11-30 04:34:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5335 transitions. [2023-11-30 04:34:15,945 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8922896805485867 [2023-11-30 04:34:15,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5335 transitions. [2023-11-30 04:34:15,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5335 transitions. [2023-11-30 04:34:15,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:15,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5335 transitions. [2023-11-30 04:34:15,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1778.3333333333333) internal successors, (5335), 3 states have internal predecessors, (5335), 0 states have call successors, (0), 0 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:34:15,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1993.0) internal successors, (7972), 4 states have internal predecessors, (7972), 0 states have call successors, (0), 0 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:34:15,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1993.0) internal successors, (7972), 4 states have internal predecessors, (7972), 0 states have call successors, (0), 0 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:34:15,952 INFO L307 CegarLoopForPetriNet]: 1706 programPoint places, -128 predicate places. [2023-11-30 04:34:15,952 INFO L500 AbstractCegarLoop]: Abstraction has has 1578 places, 1657 transitions, 5214 flow [2023-11-30 04:34:15,953 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1695.0) internal successors, (5085), 3 states have internal predecessors, (5085), 0 states have call successors, (0), 0 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:34:15,953 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:15,953 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:15,953 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2023-11-30 04:34:15,953 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:15,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1572099034, now seen corresponding path program 1 times [2023-11-30 04:34:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:15,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426008195] [2023-11-30 04:34:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:15,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:34:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426008195] [2023-11-30 04:34:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426008195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:16,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997852000] [2023-11-30 04:34:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:16,014 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:16,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:16,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:16,019 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1694 out of 1993 [2023-11-30 04:34:16,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1578 places, 1657 transitions, 5214 flow. Second operand has 3 states, 3 states have (on average 1695.6666666666667) internal successors, (5087), 3 states have internal predecessors, (5087), 0 states have call successors, (0), 0 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:34:16,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:16,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1694 of 1993 [2023-11-30 04:34:16,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:17,853 INFO L124 PetriNetUnfolderBase]: 164/1900 cut-off events. [2023-11-30 04:34:17,853 INFO L125 PetriNetUnfolderBase]: For 12345/12345 co-relation queries the response was YES. [2023-11-30 04:34:18,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 1900 events. 164/1900 cut-off events. For 12345/12345 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7596 event pairs, 0 based on Foata normal form. 0/1695 useless extension candidates. Maximal degree in co-relation 2909. Up to 84 conditions per place. [2023-11-30 04:34:18,073 INFO L140 encePairwiseOnDemand]: 1991/1993 looper letters, 45 selfloop transitions, 1 changer transitions 0/1656 dead transitions. [2023-11-30 04:34:18,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1579 places, 1656 transitions, 5302 flow [2023-11-30 04:34:18,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5129 transitions. [2023-11-30 04:34:18,076 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8578357584880415 [2023-11-30 04:34:18,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5129 transitions. [2023-11-30 04:34:18,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5129 transitions. [2023-11-30 04:34:18,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:18,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5129 transitions. [2023-11-30 04:34:18,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1709.6666666666667) internal successors, (5129), 3 states have internal predecessors, (5129), 0 states have call successors, (0), 0 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:34:18,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1993.0) internal successors, (7972), 4 states have internal predecessors, (7972), 0 states have call successors, (0), 0 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:34:18,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1993.0) internal successors, (7972), 4 states have internal predecessors, (7972), 0 states have call successors, (0), 0 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:34:18,086 INFO L307 CegarLoopForPetriNet]: 1706 programPoint places, -127 predicate places. [2023-11-30 04:34:18,086 INFO L500 AbstractCegarLoop]: Abstraction has has 1579 places, 1656 transitions, 5302 flow [2023-11-30 04:34:18,087 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1695.6666666666667) internal successors, (5087), 3 states have internal predecessors, (5087), 0 states have call successors, (0), 0 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:34:18,087 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:18,087 INFO L232 CegarLoopForPetriNet]: trace histogram [42, 42, 42, 42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:18,087 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2023-11-30 04:34:18,087 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:18,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash -136090143, now seen corresponding path program 1 times [2023-11-30 04:34:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:18,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821323875] [2023-11-30 04:34:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:18,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:34:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:18,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:34:18,277 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:34:18,277 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:34:18,277 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:34:18,277 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:34:18,277 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2023-11-30 04:34:18,277 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:34:18,278 WARN L227 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:34:18,278 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2023-11-30 04:34:18,622 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:34:18,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1747 places, 2041 transitions, 5972 flow [2023-11-30 04:34:21,113 INFO L124 PetriNetUnfolderBase]: 421/2669 cut-off events. [2023-11-30 04:34:21,122 INFO L125 PetriNetUnfolderBase]: For 13202/13202 co-relation queries the response was YES. [2023-11-30 04:34:21,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 2669 events. 421/2669 cut-off events. For 13202/13202 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 11159 event pairs, 0 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3542. Up to 86 conditions per place. [2023-11-30 04:34:21,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 1747 places, 2041 transitions, 5972 flow [2023-11-30 04:34:21,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1747 places, 2041 transitions, 5972 flow [2023-11-30 04:34:21,490 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:34:21,490 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:34:21,490 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:34:21,491 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:34:21,491 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:34:21,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:34:21,492 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:21,492 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:21,492 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:21,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash 248508690, now seen corresponding path program 1 times [2023-11-30 04:34:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:21,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830126136] [2023-11-30 04:34:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:21,563 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:34:21,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:21,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830126136] [2023-11-30 04:34:21,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830126136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:21,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:21,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:21,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985499213] [2023-11-30 04:34:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:21,564 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:21,569 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1734 out of 2041 [2023-11-30 04:34:21,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1747 places, 2041 transitions, 5972 flow. Second operand has 3 states, 3 states have (on average 1736.0) internal successors, (5208), 3 states have internal predecessors, (5208), 0 states have call successors, (0), 0 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:34:21,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:21,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1734 of 2041 [2023-11-30 04:34:21,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:23,468 INFO L124 PetriNetUnfolderBase]: 168/1989 cut-off events. [2023-11-30 04:34:23,468 INFO L125 PetriNetUnfolderBase]: For 13202/13202 co-relation queries the response was YES. [2023-11-30 04:34:23,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 1989 events. 168/1989 cut-off events. For 13202/13202 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8109 event pairs, 0 based on Foata normal form. 12353/14089 useless extension candidates. Maximal degree in co-relation 3003. Up to 129 conditions per place. [2023-11-30 04:34:23,709 INFO L140 encePairwiseOnDemand]: 1827/2041 looper letters, 48 selfloop transitions, 1 changer transitions 0/1697 dead transitions. [2023-11-30 04:34:23,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1616 places, 1697 transitions, 5382 flow [2023-11-30 04:34:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5464 transitions. [2023-11-30 04:34:23,712 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8923730197615548 [2023-11-30 04:34:23,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5464 transitions. [2023-11-30 04:34:23,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5464 transitions. [2023-11-30 04:34:23,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:23,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5464 transitions. [2023-11-30 04:34:23,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1821.3333333333333) internal successors, (5464), 3 states have internal predecessors, (5464), 0 states have call successors, (0), 0 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:34:23,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2041.0) internal successors, (8164), 4 states have internal predecessors, (8164), 0 states have call successors, (0), 0 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:34:23,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2041.0) internal successors, (8164), 4 states have internal predecessors, (8164), 0 states have call successors, (0), 0 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:34:23,718 INFO L307 CegarLoopForPetriNet]: 1747 programPoint places, -131 predicate places. [2023-11-30 04:34:23,718 INFO L500 AbstractCegarLoop]: Abstraction has has 1616 places, 1697 transitions, 5382 flow [2023-11-30 04:34:23,719 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1736.0) internal successors, (5208), 3 states have internal predecessors, (5208), 0 states have call successors, (0), 0 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:34:23,719 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:23,719 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:23,719 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2023-11-30 04:34:23,719 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:23,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash 248508691, now seen corresponding path program 1 times [2023-11-30 04:34:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:23,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149641415] [2023-11-30 04:34:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:23,769 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:34:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149641415] [2023-11-30 04:34:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149641415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:23,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663899397] [2023-11-30 04:34:23,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:23,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:23,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:23,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:23,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:23,772 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1735 out of 2041 [2023-11-30 04:34:23,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1616 places, 1697 transitions, 5382 flow. Second operand has 3 states, 3 states have (on average 1736.6666666666667) internal successors, (5210), 3 states have internal predecessors, (5210), 0 states have call successors, (0), 0 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:34:23,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:23,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1735 of 2041 [2023-11-30 04:34:23,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:25,711 INFO L124 PetriNetUnfolderBase]: 168/1946 cut-off events. [2023-11-30 04:34:25,711 INFO L125 PetriNetUnfolderBase]: For 13248/13248 co-relation queries the response was YES. [2023-11-30 04:34:25,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 1946 events. 168/1946 cut-off events. For 13248/13248 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7786 event pairs, 0 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 3002. Up to 86 conditions per place. [2023-11-30 04:34:25,957 INFO L140 encePairwiseOnDemand]: 2039/2041 looper letters, 46 selfloop transitions, 1 changer transitions 0/1696 dead transitions. [2023-11-30 04:34:25,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1617 places, 1696 transitions, 5472 flow [2023-11-30 04:34:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5253 transitions. [2023-11-30 04:34:25,960 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8579127878490935 [2023-11-30 04:34:25,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5253 transitions. [2023-11-30 04:34:25,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5253 transitions. [2023-11-30 04:34:25,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:25,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5253 transitions. [2023-11-30 04:34:25,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1751.0) internal successors, (5253), 3 states have internal predecessors, (5253), 0 states have call successors, (0), 0 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:34:25,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2041.0) internal successors, (8164), 4 states have internal predecessors, (8164), 0 states have call successors, (0), 0 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:34:25,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2041.0) internal successors, (8164), 4 states have internal predecessors, (8164), 0 states have call successors, (0), 0 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:34:25,967 INFO L307 CegarLoopForPetriNet]: 1747 programPoint places, -130 predicate places. [2023-11-30 04:34:25,967 INFO L500 AbstractCegarLoop]: Abstraction has has 1617 places, 1696 transitions, 5472 flow [2023-11-30 04:34:25,967 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1736.6666666666667) internal successors, (5210), 3 states have internal predecessors, (5210), 0 states have call successors, (0), 0 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:34:25,968 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:25,968 INFO L232 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:25,968 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2023-11-30 04:34:25,968 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:25,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1604996081, now seen corresponding path program 1 times [2023-11-30 04:34:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:25,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987819127] [2023-11-30 04:34:25,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:26,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:34:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:26,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:34:26,103 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:34:26,103 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:34:26,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:34:26,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:34:26,104 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2023-11-30 04:34:26,104 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:34:26,104 WARN L227 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:34:26,104 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2023-11-30 04:34:26,407 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:34:26,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1788 places, 2089 transitions, 6156 flow [2023-11-30 04:34:28,943 INFO L124 PetriNetUnfolderBase]: 431/2732 cut-off events. [2023-11-30 04:34:28,944 INFO L125 PetriNetUnfolderBase]: For 14147/14147 co-relation queries the response was YES. [2023-11-30 04:34:29,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 2732 events. 431/2732 cut-off events. For 14147/14147 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 11420 event pairs, 0 based on Foata normal form. 0/2169 useless extension candidates. Maximal degree in co-relation 3649. Up to 88 conditions per place. [2023-11-30 04:34:29,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 1788 places, 2089 transitions, 6156 flow [2023-11-30 04:34:29,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1788 places, 2089 transitions, 6156 flow [2023-11-30 04:34:29,367 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:34:29,368 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:34:29,368 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:34:29,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:34:29,369 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:34:29,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:34:29,369 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:29,369 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:29,369 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:29,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash 693004923, now seen corresponding path program 1 times [2023-11-30 04:34:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980408519] [2023-11-30 04:34:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:29,422 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:34:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:29,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980408519] [2023-11-30 04:34:29,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980408519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:29,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:29,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974273236] [2023-11-30 04:34:29,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:29,423 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:29,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:29,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:29,427 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1775 out of 2089 [2023-11-30 04:34:29,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1788 places, 2089 transitions, 6156 flow. Second operand has 3 states, 3 states have (on average 1777.0) internal successors, (5331), 3 states have internal predecessors, (5331), 0 states have call successors, (0), 0 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:34:29,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:29,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1775 of 2089 [2023-11-30 04:34:29,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:31,551 INFO L124 PetriNetUnfolderBase]: 172/2036 cut-off events. [2023-11-30 04:34:31,552 INFO L125 PetriNetUnfolderBase]: For 14147/14147 co-relation queries the response was YES. [2023-11-30 04:34:31,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 2036 events. 172/2036 cut-off events. For 14147/14147 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8248 event pairs, 0 based on Foata normal form. 12969/14746 useless extension candidates. Maximal degree in co-relation 3097. Up to 132 conditions per place. [2023-11-30 04:34:31,821 INFO L140 encePairwiseOnDemand]: 1870/2089 looper letters, 49 selfloop transitions, 1 changer transitions 0/1737 dead transitions. [2023-11-30 04:34:31,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1654 places, 1737 transitions, 5552 flow [2023-11-30 04:34:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5593 transitions. [2023-11-30 04:34:31,825 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8924525291207914 [2023-11-30 04:34:31,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5593 transitions. [2023-11-30 04:34:31,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5593 transitions. [2023-11-30 04:34:31,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:31,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5593 transitions. [2023-11-30 04:34:31,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1864.3333333333333) internal successors, (5593), 3 states have internal predecessors, (5593), 0 states have call successors, (0), 0 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:34:31,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2089.0) internal successors, (8356), 4 states have internal predecessors, (8356), 0 states have call successors, (0), 0 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:34:31,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2089.0) internal successors, (8356), 4 states have internal predecessors, (8356), 0 states have call successors, (0), 0 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:34:31,831 INFO L307 CegarLoopForPetriNet]: 1788 programPoint places, -134 predicate places. [2023-11-30 04:34:31,832 INFO L500 AbstractCegarLoop]: Abstraction has has 1654 places, 1737 transitions, 5552 flow [2023-11-30 04:34:31,832 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1777.0) internal successors, (5331), 3 states have internal predecessors, (5331), 0 states have call successors, (0), 0 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:34:31,832 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:31,832 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:31,832 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2023-11-30 04:34:31,832 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:31,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash 693004924, now seen corresponding path program 1 times [2023-11-30 04:34:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431466494] [2023-11-30 04:34:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:31,881 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:34:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:31,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431466494] [2023-11-30 04:34:31,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431466494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:31,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:31,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:31,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343780610] [2023-11-30 04:34:31,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:31,882 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:31,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:31,885 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1776 out of 2089 [2023-11-30 04:34:31,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1654 places, 1737 transitions, 5552 flow. Second operand has 3 states, 3 states have (on average 1777.6666666666667) internal successors, (5333), 3 states have internal predecessors, (5333), 0 states have call successors, (0), 0 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:34:31,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:31,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1776 of 2089 [2023-11-30 04:34:31,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:33,759 INFO L124 PetriNetUnfolderBase]: 172/1992 cut-off events. [2023-11-30 04:34:33,759 INFO L125 PetriNetUnfolderBase]: For 14194/14194 co-relation queries the response was YES. [2023-11-30 04:34:33,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 1992 events. 172/1992 cut-off events. For 14194/14194 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7972 event pairs, 0 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 3096. Up to 88 conditions per place. [2023-11-30 04:34:34,025 INFO L140 encePairwiseOnDemand]: 2087/2089 looper letters, 47 selfloop transitions, 1 changer transitions 0/1736 dead transitions. [2023-11-30 04:34:34,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1655 places, 1736 transitions, 5644 flow [2023-11-30 04:34:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5377 transitions. [2023-11-30 04:34:34,028 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8579862773256741 [2023-11-30 04:34:34,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5377 transitions. [2023-11-30 04:34:34,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5377 transitions. [2023-11-30 04:34:34,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:34,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5377 transitions. [2023-11-30 04:34:34,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1792.3333333333333) internal successors, (5377), 3 states have internal predecessors, (5377), 0 states have call successors, (0), 0 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:34:34,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2089.0) internal successors, (8356), 4 states have internal predecessors, (8356), 0 states have call successors, (0), 0 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:34:34,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2089.0) internal successors, (8356), 4 states have internal predecessors, (8356), 0 states have call successors, (0), 0 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:34:34,035 INFO L307 CegarLoopForPetriNet]: 1788 programPoint places, -133 predicate places. [2023-11-30 04:34:34,035 INFO L500 AbstractCegarLoop]: Abstraction has has 1655 places, 1736 transitions, 5644 flow [2023-11-30 04:34:34,036 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1777.6666666666667) internal successors, (5333), 3 states have internal predecessors, (5333), 0 states have call successors, (0), 0 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:34:34,036 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:34,036 INFO L232 CegarLoopForPetriNet]: trace histogram [44, 44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:34,036 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2023-11-30 04:34:34,036 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:34,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1315525118, now seen corresponding path program 1 times [2023-11-30 04:34:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946724966] [2023-11-30 04:34:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:34,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:34:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:34,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:34:34,192 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:34:34,192 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:34:34,193 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:34:34,193 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:34:34,193 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2023-11-30 04:34:34,193 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:34:34,193 WARN L227 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:34:34,193 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2023-11-30 04:34:34,470 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:34:34,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1829 places, 2137 transitions, 6342 flow [2023-11-30 04:34:37,002 INFO L124 PetriNetUnfolderBase]: 441/2795 cut-off events. [2023-11-30 04:34:37,003 INFO L125 PetriNetUnfolderBase]: For 15136/15136 co-relation queries the response was YES. [2023-11-30 04:34:37,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 2795 events. 441/2795 cut-off events. For 15136/15136 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 11720 event pairs, 0 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 3757. Up to 90 conditions per place. [2023-11-30 04:34:37,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 1829 places, 2137 transitions, 6342 flow [2023-11-30 04:34:37,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1829 places, 2137 transitions, 6342 flow [2023-11-30 04:34:37,424 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:34:37,425 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:34:37,425 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:34:37,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:34:37,426 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:34:37,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:34:37,426 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:37,426 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:37,426 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:37,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1389379564, now seen corresponding path program 1 times [2023-11-30 04:34:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:37,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289205094] [2023-11-30 04:34:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:37,471 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:34:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289205094] [2023-11-30 04:34:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289205094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:37,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650290846] [2023-11-30 04:34:37,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:37,471 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:37,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:37,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:37,474 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1816 out of 2137 [2023-11-30 04:34:37,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1829 places, 2137 transitions, 6342 flow. Second operand has 3 states, 3 states have (on average 1818.0) internal successors, (5454), 3 states have internal predecessors, (5454), 0 states have call successors, (0), 0 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:34:37,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:37,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1816 of 2137 [2023-11-30 04:34:37,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:39,710 INFO L124 PetriNetUnfolderBase]: 176/2083 cut-off events. [2023-11-30 04:34:39,710 INFO L125 PetriNetUnfolderBase]: For 15136/15136 co-relation queries the response was YES. [2023-11-30 04:34:39,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3302 conditions, 2083 events. 176/2083 cut-off events. For 15136/15136 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8509 event pairs, 0 based on Foata normal form. 13600/15418 useless extension candidates. Maximal degree in co-relation 3192. Up to 135 conditions per place. [2023-11-30 04:34:39,991 INFO L140 encePairwiseOnDemand]: 1913/2137 looper letters, 50 selfloop transitions, 1 changer transitions 0/1777 dead transitions. [2023-11-30 04:34:39,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1692 places, 1777 transitions, 5724 flow [2023-11-30 04:34:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5722 transitions. [2023-11-30 04:34:39,995 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.892528466697863 [2023-11-30 04:34:39,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5722 transitions. [2023-11-30 04:34:39,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5722 transitions. [2023-11-30 04:34:39,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:39,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5722 transitions. [2023-11-30 04:34:39,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1907.3333333333333) internal successors, (5722), 3 states have internal predecessors, (5722), 0 states have call successors, (0), 0 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:34:40,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2137.0) internal successors, (8548), 4 states have internal predecessors, (8548), 0 states have call successors, (0), 0 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:34:40,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2137.0) internal successors, (8548), 4 states have internal predecessors, (8548), 0 states have call successors, (0), 0 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:34:40,002 INFO L307 CegarLoopForPetriNet]: 1829 programPoint places, -137 predicate places. [2023-11-30 04:34:40,002 INFO L500 AbstractCegarLoop]: Abstraction has has 1692 places, 1777 transitions, 5724 flow [2023-11-30 04:34:40,002 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1818.0) internal successors, (5454), 3 states have internal predecessors, (5454), 0 states have call successors, (0), 0 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:34:40,002 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:40,002 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:40,003 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2023-11-30 04:34:40,003 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:40,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:40,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1389379563, now seen corresponding path program 1 times [2023-11-30 04:34:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:40,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488901395] [2023-11-30 04:34:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:40,056 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:34:40,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:40,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488901395] [2023-11-30 04:34:40,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488901395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:40,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:40,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:40,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904587991] [2023-11-30 04:34:40,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:40,056 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:40,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:40,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:40,059 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1817 out of 2137 [2023-11-30 04:34:40,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1692 places, 1777 transitions, 5724 flow. Second operand has 3 states, 3 states have (on average 1818.6666666666667) internal successors, (5456), 3 states have internal predecessors, (5456), 0 states have call successors, (0), 0 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:34:40,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:40,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1817 of 2137 [2023-11-30 04:34:40,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:41,944 INFO L124 PetriNetUnfolderBase]: 176/2038 cut-off events. [2023-11-30 04:34:41,944 INFO L125 PetriNetUnfolderBase]: For 15184/15184 co-relation queries the response was YES. [2023-11-30 04:34:42,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 2038 events. 176/2038 cut-off events. For 15184/15184 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8181 event pairs, 0 based on Foata normal form. 0/1818 useless extension candidates. Maximal degree in co-relation 3191. Up to 90 conditions per place. [2023-11-30 04:34:42,227 INFO L140 encePairwiseOnDemand]: 2135/2137 looper letters, 48 selfloop transitions, 1 changer transitions 0/1776 dead transitions. [2023-11-30 04:34:42,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1693 places, 1776 transitions, 5818 flow [2023-11-30 04:34:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5501 transitions. [2023-11-30 04:34:42,231 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8580564654500078 [2023-11-30 04:34:42,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5501 transitions. [2023-11-30 04:34:42,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5501 transitions. [2023-11-30 04:34:42,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:42,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5501 transitions. [2023-11-30 04:34:42,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1833.6666666666667) internal successors, (5501), 3 states have internal predecessors, (5501), 0 states have call successors, (0), 0 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:34:42,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2137.0) internal successors, (8548), 4 states have internal predecessors, (8548), 0 states have call successors, (0), 0 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:34:42,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2137.0) internal successors, (8548), 4 states have internal predecessors, (8548), 0 states have call successors, (0), 0 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:34:42,238 INFO L307 CegarLoopForPetriNet]: 1829 programPoint places, -136 predicate places. [2023-11-30 04:34:42,238 INFO L500 AbstractCegarLoop]: Abstraction has has 1693 places, 1776 transitions, 5818 flow [2023-11-30 04:34:42,238 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1818.6666666666667) internal successors, (5456), 3 states have internal predecessors, (5456), 0 states have call successors, (0), 0 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:34:42,238 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:42,238 INFO L232 CegarLoopForPetriNet]: trace histogram [45, 45, 45, 45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:42,239 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2023-11-30 04:34:42,239 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:42,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1877999890, now seen corresponding path program 1 times [2023-11-30 04:34:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:42,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394435695] [2023-11-30 04:34:42,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:42,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:34:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:42,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:34:42,624 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:34:42,624 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:34:42,624 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:34:42,624 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:34:42,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2023-11-30 04:34:42,624 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:34:42,625 WARN L227 ceAbstractionStarter]: 44 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:34:42,625 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 45 thread instances. [2023-11-30 04:34:42,857 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:34:42,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1870 places, 2185 transitions, 6530 flow [2023-11-30 04:34:45,670 INFO L124 PetriNetUnfolderBase]: 451/2858 cut-off events. [2023-11-30 04:34:45,670 INFO L125 PetriNetUnfolderBase]: For 16170/16170 co-relation queries the response was YES. [2023-11-30 04:34:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 2858 events. 451/2858 cut-off events. For 16170/16170 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 11968 event pairs, 0 based on Foata normal form. 0/2269 useless extension candidates. Maximal degree in co-relation 3866. Up to 92 conditions per place. [2023-11-30 04:34:46,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 1870 places, 2185 transitions, 6530 flow [2023-11-30 04:34:46,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1870 places, 2185 transitions, 6530 flow [2023-11-30 04:34:46,158 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:34:46,159 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:34:46,159 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:34:46,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:34:46,160 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:34:46,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:34:46,160 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:46,160 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:46,160 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:46,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1703677475, now seen corresponding path program 1 times [2023-11-30 04:34:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014936215] [2023-11-30 04:34:46,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:46,205 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:34:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014936215] [2023-11-30 04:34:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014936215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:46,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:46,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:46,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995817191] [2023-11-30 04:34:46,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:46,205 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:46,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:46,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:46,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:46,209 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1857 out of 2185 [2023-11-30 04:34:46,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1870 places, 2185 transitions, 6530 flow. Second operand has 3 states, 3 states have (on average 1859.0) internal successors, (5577), 3 states have internal predecessors, (5577), 0 states have call successors, (0), 0 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:34:46,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:46,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1857 of 2185 [2023-11-30 04:34:46,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:48,377 INFO L124 PetriNetUnfolderBase]: 180/2130 cut-off events. [2023-11-30 04:34:48,377 INFO L125 PetriNetUnfolderBase]: For 16170/16170 co-relation queries the response was YES. [2023-11-30 04:34:48,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3399 conditions, 2130 events. 180/2130 cut-off events. For 16170/16170 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8709 event pairs, 0 based on Foata normal form. 14246/16105 useless extension candidates. Maximal degree in co-relation 3288. Up to 138 conditions per place. [2023-11-30 04:34:48,923 INFO L140 encePairwiseOnDemand]: 1956/2185 looper letters, 51 selfloop transitions, 1 changer transitions 0/1817 dead transitions. [2023-11-30 04:34:48,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1730 places, 1817 transitions, 5898 flow [2023-11-30 04:34:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5851 transitions. [2023-11-30 04:34:48,926 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.892601067887109 [2023-11-30 04:34:48,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5851 transitions. [2023-11-30 04:34:48,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5851 transitions. [2023-11-30 04:34:48,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:48,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5851 transitions. [2023-11-30 04:34:48,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1950.3333333333333) internal successors, (5851), 3 states have internal predecessors, (5851), 0 states have call successors, (0), 0 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:34:48,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2185.0) internal successors, (8740), 4 states have internal predecessors, (8740), 0 states have call successors, (0), 0 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:34:48,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2185.0) internal successors, (8740), 4 states have internal predecessors, (8740), 0 states have call successors, (0), 0 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:34:48,933 INFO L307 CegarLoopForPetriNet]: 1870 programPoint places, -140 predicate places. [2023-11-30 04:34:48,933 INFO L500 AbstractCegarLoop]: Abstraction has has 1730 places, 1817 transitions, 5898 flow [2023-11-30 04:34:48,934 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1859.0) internal successors, (5577), 3 states have internal predecessors, (5577), 0 states have call successors, (0), 0 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:34:48,934 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:48,934 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:48,934 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2023-11-30 04:34:48,934 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:48,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1703677474, now seen corresponding path program 1 times [2023-11-30 04:34:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644962718] [2023-11-30 04:34:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:48,981 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:34:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:48,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644962718] [2023-11-30 04:34:48,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644962718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:48,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49017574] [2023-11-30 04:34:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:48,982 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:48,985 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1858 out of 2185 [2023-11-30 04:34:48,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1730 places, 1817 transitions, 5898 flow. Second operand has 3 states, 3 states have (on average 1859.6666666666667) internal successors, (5579), 3 states have internal predecessors, (5579), 0 states have call successors, (0), 0 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:34:48,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:48,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1858 of 2185 [2023-11-30 04:34:48,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:51,060 INFO L124 PetriNetUnfolderBase]: 180/2084 cut-off events. [2023-11-30 04:34:51,060 INFO L125 PetriNetUnfolderBase]: For 16219/16219 co-relation queries the response was YES. [2023-11-30 04:34:51,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3403 conditions, 2084 events. 180/2084 cut-off events. For 16219/16219 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8358 event pairs, 0 based on Foata normal form. 0/1859 useless extension candidates. Maximal degree in co-relation 3287. Up to 92 conditions per place. [2023-11-30 04:34:51,267 INFO L140 encePairwiseOnDemand]: 2183/2185 looper letters, 49 selfloop transitions, 1 changer transitions 0/1816 dead transitions. [2023-11-30 04:34:51,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1731 places, 1816 transitions, 5994 flow [2023-11-30 04:34:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5625 transitions. [2023-11-30 04:34:51,270 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8581235697940504 [2023-11-30 04:34:51,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5625 transitions. [2023-11-30 04:34:51,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5625 transitions. [2023-11-30 04:34:51,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:51,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5625 transitions. [2023-11-30 04:34:51,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1875.0) internal successors, (5625), 3 states have internal predecessors, (5625), 0 states have call successors, (0), 0 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:34:51,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2185.0) internal successors, (8740), 4 states have internal predecessors, (8740), 0 states have call successors, (0), 0 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:34:51,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2185.0) internal successors, (8740), 4 states have internal predecessors, (8740), 0 states have call successors, (0), 0 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:34:51,277 INFO L307 CegarLoopForPetriNet]: 1870 programPoint places, -139 predicate places. [2023-11-30 04:34:51,277 INFO L500 AbstractCegarLoop]: Abstraction has has 1731 places, 1816 transitions, 5994 flow [2023-11-30 04:34:51,278 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1859.6666666666667) internal successors, (5579), 3 states have internal predecessors, (5579), 0 states have call successors, (0), 0 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:34:51,278 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:51,278 INFO L232 CegarLoopForPetriNet]: trace histogram [46, 46, 46, 46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:51,278 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2023-11-30 04:34:51,278 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:51,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash 998321123, now seen corresponding path program 1 times [2023-11-30 04:34:51,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:51,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46051620] [2023-11-30 04:34:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:51,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:34:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:34:51,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:34:51,453 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:34:51,453 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:34:51,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:34:51,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:34:51,454 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2023-11-30 04:34:51,454 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:34:51,454 WARN L227 ceAbstractionStarter]: 45 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:34:51,454 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 46 thread instances. [2023-11-30 04:34:51,603 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:34:51,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1911 places, 2233 transitions, 6720 flow [2023-11-30 04:34:54,399 INFO L124 PetriNetUnfolderBase]: 461/2921 cut-off events. [2023-11-30 04:34:54,399 INFO L125 PetriNetUnfolderBase]: For 17250/17250 co-relation queries the response was YES. [2023-11-30 04:34:54,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4095 conditions, 2921 events. 461/2921 cut-off events. For 17250/17250 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 12245 event pairs, 0 based on Foata normal form. 0/2319 useless extension candidates. Maximal degree in co-relation 3976. Up to 94 conditions per place. [2023-11-30 04:34:54,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 1911 places, 2233 transitions, 6720 flow [2023-11-30 04:34:55,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1911 places, 2233 transitions, 6720 flow [2023-11-30 04:34:55,124 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:34:55,124 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:34:55,124 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:34:55,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:34:55,125 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:34:55,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:34:55,125 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:55,125 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:55,125 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:55,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash -249888810, now seen corresponding path program 1 times [2023-11-30 04:34:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:55,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909202398] [2023-11-30 04:34:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:55,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:55,167 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:34:55,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:55,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909202398] [2023-11-30 04:34:55,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909202398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:55,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:55,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054771072] [2023-11-30 04:34:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:55,168 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:55,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:55,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:55,171 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1898 out of 2233 [2023-11-30 04:34:55,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1911 places, 2233 transitions, 6720 flow. Second operand has 3 states, 3 states have (on average 1900.0) internal successors, (5700), 3 states have internal predecessors, (5700), 0 states have call successors, (0), 0 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:34:55,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:55,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1898 of 2233 [2023-11-30 04:34:55,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:57,375 INFO L124 PetriNetUnfolderBase]: 184/2177 cut-off events. [2023-11-30 04:34:57,375 INFO L125 PetriNetUnfolderBase]: For 17250/17250 co-relation queries the response was YES. [2023-11-30 04:34:57,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 2177 events. 184/2177 cut-off events. For 17250/17250 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8891 event pairs, 0 based on Foata normal form. 14907/16807 useless extension candidates. Maximal degree in co-relation 3385. Up to 141 conditions per place. [2023-11-30 04:34:57,632 INFO L140 encePairwiseOnDemand]: 1999/2233 looper letters, 52 selfloop transitions, 1 changer transitions 0/1857 dead transitions. [2023-11-30 04:34:57,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1768 places, 1857 transitions, 6074 flow [2023-11-30 04:34:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5980 transitions. [2023-11-30 04:34:57,635 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8926705478429616 [2023-11-30 04:34:57,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5980 transitions. [2023-11-30 04:34:57,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5980 transitions. [2023-11-30 04:34:57,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:57,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5980 transitions. [2023-11-30 04:34:57,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1993.3333333333333) internal successors, (5980), 3 states have internal predecessors, (5980), 0 states have call successors, (0), 0 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:34:57,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2233.0) internal successors, (8932), 4 states have internal predecessors, (8932), 0 states have call successors, (0), 0 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:34:57,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2233.0) internal successors, (8932), 4 states have internal predecessors, (8932), 0 states have call successors, (0), 0 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:34:57,642 INFO L307 CegarLoopForPetriNet]: 1911 programPoint places, -143 predicate places. [2023-11-30 04:34:57,642 INFO L500 AbstractCegarLoop]: Abstraction has has 1768 places, 1857 transitions, 6074 flow [2023-11-30 04:34:57,643 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1900.0) internal successors, (5700), 3 states have internal predecessors, (5700), 0 states have call successors, (0), 0 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:34:57,643 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:57,643 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:57,643 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2023-11-30 04:34:57,643 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:34:57,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash -249888809, now seen corresponding path program 1 times [2023-11-30 04:34:57,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:57,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513642069] [2023-11-30 04:34:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:34:57,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:57,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513642069] [2023-11-30 04:34:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513642069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:57,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:57,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:57,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507861616] [2023-11-30 04:34:57,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:57,698 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:57,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:57,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:57,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:57,701 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1899 out of 2233 [2023-11-30 04:34:57,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1768 places, 1857 transitions, 6074 flow. Second operand has 3 states, 3 states have (on average 1900.6666666666667) internal successors, (5702), 3 states have internal predecessors, (5702), 0 states have call successors, (0), 0 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:34:57,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:57,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1899 of 2233 [2023-11-30 04:34:57,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:59,887 INFO L124 PetriNetUnfolderBase]: 184/2130 cut-off events. [2023-11-30 04:34:59,887 INFO L125 PetriNetUnfolderBase]: For 17300/17300 co-relation queries the response was YES. [2023-11-30 04:35:00,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3501 conditions, 2130 events. 184/2130 cut-off events. For 17300/17300 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8552 event pairs, 0 based on Foata normal form. 0/1900 useless extension candidates. Maximal degree in co-relation 3384. Up to 94 conditions per place. [2023-11-30 04:35:00,210 INFO L140 encePairwiseOnDemand]: 2231/2233 looper letters, 50 selfloop transitions, 1 changer transitions 0/1856 dead transitions. [2023-11-30 04:35:00,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1769 places, 1856 transitions, 6172 flow [2023-11-30 04:35:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5749 transitions. [2023-11-30 04:35:00,214 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.858187789222272 [2023-11-30 04:35:00,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5749 transitions. [2023-11-30 04:35:00,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5749 transitions. [2023-11-30 04:35:00,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:00,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5749 transitions. [2023-11-30 04:35:00,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1916.3333333333333) internal successors, (5749), 3 states have internal predecessors, (5749), 0 states have call successors, (0), 0 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:35:00,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2233.0) internal successors, (8932), 4 states have internal predecessors, (8932), 0 states have call successors, (0), 0 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:35:00,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2233.0) internal successors, (8932), 4 states have internal predecessors, (8932), 0 states have call successors, (0), 0 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:35:00,224 INFO L307 CegarLoopForPetriNet]: 1911 programPoint places, -142 predicate places. [2023-11-30 04:35:00,224 INFO L500 AbstractCegarLoop]: Abstraction has has 1769 places, 1856 transitions, 6172 flow [2023-11-30 04:35:00,225 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1900.6666666666667) internal successors, (5702), 3 states have internal predecessors, (5702), 0 states have call successors, (0), 0 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:35:00,225 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:00,225 INFO L232 CegarLoopForPetriNet]: trace histogram [47, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:00,225 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2023-11-30 04:35:00,225 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:00,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1436716267, now seen corresponding path program 1 times [2023-11-30 04:35:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013068615] [2023-11-30 04:35:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:00,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:35:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:00,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:35:00,426 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:35:00,426 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:35:00,426 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:35:00,426 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:35:00,426 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2023-11-30 04:35:00,426 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:35:00,426 WARN L227 ceAbstractionStarter]: 46 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:35:00,427 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 47 thread instances. [2023-11-30 04:35:00,576 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:35:00,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1952 places, 2281 transitions, 6912 flow [2023-11-30 04:35:03,906 INFO L124 PetriNetUnfolderBase]: 471/2984 cut-off events. [2023-11-30 04:35:03,907 INFO L125 PetriNetUnfolderBase]: For 18377/18377 co-relation queries the response was YES. [2023-11-30 04:35:04,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 2984 events. 471/2984 cut-off events. For 18377/18377 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 12491 event pairs, 0 based on Foata normal form. 0/2369 useless extension candidates. Maximal degree in co-relation 4087. Up to 96 conditions per place. [2023-11-30 04:35:04,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 1952 places, 2281 transitions, 6912 flow [2023-11-30 04:35:04,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1952 places, 2281 transitions, 6912 flow [2023-11-30 04:35:04,419 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:35:04,419 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:35:04,419 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:35:04,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:35:04,420 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:35:04,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:35:04,420 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:04,420 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:04,421 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:04,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:04,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1322980865, now seen corresponding path program 1 times [2023-11-30 04:35:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:04,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971895921] [2023-11-30 04:35:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:04,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:04,472 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:35:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971895921] [2023-11-30 04:35:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971895921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991889119] [2023-11-30 04:35:04,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:04,472 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:04,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:04,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:04,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:04,477 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1939 out of 2281 [2023-11-30 04:35:04,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1952 places, 2281 transitions, 6912 flow. Second operand has 3 states, 3 states have (on average 1941.0) internal successors, (5823), 3 states have internal predecessors, (5823), 0 states have call successors, (0), 0 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:35:04,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:04,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1939 of 2281 [2023-11-30 04:35:04,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:06,892 INFO L124 PetriNetUnfolderBase]: 188/2224 cut-off events. [2023-11-30 04:35:06,892 INFO L125 PetriNetUnfolderBase]: For 18377/18377 co-relation queries the response was YES. [2023-11-30 04:35:07,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 2224 events. 188/2224 cut-off events. For 18377/18377 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9105 event pairs, 0 based on Foata normal form. 15583/17524 useless extension candidates. Maximal degree in co-relation 3483. Up to 144 conditions per place. [2023-11-30 04:35:07,233 INFO L140 encePairwiseOnDemand]: 2042/2281 looper letters, 53 selfloop transitions, 1 changer transitions 0/1897 dead transitions. [2023-11-30 04:35:07,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1806 places, 1897 transitions, 6252 flow [2023-11-30 04:35:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6109 transitions. [2023-11-30 04:35:07,375 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.892737103609528 [2023-11-30 04:35:07,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6109 transitions. [2023-11-30 04:35:07,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6109 transitions. [2023-11-30 04:35:07,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:07,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6109 transitions. [2023-11-30 04:35:07,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2036.3333333333333) internal successors, (6109), 3 states have internal predecessors, (6109), 0 states have call successors, (0), 0 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:35:07,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2281.0) internal successors, (9124), 4 states have internal predecessors, (9124), 0 states have call successors, (0), 0 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:35:07,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2281.0) internal successors, (9124), 4 states have internal predecessors, (9124), 0 states have call successors, (0), 0 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:35:07,389 INFO L307 CegarLoopForPetriNet]: 1952 programPoint places, -146 predicate places. [2023-11-30 04:35:07,389 INFO L500 AbstractCegarLoop]: Abstraction has has 1806 places, 1897 transitions, 6252 flow [2023-11-30 04:35:07,390 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1941.0) internal successors, (5823), 3 states have internal predecessors, (5823), 0 states have call successors, (0), 0 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:35:07,390 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:07,390 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:07,391 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2023-11-30 04:35:07,391 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:07,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:07,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1322980864, now seen corresponding path program 1 times [2023-11-30 04:35:07,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:07,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666176565] [2023-11-30 04:35:07,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:07,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:07,460 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:35:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666176565] [2023-11-30 04:35:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666176565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:07,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922737294] [2023-11-30 04:35:07,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:07,461 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:07,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:07,465 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1940 out of 2281 [2023-11-30 04:35:07,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1806 places, 1897 transitions, 6252 flow. Second operand has 3 states, 3 states have (on average 1941.6666666666667) internal successors, (5825), 3 states have internal predecessors, (5825), 0 states have call successors, (0), 0 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:35:07,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:07,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1940 of 2281 [2023-11-30 04:35:07,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:09,819 INFO L124 PetriNetUnfolderBase]: 188/2176 cut-off events. [2023-11-30 04:35:09,819 INFO L125 PetriNetUnfolderBase]: For 18428/18428 co-relation queries the response was YES. [2023-11-30 04:35:10,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 2176 events. 188/2176 cut-off events. For 18428/18428 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8739 event pairs, 0 based on Foata normal form. 0/1941 useless extension candidates. Maximal degree in co-relation 3482. Up to 96 conditions per place. [2023-11-30 04:35:10,063 INFO L140 encePairwiseOnDemand]: 2279/2281 looper letters, 51 selfloop transitions, 1 changer transitions 0/1896 dead transitions. [2023-11-30 04:35:10,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1807 places, 1896 transitions, 6352 flow [2023-11-30 04:35:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5873 transitions. [2023-11-30 04:35:10,066 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8582493058600029 [2023-11-30 04:35:10,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5873 transitions. [2023-11-30 04:35:10,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5873 transitions. [2023-11-30 04:35:10,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:10,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5873 transitions. [2023-11-30 04:35:10,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1957.6666666666667) internal successors, (5873), 3 states have internal predecessors, (5873), 0 states have call successors, (0), 0 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:35:10,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2281.0) internal successors, (9124), 4 states have internal predecessors, (9124), 0 states have call successors, (0), 0 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:35:10,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2281.0) internal successors, (9124), 4 states have internal predecessors, (9124), 0 states have call successors, (0), 0 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:35:10,073 INFO L307 CegarLoopForPetriNet]: 1952 programPoint places, -145 predicate places. [2023-11-30 04:35:10,073 INFO L500 AbstractCegarLoop]: Abstraction has has 1807 places, 1896 transitions, 6352 flow [2023-11-30 04:35:10,074 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1941.6666666666667) internal successors, (5825), 3 states have internal predecessors, (5825), 0 states have call successors, (0), 0 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:35:10,074 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:10,074 INFO L232 CegarLoopForPetriNet]: trace histogram [48, 48, 48, 48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:10,074 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2023-11-30 04:35:10,074 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:10,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash -822784124, now seen corresponding path program 1 times [2023-11-30 04:35:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824520064] [2023-11-30 04:35:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:10,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:35:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:10,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:35:10,241 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:35:10,241 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:35:10,241 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:35:10,242 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:35:10,242 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2023-11-30 04:35:10,242 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:35:10,242 WARN L227 ceAbstractionStarter]: 47 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:35:10,242 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 48 thread instances. [2023-11-30 04:35:10,387 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:35:10,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1993 places, 2329 transitions, 7106 flow [2023-11-30 04:35:13,636 INFO L124 PetriNetUnfolderBase]: 481/3047 cut-off events. [2023-11-30 04:35:13,636 INFO L125 PetriNetUnfolderBase]: For 19552/19552 co-relation queries the response was YES. [2023-11-30 04:35:14,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4320 conditions, 3047 events. 481/3047 cut-off events. For 19552/19552 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 12870 event pairs, 0 based on Foata normal form. 0/2419 useless extension candidates. Maximal degree in co-relation 4199. Up to 98 conditions per place. [2023-11-30 04:35:14,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 1993 places, 2329 transitions, 7106 flow [2023-11-30 04:35:14,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1993 places, 2329 transitions, 7106 flow [2023-11-30 04:35:14,146 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:35:14,147 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:35:14,147 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:35:14,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:35:14,148 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:35:14,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:35:14,148 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:14,148 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:14,148 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:14,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash -627986344, now seen corresponding path program 1 times [2023-11-30 04:35:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283110751] [2023-11-30 04:35:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:14,196 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:35:14,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:14,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283110751] [2023-11-30 04:35:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283110751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:14,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:14,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878530472] [2023-11-30 04:35:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:14,197 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:14,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:14,201 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1980 out of 2329 [2023-11-30 04:35:14,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1993 places, 2329 transitions, 7106 flow. Second operand has 3 states, 3 states have (on average 1982.0) internal successors, (5946), 3 states have internal predecessors, (5946), 0 states have call successors, (0), 0 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:35:14,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:14,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1980 of 2329 [2023-11-30 04:35:14,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:16,703 INFO L124 PetriNetUnfolderBase]: 192/2271 cut-off events. [2023-11-30 04:35:16,703 INFO L125 PetriNetUnfolderBase]: For 19552/19552 co-relation queries the response was YES. [2023-11-30 04:35:16,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3696 conditions, 2271 events. 192/2271 cut-off events. For 19552/19552 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9298 event pairs, 0 based on Foata normal form. 16274/18256 useless extension candidates. Maximal degree in co-relation 3582. Up to 147 conditions per place. [2023-11-30 04:35:17,031 INFO L140 encePairwiseOnDemand]: 2085/2329 looper letters, 54 selfloop transitions, 1 changer transitions 0/1937 dead transitions. [2023-11-30 04:35:17,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1844 places, 1937 transitions, 6432 flow [2023-11-30 04:35:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6238 transitions. [2023-11-30 04:35:17,035 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8928009159868326 [2023-11-30 04:35:17,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6238 transitions. [2023-11-30 04:35:17,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6238 transitions. [2023-11-30 04:35:17,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:17,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6238 transitions. [2023-11-30 04:35:17,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2079.3333333333335) internal successors, (6238), 3 states have internal predecessors, (6238), 0 states have call successors, (0), 0 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:35:17,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2329.0) internal successors, (9316), 4 states have internal predecessors, (9316), 0 states have call successors, (0), 0 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:35:17,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2329.0) internal successors, (9316), 4 states have internal predecessors, (9316), 0 states have call successors, (0), 0 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:35:17,042 INFO L307 CegarLoopForPetriNet]: 1993 programPoint places, -149 predicate places. [2023-11-30 04:35:17,042 INFO L500 AbstractCegarLoop]: Abstraction has has 1844 places, 1937 transitions, 6432 flow [2023-11-30 04:35:17,043 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1982.0) internal successors, (5946), 3 states have internal predecessors, (5946), 0 states have call successors, (0), 0 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:35:17,043 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:17,043 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:17,043 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2023-11-30 04:35:17,043 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:17,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:17,043 INFO L85 PathProgramCache]: Analyzing trace with hash -627986343, now seen corresponding path program 1 times [2023-11-30 04:35:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22676578] [2023-11-30 04:35:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:17,100 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:35:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22676578] [2023-11-30 04:35:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22676578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:17,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802174498] [2023-11-30 04:35:17,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:17,101 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:17,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:17,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:17,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:17,104 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 1981 out of 2329 [2023-11-30 04:35:17,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1844 places, 1937 transitions, 6432 flow. Second operand has 3 states, 3 states have (on average 1982.6666666666667) internal successors, (5948), 3 states have internal predecessors, (5948), 0 states have call successors, (0), 0 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:35:17,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:17,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1981 of 2329 [2023-11-30 04:35:17,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:19,712 INFO L124 PetriNetUnfolderBase]: 192/2222 cut-off events. [2023-11-30 04:35:19,712 INFO L125 PetriNetUnfolderBase]: For 19604/19604 co-relation queries the response was YES. [2023-11-30 04:35:19,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3700 conditions, 2222 events. 192/2222 cut-off events. For 19604/19604 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8919 event pairs, 0 based on Foata normal form. 0/1982 useless extension candidates. Maximal degree in co-relation 3581. Up to 98 conditions per place. [2023-11-30 04:35:19,954 INFO L140 encePairwiseOnDemand]: 2327/2329 looper letters, 52 selfloop transitions, 1 changer transitions 0/1936 dead transitions. [2023-11-30 04:35:19,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1845 places, 1936 transitions, 6534 flow [2023-11-30 04:35:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5997 transitions. [2023-11-30 04:35:19,957 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.858308286818377 [2023-11-30 04:35:19,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5997 transitions. [2023-11-30 04:35:19,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5997 transitions. [2023-11-30 04:35:19,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:19,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5997 transitions. [2023-11-30 04:35:19,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1999.0) internal successors, (5997), 3 states have internal predecessors, (5997), 0 states have call successors, (0), 0 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:35:19,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2329.0) internal successors, (9316), 4 states have internal predecessors, (9316), 0 states have call successors, (0), 0 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:35:19,965 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2329.0) internal successors, (9316), 4 states have internal predecessors, (9316), 0 states have call successors, (0), 0 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:35:19,965 INFO L307 CegarLoopForPetriNet]: 1993 programPoint places, -148 predicate places. [2023-11-30 04:35:19,965 INFO L500 AbstractCegarLoop]: Abstraction has has 1845 places, 1936 transitions, 6534 flow [2023-11-30 04:35:19,966 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1982.6666666666667) internal successors, (5948), 3 states have internal predecessors, (5948), 0 states have call successors, (0), 0 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:35:19,966 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:19,966 INFO L232 CegarLoopForPetriNet]: trace histogram [49, 49, 49, 49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:19,966 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2023-11-30 04:35:19,966 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:19,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1089310184, now seen corresponding path program 1 times [2023-11-30 04:35:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73968141] [2023-11-30 04:35:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:20,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:35:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:20,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:35:20,157 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:35:20,157 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:35:20,157 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:35:20,157 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:35:20,157 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2023-11-30 04:35:20,157 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:35:20,157 WARN L227 ceAbstractionStarter]: 48 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:35:20,157 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 49 thread instances. [2023-11-30 04:35:20,313 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:35:20,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2034 places, 2377 transitions, 7302 flow [2023-11-30 04:35:23,736 INFO L124 PetriNetUnfolderBase]: 491/3110 cut-off events. [2023-11-30 04:35:23,736 INFO L125 PetriNetUnfolderBase]: For 20776/20776 co-relation queries the response was YES. [2023-11-30 04:35:24,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 3110 events. 491/3110 cut-off events. For 20776/20776 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 13065 event pairs, 0 based on Foata normal form. 0/2469 useless extension candidates. Maximal degree in co-relation 4312. Up to 100 conditions per place. [2023-11-30 04:35:24,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 2034 places, 2377 transitions, 7302 flow [2023-11-30 04:35:24,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2034 places, 2377 transitions, 7302 flow [2023-11-30 04:35:24,249 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:35:24,249 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:35:24,249 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:35:24,250 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:35:24,250 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:35:24,250 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:35:24,250 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:24,250 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:24,250 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:24,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1835094753, now seen corresponding path program 1 times [2023-11-30 04:35:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426644184] [2023-11-30 04:35:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:24,300 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:35:24,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:24,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426644184] [2023-11-30 04:35:24,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426644184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:24,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:24,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:24,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555375109] [2023-11-30 04:35:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:24,301 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:24,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:24,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:24,305 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2021 out of 2377 [2023-11-30 04:35:24,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2034 places, 2377 transitions, 7302 flow. Second operand has 3 states, 3 states have (on average 2023.0) internal successors, (6069), 3 states have internal predecessors, (6069), 0 states have call successors, (0), 0 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:35:24,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:24,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2021 of 2377 [2023-11-30 04:35:24,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:26,903 INFO L124 PetriNetUnfolderBase]: 196/2318 cut-off events. [2023-11-30 04:35:26,903 INFO L125 PetriNetUnfolderBase]: For 20776/20776 co-relation queries the response was YES. [2023-11-30 04:35:27,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 2318 events. 196/2318 cut-off events. For 20776/20776 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9496 event pairs, 0 based on Foata normal form. 16980/19003 useless extension candidates. Maximal degree in co-relation 3682. Up to 150 conditions per place. [2023-11-30 04:35:27,253 INFO L140 encePairwiseOnDemand]: 2128/2377 looper letters, 55 selfloop transitions, 1 changer transitions 0/1977 dead transitions. [2023-11-30 04:35:27,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1882 places, 1977 transitions, 6614 flow [2023-11-30 04:35:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6367 transitions. [2023-11-30 04:35:27,256 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8928621511709438 [2023-11-30 04:35:27,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6367 transitions. [2023-11-30 04:35:27,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6367 transitions. [2023-11-30 04:35:27,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:27,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6367 transitions. [2023-11-30 04:35:27,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2122.3333333333335) internal successors, (6367), 3 states have internal predecessors, (6367), 0 states have call successors, (0), 0 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:35:27,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2377.0) internal successors, (9508), 4 states have internal predecessors, (9508), 0 states have call successors, (0), 0 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:35:27,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2377.0) internal successors, (9508), 4 states have internal predecessors, (9508), 0 states have call successors, (0), 0 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:35:27,263 INFO L307 CegarLoopForPetriNet]: 2034 programPoint places, -152 predicate places. [2023-11-30 04:35:27,263 INFO L500 AbstractCegarLoop]: Abstraction has has 1882 places, 1977 transitions, 6614 flow [2023-11-30 04:35:27,264 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2023.0) internal successors, (6069), 3 states have internal predecessors, (6069), 0 states have call successors, (0), 0 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:35:27,264 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:27,264 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:27,264 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2023-11-30 04:35:27,264 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:27,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1835094754, now seen corresponding path program 1 times [2023-11-30 04:35:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:27,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773060924] [2023-11-30 04:35:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:27,520 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:35:27,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773060924] [2023-11-30 04:35:27,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773060924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:27,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:27,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369967219] [2023-11-30 04:35:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:27,527 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:27,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:27,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:27,531 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2022 out of 2377 [2023-11-30 04:35:27,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1882 places, 1977 transitions, 6614 flow. Second operand has 3 states, 3 states have (on average 2023.6666666666667) internal successors, (6071), 3 states have internal predecessors, (6071), 0 states have call successors, (0), 0 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:35:27,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:27,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2022 of 2377 [2023-11-30 04:35:27,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:30,066 INFO L124 PetriNetUnfolderBase]: 196/2268 cut-off events. [2023-11-30 04:35:30,067 INFO L125 PetriNetUnfolderBase]: For 20829/20829 co-relation queries the response was YES. [2023-11-30 04:35:30,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 2268 events. 196/2268 cut-off events. For 20829/20829 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9126 event pairs, 0 based on Foata normal form. 0/2023 useless extension candidates. Maximal degree in co-relation 3681. Up to 100 conditions per place. [2023-11-30 04:35:30,338 INFO L140 encePairwiseOnDemand]: 2375/2377 looper letters, 53 selfloop transitions, 1 changer transitions 0/1976 dead transitions. [2023-11-30 04:35:30,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1883 places, 1976 transitions, 6718 flow [2023-11-30 04:35:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6121 transitions. [2023-11-30 04:35:30,341 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.858364885710279 [2023-11-30 04:35:30,341 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6121 transitions. [2023-11-30 04:35:30,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6121 transitions. [2023-11-30 04:35:30,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:30,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6121 transitions. [2023-11-30 04:35:30,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2040.3333333333333) internal successors, (6121), 3 states have internal predecessors, (6121), 0 states have call successors, (0), 0 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:35:30,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2377.0) internal successors, (9508), 4 states have internal predecessors, (9508), 0 states have call successors, (0), 0 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:35:30,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2377.0) internal successors, (9508), 4 states have internal predecessors, (9508), 0 states have call successors, (0), 0 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:35:30,349 INFO L307 CegarLoopForPetriNet]: 2034 programPoint places, -151 predicate places. [2023-11-30 04:35:30,349 INFO L500 AbstractCegarLoop]: Abstraction has has 1883 places, 1976 transitions, 6718 flow [2023-11-30 04:35:30,350 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2023.6666666666667) internal successors, (6071), 3 states have internal predecessors, (6071), 0 states have call successors, (0), 0 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:35:30,350 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:30,350 INFO L232 CegarLoopForPetriNet]: trace histogram [50, 50, 50, 50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:30,350 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2023-11-30 04:35:30,350 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:30,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1036615909, now seen corresponding path program 1 times [2023-11-30 04:35:30,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:30,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502966721] [2023-11-30 04:35:30,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:30,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:35:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:30,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:35:30,565 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:35:30,565 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:35:30,565 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:35:30,565 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:35:30,565 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2023-11-30 04:35:30,565 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:35:30,566 WARN L227 ceAbstractionStarter]: 49 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:35:30,566 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 50 thread instances. [2023-11-30 04:35:30,733 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:35:30,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2075 places, 2425 transitions, 7500 flow [2023-11-30 04:35:34,214 INFO L124 PetriNetUnfolderBase]: 501/3173 cut-off events. [2023-11-30 04:35:34,215 INFO L125 PetriNetUnfolderBase]: For 22050/22050 co-relation queries the response was YES. [2023-11-30 04:35:34,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 3173 events. 501/3173 cut-off events. For 22050/22050 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 13371 event pairs, 0 based on Foata normal form. 0/2519 useless extension candidates. Maximal degree in co-relation 4426. Up to 102 conditions per place. [2023-11-30 04:35:34,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 2075 places, 2425 transitions, 7500 flow [2023-11-30 04:35:34,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2075 places, 2425 transitions, 7500 flow [2023-11-30 04:35:34,795 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:35:34,795 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:35:34,795 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:35:34,796 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:35:34,796 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:35:34,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:35:34,796 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:34,796 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:34,796 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:34,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:34,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1771295130, now seen corresponding path program 1 times [2023-11-30 04:35:34,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192150948] [2023-11-30 04:35:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:34,854 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:35:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:34,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192150948] [2023-11-30 04:35:34,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192150948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:34,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:34,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838482360] [2023-11-30 04:35:34,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:34,855 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:34,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:34,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:34,860 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2062 out of 2425 [2023-11-30 04:35:34,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2075 places, 2425 transitions, 7500 flow. Second operand has 3 states, 3 states have (on average 2064.0) internal successors, (6192), 3 states have internal predecessors, (6192), 0 states have call successors, (0), 0 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:35:34,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:34,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2062 of 2425 [2023-11-30 04:35:34,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:37,897 INFO L124 PetriNetUnfolderBase]: 200/2365 cut-off events. [2023-11-30 04:35:37,897 INFO L125 PetriNetUnfolderBase]: For 22050/22050 co-relation queries the response was YES. [2023-11-30 04:35:38,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 2365 events. 200/2365 cut-off events. For 22050/22050 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9690 event pairs, 0 based on Foata normal form. 17701/19765 useless extension candidates. Maximal degree in co-relation 3783. Up to 153 conditions per place. [2023-11-30 04:35:38,187 INFO L140 encePairwiseOnDemand]: 2171/2425 looper letters, 56 selfloop transitions, 1 changer transitions 0/2017 dead transitions. [2023-11-30 04:35:38,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1920 places, 2017 transitions, 6798 flow [2023-11-30 04:35:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6496 transitions. [2023-11-30 04:35:38,191 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8929209621993127 [2023-11-30 04:35:38,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6496 transitions. [2023-11-30 04:35:38,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6496 transitions. [2023-11-30 04:35:38,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:38,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6496 transitions. [2023-11-30 04:35:38,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2165.3333333333335) internal successors, (6496), 3 states have internal predecessors, (6496), 0 states have call successors, (0), 0 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:35:38,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2425.0) internal successors, (9700), 4 states have internal predecessors, (9700), 0 states have call successors, (0), 0 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:35:38,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2425.0) internal successors, (9700), 4 states have internal predecessors, (9700), 0 states have call successors, (0), 0 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:35:38,202 INFO L307 CegarLoopForPetriNet]: 2075 programPoint places, -155 predicate places. [2023-11-30 04:35:38,202 INFO L500 AbstractCegarLoop]: Abstraction has has 1920 places, 2017 transitions, 6798 flow [2023-11-30 04:35:38,203 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2064.0) internal successors, (6192), 3 states have internal predecessors, (6192), 0 states have call successors, (0), 0 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:35:38,203 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:38,203 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:38,203 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2023-11-30 04:35:38,203 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:38,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1771295131, now seen corresponding path program 1 times [2023-11-30 04:35:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:38,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266512102] [2023-11-30 04:35:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:38,257 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:35:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266512102] [2023-11-30 04:35:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266512102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:38,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:38,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:38,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877405251] [2023-11-30 04:35:38,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:38,258 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:38,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:38,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:38,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:38,261 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2063 out of 2425 [2023-11-30 04:35:38,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1920 places, 2017 transitions, 6798 flow. Second operand has 3 states, 3 states have (on average 2064.6666666666665) internal successors, (6194), 3 states have internal predecessors, (6194), 0 states have call successors, (0), 0 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:35:38,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:38,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2063 of 2425 [2023-11-30 04:35:38,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:40,774 INFO L124 PetriNetUnfolderBase]: 200/2314 cut-off events. [2023-11-30 04:35:40,775 INFO L125 PetriNetUnfolderBase]: For 22104/22104 co-relation queries the response was YES. [2023-11-30 04:35:41,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3903 conditions, 2314 events. 200/2314 cut-off events. For 22104/22104 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9304 event pairs, 0 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 3782. Up to 102 conditions per place. [2023-11-30 04:35:41,132 INFO L140 encePairwiseOnDemand]: 2423/2425 looper letters, 54 selfloop transitions, 1 changer transitions 0/2016 dead transitions. [2023-11-30 04:35:41,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1921 places, 2016 transitions, 6904 flow [2023-11-30 04:35:41,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6245 transitions. [2023-11-30 04:35:41,149 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8584192439862542 [2023-11-30 04:35:41,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6245 transitions. [2023-11-30 04:35:41,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6245 transitions. [2023-11-30 04:35:41,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:41,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6245 transitions. [2023-11-30 04:35:41,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2081.6666666666665) internal successors, (6245), 3 states have internal predecessors, (6245), 0 states have call successors, (0), 0 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:35:41,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2425.0) internal successors, (9700), 4 states have internal predecessors, (9700), 0 states have call successors, (0), 0 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:35:41,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2425.0) internal successors, (9700), 4 states have internal predecessors, (9700), 0 states have call successors, (0), 0 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:35:41,157 INFO L307 CegarLoopForPetriNet]: 2075 programPoint places, -154 predicate places. [2023-11-30 04:35:41,157 INFO L500 AbstractCegarLoop]: Abstraction has has 1921 places, 2016 transitions, 6904 flow [2023-11-30 04:35:41,158 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2064.6666666666665) internal successors, (6194), 3 states have internal predecessors, (6194), 0 states have call successors, (0), 0 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:35:41,158 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:41,158 INFO L232 CegarLoopForPetriNet]: trace histogram [51, 51, 51, 51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:41,158 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2023-11-30 04:35:41,158 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:41,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1568184805, now seen corresponding path program 1 times [2023-11-30 04:35:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717663769] [2023-11-30 04:35:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:41,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:41,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:35:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:41,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:35:41,552 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:35:41,552 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:35:41,552 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:35:41,553 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:35:41,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2023-11-30 04:35:41,553 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:35:41,553 WARN L227 ceAbstractionStarter]: 50 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:35:41,553 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 51 thread instances. [2023-11-30 04:35:41,712 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:35:41,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2116 places, 2473 transitions, 7700 flow [2023-11-30 04:35:45,335 INFO L124 PetriNetUnfolderBase]: 511/3236 cut-off events. [2023-11-30 04:35:45,336 INFO L125 PetriNetUnfolderBase]: For 23375/23375 co-relation queries the response was YES. [2023-11-30 04:35:45,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 3236 events. 511/3236 cut-off events. For 23375/23375 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 13593 event pairs, 0 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 4541. Up to 104 conditions per place. [2023-11-30 04:35:45,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 2116 places, 2473 transitions, 7700 flow [2023-11-30 04:35:45,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2116 places, 2473 transitions, 7700 flow [2023-11-30 04:35:45,856 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:35:45,856 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:35:45,856 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:35:45,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:35:45,857 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:35:45,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:35:45,858 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:45,858 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:45,858 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:45,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash -819385213, now seen corresponding path program 1 times [2023-11-30 04:35:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162041076] [2023-11-30 04:35:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:45,913 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:35:45,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:45,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162041076] [2023-11-30 04:35:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162041076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:45,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317295441] [2023-11-30 04:35:45,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:45,914 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:45,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:45,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:45,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:45,917 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2103 out of 2473 [2023-11-30 04:35:45,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2116 places, 2473 transitions, 7700 flow. Second operand has 3 states, 3 states have (on average 2105.0) internal successors, (6315), 3 states have internal predecessors, (6315), 0 states have call successors, (0), 0 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:35:45,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:45,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2103 of 2473 [2023-11-30 04:35:45,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:48,884 INFO L124 PetriNetUnfolderBase]: 204/2412 cut-off events. [2023-11-30 04:35:48,885 INFO L125 PetriNetUnfolderBase]: For 23375/23375 co-relation queries the response was YES. [2023-11-30 04:35:49,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 2412 events. 204/2412 cut-off events. For 23375/23375 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9897 event pairs, 0 based on Foata normal form. 18437/20542 useless extension candidates. Maximal degree in co-relation 3885. Up to 156 conditions per place. [2023-11-30 04:35:49,420 INFO L140 encePairwiseOnDemand]: 2214/2473 looper letters, 57 selfloop transitions, 1 changer transitions 0/2057 dead transitions. [2023-11-30 04:35:49,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1958 places, 2057 transitions, 6984 flow [2023-11-30 04:35:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6625 transitions. [2023-11-30 04:35:49,424 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8929774902277935 [2023-11-30 04:35:49,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6625 transitions. [2023-11-30 04:35:49,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6625 transitions. [2023-11-30 04:35:49,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:49,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6625 transitions. [2023-11-30 04:35:49,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2208.3333333333335) internal successors, (6625), 3 states have internal predecessors, (6625), 0 states have call successors, (0), 0 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:35:49,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2473.0) internal successors, (9892), 4 states have internal predecessors, (9892), 0 states have call successors, (0), 0 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:35:49,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2473.0) internal successors, (9892), 4 states have internal predecessors, (9892), 0 states have call successors, (0), 0 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:35:49,431 INFO L307 CegarLoopForPetriNet]: 2116 programPoint places, -158 predicate places. [2023-11-30 04:35:49,431 INFO L500 AbstractCegarLoop]: Abstraction has has 1958 places, 2057 transitions, 6984 flow [2023-11-30 04:35:49,432 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2105.0) internal successors, (6315), 3 states have internal predecessors, (6315), 0 states have call successors, (0), 0 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:35:49,432 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:49,432 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:49,432 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2023-11-30 04:35:49,432 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:49,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -819385212, now seen corresponding path program 1 times [2023-11-30 04:35:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:49,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682709668] [2023-11-30 04:35:49,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:49,495 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:35:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682709668] [2023-11-30 04:35:49,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682709668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:49,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:49,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:49,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104138876] [2023-11-30 04:35:49,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:49,496 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:49,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:49,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:49,499 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2104 out of 2473 [2023-11-30 04:35:49,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1958 places, 2057 transitions, 6984 flow. Second operand has 3 states, 3 states have (on average 2105.6666666666665) internal successors, (6317), 3 states have internal predecessors, (6317), 0 states have call successors, (0), 0 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:35:49,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:49,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2104 of 2473 [2023-11-30 04:35:49,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:52,412 INFO L124 PetriNetUnfolderBase]: 204/2360 cut-off events. [2023-11-30 04:35:52,412 INFO L125 PetriNetUnfolderBase]: For 23430/23430 co-relation queries the response was YES. [2023-11-30 04:35:52,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 2360 events. 204/2360 cut-off events. For 23430/23430 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9507 event pairs, 0 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 3884. Up to 104 conditions per place. [2023-11-30 04:35:52,753 INFO L140 encePairwiseOnDemand]: 2471/2473 looper letters, 55 selfloop transitions, 1 changer transitions 0/2056 dead transitions. [2023-11-30 04:35:52,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1959 places, 2056 transitions, 7092 flow [2023-11-30 04:35:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6369 transitions. [2023-11-30 04:35:52,756 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8584714921148403 [2023-11-30 04:35:52,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6369 transitions. [2023-11-30 04:35:52,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6369 transitions. [2023-11-30 04:35:52,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:52,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6369 transitions. [2023-11-30 04:35:52,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2123.0) internal successors, (6369), 3 states have internal predecessors, (6369), 0 states have call successors, (0), 0 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:35:52,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2473.0) internal successors, (9892), 4 states have internal predecessors, (9892), 0 states have call successors, (0), 0 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:35:52,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2473.0) internal successors, (9892), 4 states have internal predecessors, (9892), 0 states have call successors, (0), 0 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:35:52,764 INFO L307 CegarLoopForPetriNet]: 2116 programPoint places, -157 predicate places. [2023-11-30 04:35:52,764 INFO L500 AbstractCegarLoop]: Abstraction has has 1959 places, 2056 transitions, 7092 flow [2023-11-30 04:35:52,765 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2105.6666666666665) internal successors, (6317), 3 states have internal predecessors, (6317), 0 states have call successors, (0), 0 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:35:52,765 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:52,765 INFO L232 CegarLoopForPetriNet]: trace histogram [52, 52, 52, 52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:52,765 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2023-11-30 04:35:52,765 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:52,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1935157254, now seen corresponding path program 1 times [2023-11-30 04:35:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996628107] [2023-11-30 04:35:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:52,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:52,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:35:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:53,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:35:53,021 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:35:53,021 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:35:53,021 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:35:53,021 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:35:53,021 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2023-11-30 04:35:53,021 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:35:53,022 WARN L227 ceAbstractionStarter]: 51 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:35:53,022 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 52 thread instances. [2023-11-30 04:35:53,371 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:35:53,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2157 places, 2521 transitions, 7902 flow [2023-11-30 04:35:57,117 INFO L124 PetriNetUnfolderBase]: 521/3299 cut-off events. [2023-11-30 04:35:57,117 INFO L125 PetriNetUnfolderBase]: For 24752/24752 co-relation queries the response was YES. [2023-11-30 04:35:57,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 3299 events. 521/3299 cut-off events. For 24752/24752 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 13893 event pairs, 0 based on Foata normal form. 0/2619 useless extension candidates. Maximal degree in co-relation 4657. Up to 106 conditions per place. [2023-11-30 04:35:57,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 2157 places, 2521 transitions, 7902 flow [2023-11-30 04:35:57,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2157 places, 2521 transitions, 7902 flow [2023-11-30 04:35:57,645 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:35:57,646 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:35:57,646 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:35:57,648 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:35:57,648 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:35:57,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:35:57,648 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:57,648 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:57,648 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:35:57,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1641978980, now seen corresponding path program 1 times [2023-11-30 04:35:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:57,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221825510] [2023-11-30 04:35:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:57,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:57,714 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:35:57,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221825510] [2023-11-30 04:35:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221825510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:57,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458736149] [2023-11-30 04:35:57,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:57,715 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:57,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:57,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:57,720 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2144 out of 2521 [2023-11-30 04:35:57,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2157 places, 2521 transitions, 7902 flow. Second operand has 3 states, 3 states have (on average 2146.0) internal successors, (6438), 3 states have internal predecessors, (6438), 0 states have call successors, (0), 0 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:35:57,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:57,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2144 of 2521 [2023-11-30 04:35:57,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:00,768 INFO L124 PetriNetUnfolderBase]: 208/2459 cut-off events. [2023-11-30 04:36:00,768 INFO L125 PetriNetUnfolderBase]: For 24752/24752 co-relation queries the response was YES. [2023-11-30 04:36:01,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 2459 events. 208/2459 cut-off events. For 24752/24752 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10081 event pairs, 0 based on Foata normal form. 19188/21334 useless extension candidates. Maximal degree in co-relation 3988. Up to 159 conditions per place. [2023-11-30 04:36:01,048 INFO L140 encePairwiseOnDemand]: 2257/2521 looper letters, 58 selfloop transitions, 1 changer transitions 0/2097 dead transitions. [2023-11-30 04:36:01,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1996 places, 2097 transitions, 7172 flow [2023-11-30 04:36:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6754 transitions. [2023-11-30 04:36:01,051 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8930318656617744 [2023-11-30 04:36:01,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6754 transitions. [2023-11-30 04:36:01,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6754 transitions. [2023-11-30 04:36:01,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:01,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6754 transitions. [2023-11-30 04:36:01,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2251.3333333333335) internal successors, (6754), 3 states have internal predecessors, (6754), 0 states have call successors, (0), 0 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:36:01,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2521.0) internal successors, (10084), 4 states have internal predecessors, (10084), 0 states have call successors, (0), 0 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:36:01,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2521.0) internal successors, (10084), 4 states have internal predecessors, (10084), 0 states have call successors, (0), 0 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:36:01,059 INFO L307 CegarLoopForPetriNet]: 2157 programPoint places, -161 predicate places. [2023-11-30 04:36:01,059 INFO L500 AbstractCegarLoop]: Abstraction has has 1996 places, 2097 transitions, 7172 flow [2023-11-30 04:36:01,060 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2146.0) internal successors, (6438), 3 states have internal predecessors, (6438), 0 states have call successors, (0), 0 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:36:01,060 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:01,060 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:01,060 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2023-11-30 04:36:01,060 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:01,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1641978979, now seen corresponding path program 1 times [2023-11-30 04:36:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:01,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397415725] [2023-11-30 04:36:01,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:01,123 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:36:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397415725] [2023-11-30 04:36:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397415725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947111825] [2023-11-30 04:36:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:01,124 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:01,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:01,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:01,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:01,127 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2145 out of 2521 [2023-11-30 04:36:01,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1996 places, 2097 transitions, 7172 flow. Second operand has 3 states, 3 states have (on average 2146.6666666666665) internal successors, (6440), 3 states have internal predecessors, (6440), 0 states have call successors, (0), 0 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:36:01,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:01,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2145 of 2521 [2023-11-30 04:36:01,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:03,931 INFO L124 PetriNetUnfolderBase]: 208/2406 cut-off events. [2023-11-30 04:36:03,931 INFO L125 PetriNetUnfolderBase]: For 24808/24808 co-relation queries the response was YES. [2023-11-30 04:36:04,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 2406 events. 208/2406 cut-off events. For 24808/24808 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9700 event pairs, 0 based on Foata normal form. 0/2146 useless extension candidates. Maximal degree in co-relation 3987. Up to 106 conditions per place. [2023-11-30 04:36:04,290 INFO L140 encePairwiseOnDemand]: 2519/2521 looper letters, 56 selfloop transitions, 1 changer transitions 0/2096 dead transitions. [2023-11-30 04:36:04,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1997 places, 2096 transitions, 7282 flow [2023-11-30 04:36:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6493 transitions. [2023-11-30 04:36:04,293 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8585217506280577 [2023-11-30 04:36:04,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6493 transitions. [2023-11-30 04:36:04,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6493 transitions. [2023-11-30 04:36:04,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:04,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6493 transitions. [2023-11-30 04:36:04,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2164.3333333333335) internal successors, (6493), 3 states have internal predecessors, (6493), 0 states have call successors, (0), 0 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:36:04,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2521.0) internal successors, (10084), 4 states have internal predecessors, (10084), 0 states have call successors, (0), 0 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:36:04,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2521.0) internal successors, (10084), 4 states have internal predecessors, (10084), 0 states have call successors, (0), 0 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:36:04,301 INFO L307 CegarLoopForPetriNet]: 2157 programPoint places, -160 predicate places. [2023-11-30 04:36:04,301 INFO L500 AbstractCegarLoop]: Abstraction has has 1997 places, 2096 transitions, 7282 flow [2023-11-30 04:36:04,302 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2146.6666666666665) internal successors, (6440), 3 states have internal predecessors, (6440), 0 states have call successors, (0), 0 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:36:04,302 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:04,302 INFO L232 CegarLoopForPetriNet]: trace histogram [53, 53, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,302 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2023-11-30 04:36:04,302 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:04,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1623673058, now seen corresponding path program 1 times [2023-11-30 04:36:04,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:04,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017192969] [2023-11-30 04:36:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:04,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:04,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:36:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:04,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:36:04,519 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:36:04,519 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:36:04,519 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:36:04,519 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:36:04,519 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2023-11-30 04:36:04,519 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:36:04,520 WARN L227 ceAbstractionStarter]: 52 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:36:04,520 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 53 thread instances. [2023-11-30 04:36:04,929 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:36:04,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2198 places, 2569 transitions, 8106 flow [2023-11-30 04:36:08,881 INFO L124 PetriNetUnfolderBase]: 531/3362 cut-off events. [2023-11-30 04:36:08,881 INFO L125 PetriNetUnfolderBase]: For 26182/26182 co-relation queries the response was YES. [2023-11-30 04:36:09,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4900 conditions, 3362 events. 531/3362 cut-off events. For 26182/26182 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 14141 event pairs, 0 based on Foata normal form. 0/2669 useless extension candidates. Maximal degree in co-relation 4774. Up to 108 conditions per place. [2023-11-30 04:36:09,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 2198 places, 2569 transitions, 8106 flow [2023-11-30 04:36:09,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2198 places, 2569 transitions, 8106 flow [2023-11-30 04:36:09,463 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:36:09,463 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:36:09,463 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:36:09,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:36:09,464 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:36:09,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:09,464 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:09,465 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:09,465 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:09,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -696486171, now seen corresponding path program 1 times [2023-11-30 04:36:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:09,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642377656] [2023-11-30 04:36:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:09,515 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:36:09,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642377656] [2023-11-30 04:36:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642377656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936905700] [2023-11-30 04:36:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:09,515 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:09,520 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2185 out of 2569 [2023-11-30 04:36:09,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2198 places, 2569 transitions, 8106 flow. Second operand has 3 states, 3 states have (on average 2187.0) internal successors, (6561), 3 states have internal predecessors, (6561), 0 states have call successors, (0), 0 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:36:09,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:09,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2185 of 2569 [2023-11-30 04:36:09,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:12,880 INFO L124 PetriNetUnfolderBase]: 212/2506 cut-off events. [2023-11-30 04:36:12,881 INFO L125 PetriNetUnfolderBase]: For 26182/26182 co-relation queries the response was YES. [2023-11-30 04:36:13,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 2506 events. 212/2506 cut-off events. For 26182/26182 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10212 event pairs, 0 based on Foata normal form. 19954/22141 useless extension candidates. Maximal degree in co-relation 4092. Up to 162 conditions per place. [2023-11-30 04:36:13,215 INFO L140 encePairwiseOnDemand]: 2300/2569 looper letters, 59 selfloop transitions, 1 changer transitions 0/2137 dead transitions. [2023-11-30 04:36:13,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2034 places, 2137 transitions, 7362 flow [2023-11-30 04:36:13,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6883 transitions. [2023-11-30 04:36:13,219 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8930842091605035 [2023-11-30 04:36:13,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6883 transitions. [2023-11-30 04:36:13,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6883 transitions. [2023-11-30 04:36:13,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:13,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6883 transitions. [2023-11-30 04:36:13,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2294.3333333333335) internal successors, (6883), 3 states have internal predecessors, (6883), 0 states have call successors, (0), 0 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:36:13,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2569.0) internal successors, (10276), 4 states have internal predecessors, (10276), 0 states have call successors, (0), 0 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:36:13,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2569.0) internal successors, (10276), 4 states have internal predecessors, (10276), 0 states have call successors, (0), 0 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:36:13,227 INFO L307 CegarLoopForPetriNet]: 2198 programPoint places, -164 predicate places. [2023-11-30 04:36:13,227 INFO L500 AbstractCegarLoop]: Abstraction has has 2034 places, 2137 transitions, 7362 flow [2023-11-30 04:36:13,227 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2187.0) internal successors, (6561), 3 states have internal predecessors, (6561), 0 states have call successors, (0), 0 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:36:13,228 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:13,228 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:13,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2023-11-30 04:36:13,228 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:13,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash -696486170, now seen corresponding path program 1 times [2023-11-30 04:36:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:13,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721540071] [2023-11-30 04:36:13,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:13,283 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:36:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721540071] [2023-11-30 04:36:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721540071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775279658] [2023-11-30 04:36:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:13,283 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:13,287 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2186 out of 2569 [2023-11-30 04:36:13,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2034 places, 2137 transitions, 7362 flow. Second operand has 3 states, 3 states have (on average 2187.6666666666665) internal successors, (6563), 3 states have internal predecessors, (6563), 0 states have call successors, (0), 0 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:36:13,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:13,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2186 of 2569 [2023-11-30 04:36:13,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:16,170 INFO L124 PetriNetUnfolderBase]: 212/2452 cut-off events. [2023-11-30 04:36:16,170 INFO L125 PetriNetUnfolderBase]: For 26239/26239 co-relation queries the response was YES. [2023-11-30 04:36:16,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 2452 events. 212/2452 cut-off events. For 26239/26239 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 9879 event pairs, 0 based on Foata normal form. 0/2187 useless extension candidates. Maximal degree in co-relation 4091. Up to 108 conditions per place. [2023-11-30 04:36:16,479 INFO L140 encePairwiseOnDemand]: 2567/2569 looper letters, 57 selfloop transitions, 1 changer transitions 0/2136 dead transitions. [2023-11-30 04:36:16,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2035 places, 2136 transitions, 7474 flow [2023-11-30 04:36:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6617 transitions. [2023-11-30 04:36:16,482 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.858570131049695 [2023-11-30 04:36:16,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6617 transitions. [2023-11-30 04:36:16,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6617 transitions. [2023-11-30 04:36:16,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:16,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6617 transitions. [2023-11-30 04:36:16,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2205.6666666666665) internal successors, (6617), 3 states have internal predecessors, (6617), 0 states have call successors, (0), 0 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:36:16,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2569.0) internal successors, (10276), 4 states have internal predecessors, (10276), 0 states have call successors, (0), 0 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:36:16,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2569.0) internal successors, (10276), 4 states have internal predecessors, (10276), 0 states have call successors, (0), 0 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:36:16,490 INFO L307 CegarLoopForPetriNet]: 2198 programPoint places, -163 predicate places. [2023-11-30 04:36:16,490 INFO L500 AbstractCegarLoop]: Abstraction has has 2035 places, 2136 transitions, 7474 flow [2023-11-30 04:36:16,491 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2187.6666666666665) internal successors, (6563), 3 states have internal predecessors, (6563), 0 states have call successors, (0), 0 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:36:16,491 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:16,491 INFO L232 CegarLoopForPetriNet]: trace histogram [54, 54, 54, 54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:16,491 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2023-11-30 04:36:16,491 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:16,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1786794777, now seen corresponding path program 1 times [2023-11-30 04:36:16,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:16,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487468945] [2023-11-30 04:36:16,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:16,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:36:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:16,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:36:16,721 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:36:16,721 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:36:16,721 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:36:16,721 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:36:16,721 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2023-11-30 04:36:16,722 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:36:16,722 WARN L227 ceAbstractionStarter]: 53 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:36:16,722 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 54 thread instances. [2023-11-30 04:36:16,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:36:16,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2239 places, 2617 transitions, 8312 flow [2023-11-30 04:36:21,098 INFO L124 PetriNetUnfolderBase]: 541/3425 cut-off events. [2023-11-30 04:36:21,098 INFO L125 PetriNetUnfolderBase]: For 27666/27666 co-relation queries the response was YES. [2023-11-30 04:36:21,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5019 conditions, 3425 events. 541/3425 cut-off events. For 27666/27666 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 14417 event pairs, 0 based on Foata normal form. 0/2719 useless extension candidates. Maximal degree in co-relation 4892. Up to 110 conditions per place. [2023-11-30 04:36:21,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 2239 places, 2617 transitions, 8312 flow [2023-11-30 04:36:22,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2239 places, 2617 transitions, 8312 flow [2023-11-30 04:36:22,021 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:36:22,021 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:36:22,021 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:36:22,022 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:36:22,022 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:36:22,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:22,023 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:22,023 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:22,023 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:22,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2017093214, now seen corresponding path program 1 times [2023-11-30 04:36:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704237869] [2023-11-30 04:36:22,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:22,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:22,102 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:36:22,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:22,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704237869] [2023-11-30 04:36:22,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704237869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:22,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964113771] [2023-11-30 04:36:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:22,103 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:22,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:22,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:22,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:22,107 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2226 out of 2617 [2023-11-30 04:36:22,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2239 places, 2617 transitions, 8312 flow. Second operand has 3 states, 3 states have (on average 2228.0) internal successors, (6684), 3 states have internal predecessors, (6684), 0 states have call successors, (0), 0 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:36:22,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:22,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2226 of 2617 [2023-11-30 04:36:22,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:25,503 INFO L124 PetriNetUnfolderBase]: 216/2553 cut-off events. [2023-11-30 04:36:25,503 INFO L125 PetriNetUnfolderBase]: For 27666/27666 co-relation queries the response was YES. [2023-11-30 04:36:25,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4317 conditions, 2553 events. 216/2553 cut-off events. For 27666/27666 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10416 event pairs, 0 based on Foata normal form. 20735/22963 useless extension candidates. Maximal degree in co-relation 4197. Up to 165 conditions per place. [2023-11-30 04:36:25,816 INFO L140 encePairwiseOnDemand]: 2343/2617 looper letters, 60 selfloop transitions, 1 changer transitions 0/2177 dead transitions. [2023-11-30 04:36:25,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2072 places, 2177 transitions, 7554 flow [2023-11-30 04:36:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7012 transitions. [2023-11-30 04:36:25,820 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8931346325308878 [2023-11-30 04:36:25,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7012 transitions. [2023-11-30 04:36:25,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7012 transitions. [2023-11-30 04:36:25,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:25,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7012 transitions. [2023-11-30 04:36:25,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2337.3333333333335) internal successors, (7012), 3 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:36:25,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2617.0) internal successors, (10468), 4 states have internal predecessors, (10468), 0 states have call successors, (0), 0 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:36:25,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2617.0) internal successors, (10468), 4 states have internal predecessors, (10468), 0 states have call successors, (0), 0 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:36:25,827 INFO L307 CegarLoopForPetriNet]: 2239 programPoint places, -167 predicate places. [2023-11-30 04:36:25,828 INFO L500 AbstractCegarLoop]: Abstraction has has 2072 places, 2177 transitions, 7554 flow [2023-11-30 04:36:25,828 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2228.0) internal successors, (6684), 3 states have internal predecessors, (6684), 0 states have call successors, (0), 0 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:36:25,828 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:25,828 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:25,828 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2023-11-30 04:36:25,828 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:25,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2017093215, now seen corresponding path program 1 times [2023-11-30 04:36:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:25,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157850676] [2023-11-30 04:36:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:25,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:25,899 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:36:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157850676] [2023-11-30 04:36:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157850676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:25,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524365416] [2023-11-30 04:36:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:25,900 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:25,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:25,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:25,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:25,903 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2227 out of 2617 [2023-11-30 04:36:25,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2072 places, 2177 transitions, 7554 flow. Second operand has 3 states, 3 states have (on average 2228.6666666666665) internal successors, (6686), 3 states have internal predecessors, (6686), 0 states have call successors, (0), 0 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:36:25,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:25,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2227 of 2617 [2023-11-30 04:36:25,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:29,187 INFO L124 PetriNetUnfolderBase]: 216/2498 cut-off events. [2023-11-30 04:36:29,187 INFO L125 PetriNetUnfolderBase]: For 27724/27724 co-relation queries the response was YES. [2023-11-30 04:36:29,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4321 conditions, 2498 events. 216/2498 cut-off events. For 27724/27724 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10072 event pairs, 0 based on Foata normal form. 0/2228 useless extension candidates. Maximal degree in co-relation 4196. Up to 110 conditions per place. [2023-11-30 04:36:29,485 INFO L140 encePairwiseOnDemand]: 2615/2617 looper letters, 58 selfloop transitions, 1 changer transitions 0/2176 dead transitions. [2023-11-30 04:36:29,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2073 places, 2176 transitions, 7668 flow [2023-11-30 04:36:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6741 transitions. [2023-11-30 04:36:29,489 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8586167367214368 [2023-11-30 04:36:29,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6741 transitions. [2023-11-30 04:36:29,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6741 transitions. [2023-11-30 04:36:29,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:29,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6741 transitions. [2023-11-30 04:36:29,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2247.0) internal successors, (6741), 3 states have internal predecessors, (6741), 0 states have call successors, (0), 0 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:36:29,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2617.0) internal successors, (10468), 4 states have internal predecessors, (10468), 0 states have call successors, (0), 0 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:36:29,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2617.0) internal successors, (10468), 4 states have internal predecessors, (10468), 0 states have call successors, (0), 0 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:36:29,497 INFO L307 CegarLoopForPetriNet]: 2239 programPoint places, -166 predicate places. [2023-11-30 04:36:29,497 INFO L500 AbstractCegarLoop]: Abstraction has has 2073 places, 2176 transitions, 7668 flow [2023-11-30 04:36:29,497 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2228.6666666666665) internal successors, (6686), 3 states have internal predecessors, (6686), 0 states have call successors, (0), 0 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:36:29,498 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:29,498 INFO L232 CegarLoopForPetriNet]: trace histogram [55, 55, 55, 55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,498 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2023-11-30 04:36:29,498 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:29,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash 962147039, now seen corresponding path program 1 times [2023-11-30 04:36:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532449432] [2023-11-30 04:36:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:29,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:29,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:36:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:29,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:36:29,745 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:36:29,745 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:36:29,745 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:36:29,745 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:36:29,745 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2023-11-30 04:36:29,746 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:36:29,746 WARN L227 ceAbstractionStarter]: 54 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:36:29,746 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 55 thread instances. [2023-11-30 04:36:29,926 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:36:29,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2280 places, 2665 transitions, 8520 flow [2023-11-30 04:36:34,302 INFO L124 PetriNetUnfolderBase]: 551/3488 cut-off events. [2023-11-30 04:36:34,302 INFO L125 PetriNetUnfolderBase]: For 29205/29205 co-relation queries the response was YES. [2023-11-30 04:36:34,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 3488 events. 551/3488 cut-off events. For 29205/29205 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 14690 event pairs, 0 based on Foata normal form. 0/2769 useless extension candidates. Maximal degree in co-relation 5011. Up to 112 conditions per place. [2023-11-30 04:36:34,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 2280 places, 2665 transitions, 8520 flow [2023-11-30 04:36:35,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2280 places, 2665 transitions, 8520 flow [2023-11-30 04:36:35,063 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:36:35,063 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:36:35,063 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:36:35,065 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:36:35,065 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:36:35,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:35,065 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:35,065 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:35,065 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:35,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2091175417, now seen corresponding path program 1 times [2023-11-30 04:36:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083342817] [2023-11-30 04:36:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:35,324 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:36:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083342817] [2023-11-30 04:36:35,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083342817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:35,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:35,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171495385] [2023-11-30 04:36:35,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:35,325 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:35,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:35,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:35,328 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2267 out of 2665 [2023-11-30 04:36:35,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2280 places, 2665 transitions, 8520 flow. Second operand has 3 states, 3 states have (on average 2269.0) internal successors, (6807), 3 states have internal predecessors, (6807), 0 states have call successors, (0), 0 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:36:35,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:35,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2267 of 2665 [2023-11-30 04:36:35,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:38,898 INFO L124 PetriNetUnfolderBase]: 220/2600 cut-off events. [2023-11-30 04:36:38,898 INFO L125 PetriNetUnfolderBase]: For 29205/29205 co-relation queries the response was YES. [2023-11-30 04:36:39,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4424 conditions, 2600 events. 220/2600 cut-off events. For 29205/29205 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10694 event pairs, 0 based on Foata normal form. 21531/23800 useless extension candidates. Maximal degree in co-relation 4303. Up to 168 conditions per place. [2023-11-30 04:36:39,229 INFO L140 encePairwiseOnDemand]: 2386/2665 looper letters, 61 selfloop transitions, 1 changer transitions 0/2217 dead transitions. [2023-11-30 04:36:39,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2110 places, 2217 transitions, 7748 flow [2023-11-30 04:36:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7141 transitions. [2023-11-30 04:36:39,233 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8931832395247029 [2023-11-30 04:36:39,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7141 transitions. [2023-11-30 04:36:39,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7141 transitions. [2023-11-30 04:36:39,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:39,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7141 transitions. [2023-11-30 04:36:39,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2380.3333333333335) internal successors, (7141), 3 states have internal predecessors, (7141), 0 states have call successors, (0), 0 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:36:39,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2665.0) internal successors, (10660), 4 states have internal predecessors, (10660), 0 states have call successors, (0), 0 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:36:39,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2665.0) internal successors, (10660), 4 states have internal predecessors, (10660), 0 states have call successors, (0), 0 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:36:39,241 INFO L307 CegarLoopForPetriNet]: 2280 programPoint places, -170 predicate places. [2023-11-30 04:36:39,241 INFO L500 AbstractCegarLoop]: Abstraction has has 2110 places, 2217 transitions, 7748 flow [2023-11-30 04:36:39,242 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2269.0) internal successors, (6807), 3 states have internal predecessors, (6807), 0 states have call successors, (0), 0 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:36:39,242 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:39,242 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:39,242 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2023-11-30 04:36:39,242 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:39,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2091175416, now seen corresponding path program 1 times [2023-11-30 04:36:39,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:39,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680043054] [2023-11-30 04:36:39,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:39,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:39,306 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:36:39,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:39,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680043054] [2023-11-30 04:36:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680043054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:39,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432394100] [2023-11-30 04:36:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:39,307 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:39,310 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2268 out of 2665 [2023-11-30 04:36:39,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2110 places, 2217 transitions, 7748 flow. Second operand has 3 states, 3 states have (on average 2269.6666666666665) internal successors, (6809), 3 states have internal predecessors, (6809), 0 states have call successors, (0), 0 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:36:39,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:39,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2268 of 2665 [2023-11-30 04:36:39,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:42,674 INFO L124 PetriNetUnfolderBase]: 220/2544 cut-off events. [2023-11-30 04:36:42,674 INFO L125 PetriNetUnfolderBase]: For 29264/29264 co-relation queries the response was YES. [2023-11-30 04:36:42,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4428 conditions, 2544 events. 220/2544 cut-off events. For 29264/29264 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10270 event pairs, 0 based on Foata normal form. 0/2269 useless extension candidates. Maximal degree in co-relation 4302. Up to 112 conditions per place. [2023-11-30 04:36:43,002 INFO L140 encePairwiseOnDemand]: 2663/2665 looper letters, 59 selfloop transitions, 1 changer transitions 0/2216 dead transitions. [2023-11-30 04:36:43,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2111 places, 2216 transitions, 7864 flow [2023-11-30 04:36:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6865 transitions. [2023-11-30 04:36:43,006 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8586616635397123 [2023-11-30 04:36:43,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6865 transitions. [2023-11-30 04:36:43,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6865 transitions. [2023-11-30 04:36:43,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:43,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6865 transitions. [2023-11-30 04:36:43,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2288.3333333333335) internal successors, (6865), 3 states have internal predecessors, (6865), 0 states have call successors, (0), 0 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:36:43,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2665.0) internal successors, (10660), 4 states have internal predecessors, (10660), 0 states have call successors, (0), 0 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:36:43,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2665.0) internal successors, (10660), 4 states have internal predecessors, (10660), 0 states have call successors, (0), 0 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:36:43,014 INFO L307 CegarLoopForPetriNet]: 2280 programPoint places, -169 predicate places. [2023-11-30 04:36:43,014 INFO L500 AbstractCegarLoop]: Abstraction has has 2111 places, 2216 transitions, 7864 flow [2023-11-30 04:36:43,015 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2269.6666666666665) internal successors, (6809), 3 states have internal predecessors, (6809), 0 states have call successors, (0), 0 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:36:43,015 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:43,015 INFO L232 CegarLoopForPetriNet]: trace histogram [56, 56, 56, 56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:43,015 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2023-11-30 04:36:43,015 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:43,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash -979208312, now seen corresponding path program 1 times [2023-11-30 04:36:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596242558] [2023-11-30 04:36:43,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:43,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:36:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:43,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:36:43,244 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:36:43,244 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:36:43,244 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:36:43,244 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:36:43,244 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2023-11-30 04:36:43,244 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:36:43,245 WARN L227 ceAbstractionStarter]: 55 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:36:43,245 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 56 thread instances. [2023-11-30 04:36:43,439 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:36:43,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2321 places, 2713 transitions, 8730 flow [2023-11-30 04:36:48,211 INFO L124 PetriNetUnfolderBase]: 561/3551 cut-off events. [2023-11-30 04:36:48,211 INFO L125 PetriNetUnfolderBase]: For 30800/30800 co-relation queries the response was YES. [2023-11-30 04:36:48,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 3551 events. 561/3551 cut-off events. For 30800/30800 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 14945 event pairs, 0 based on Foata normal form. 0/2819 useless extension candidates. Maximal degree in co-relation 5131. Up to 114 conditions per place. [2023-11-30 04:36:48,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 2321 places, 2713 transitions, 8730 flow [2023-11-30 04:36:48,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2321 places, 2713 transitions, 8730 flow [2023-11-30 04:36:48,841 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:36:48,841 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:36:48,841 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:36:48,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:36:48,842 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:36:48,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:48,842 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:48,843 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:48,843 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:48,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -136390176, now seen corresponding path program 1 times [2023-11-30 04:36:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086338491] [2023-11-30 04:36:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:48,922 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:36:48,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:48,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086338491] [2023-11-30 04:36:48,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086338491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:48,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:48,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606073068] [2023-11-30 04:36:48,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:48,923 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:48,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:48,926 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2308 out of 2713 [2023-11-30 04:36:48,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2321 places, 2713 transitions, 8730 flow. Second operand has 3 states, 3 states have (on average 2310.0) internal successors, (6930), 3 states have internal predecessors, (6930), 0 states have call successors, (0), 0 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:36:48,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:48,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2308 of 2713 [2023-11-30 04:36:48,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:52,514 INFO L124 PetriNetUnfolderBase]: 224/2647 cut-off events. [2023-11-30 04:36:52,514 INFO L125 PetriNetUnfolderBase]: For 30800/30800 co-relation queries the response was YES. [2023-11-30 04:36:52,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4532 conditions, 2647 events. 224/2647 cut-off events. For 30800/30800 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10804 event pairs, 0 based on Foata normal form. 22342/24652 useless extension candidates. Maximal degree in co-relation 4410. Up to 171 conditions per place. [2023-11-30 04:36:52,922 INFO L140 encePairwiseOnDemand]: 2429/2713 looper letters, 62 selfloop transitions, 1 changer transitions 0/2257 dead transitions. [2023-11-30 04:36:52,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2148 places, 2257 transitions, 7944 flow [2023-11-30 04:36:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7270 transitions. [2023-11-30 04:36:52,926 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8932301265511734 [2023-11-30 04:36:52,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7270 transitions. [2023-11-30 04:36:52,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7270 transitions. [2023-11-30 04:36:52,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:52,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7270 transitions. [2023-11-30 04:36:52,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2423.3333333333335) internal successors, (7270), 3 states have internal predecessors, (7270), 0 states have call successors, (0), 0 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:36:52,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2713.0) internal successors, (10852), 4 states have internal predecessors, (10852), 0 states have call successors, (0), 0 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:36:52,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2713.0) internal successors, (10852), 4 states have internal predecessors, (10852), 0 states have call successors, (0), 0 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:36:52,935 INFO L307 CegarLoopForPetriNet]: 2321 programPoint places, -173 predicate places. [2023-11-30 04:36:52,935 INFO L500 AbstractCegarLoop]: Abstraction has has 2148 places, 2257 transitions, 7944 flow [2023-11-30 04:36:52,936 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2310.0) internal successors, (6930), 3 states have internal predecessors, (6930), 0 states have call successors, (0), 0 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:36:52,936 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:52,936 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:52,936 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2023-11-30 04:36:52,936 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:52,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash -136390175, now seen corresponding path program 1 times [2023-11-30 04:36:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:52,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398615175] [2023-11-30 04:36:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:53,028 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:36:53,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398615175] [2023-11-30 04:36:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398615175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:53,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:53,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:53,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325837747] [2023-11-30 04:36:53,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:53,029 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:53,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:53,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:53,032 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2309 out of 2713 [2023-11-30 04:36:53,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2148 places, 2257 transitions, 7944 flow. Second operand has 3 states, 3 states have (on average 2310.6666666666665) internal successors, (6932), 3 states have internal predecessors, (6932), 0 states have call successors, (0), 0 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:36:53,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:53,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2309 of 2713 [2023-11-30 04:36:53,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:56,502 INFO L124 PetriNetUnfolderBase]: 224/2590 cut-off events. [2023-11-30 04:36:56,502 INFO L125 PetriNetUnfolderBase]: For 30860/30860 co-relation queries the response was YES. [2023-11-30 04:36:56,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4536 conditions, 2590 events. 224/2590 cut-off events. For 30860/30860 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10476 event pairs, 0 based on Foata normal form. 0/2310 useless extension candidates. Maximal degree in co-relation 4409. Up to 114 conditions per place. [2023-11-30 04:36:56,905 INFO L140 encePairwiseOnDemand]: 2711/2713 looper letters, 60 selfloop transitions, 1 changer transitions 0/2256 dead transitions. [2023-11-30 04:36:56,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2149 places, 2256 transitions, 8062 flow [2023-11-30 04:36:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6989 transitions. [2023-11-30 04:36:56,909 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8587050006143261 [2023-11-30 04:36:56,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 6989 transitions. [2023-11-30 04:36:56,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 6989 transitions. [2023-11-30 04:36:56,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:56,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 6989 transitions. [2023-11-30 04:36:56,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2329.6666666666665) internal successors, (6989), 3 states have internal predecessors, (6989), 0 states have call successors, (0), 0 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:36:56,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2713.0) internal successors, (10852), 4 states have internal predecessors, (10852), 0 states have call successors, (0), 0 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:36:56,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2713.0) internal successors, (10852), 4 states have internal predecessors, (10852), 0 states have call successors, (0), 0 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:36:56,918 INFO L307 CegarLoopForPetriNet]: 2321 programPoint places, -172 predicate places. [2023-11-30 04:36:56,918 INFO L500 AbstractCegarLoop]: Abstraction has has 2149 places, 2256 transitions, 8062 flow [2023-11-30 04:36:56,919 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2310.6666666666665) internal successors, (6932), 3 states have internal predecessors, (6932), 0 states have call successors, (0), 0 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:36:56,919 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:56,919 INFO L232 CegarLoopForPetriNet]: trace histogram [57, 57, 57, 57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,919 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2023-11-30 04:36:56,919 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:36:56,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:56,919 INFO L85 PathProgramCache]: Analyzing trace with hash -39194660, now seen corresponding path program 1 times [2023-11-30 04:36:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:56,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376424487] [2023-11-30 04:36:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:56,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:57,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:36:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:57,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:36:57,280 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:36:57,280 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:36:57,280 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:36:57,280 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:36:57,280 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2023-11-30 04:36:57,280 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:36:57,280 WARN L227 ceAbstractionStarter]: 56 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:36:57,280 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 57 thread instances. [2023-11-30 04:36:57,638 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:36:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2362 places, 2761 transitions, 8942 flow [2023-11-30 04:37:02,762 INFO L124 PetriNetUnfolderBase]: 571/3614 cut-off events. [2023-11-30 04:37:02,762 INFO L125 PetriNetUnfolderBase]: For 32452/32452 co-relation queries the response was YES. [2023-11-30 04:37:03,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5382 conditions, 3614 events. 571/3614 cut-off events. For 32452/32452 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 15197 event pairs, 0 based on Foata normal form. 0/2869 useless extension candidates. Maximal degree in co-relation 5252. Up to 116 conditions per place. [2023-11-30 04:37:03,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 2362 places, 2761 transitions, 8942 flow [2023-11-30 04:37:03,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2362 places, 2761 transitions, 8942 flow [2023-11-30 04:37:03,548 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:37:03,548 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:37:03,548 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:37:03,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:37:03,549 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:37:03,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:03,549 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:03,550 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:03,568 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:03,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash -708485655, now seen corresponding path program 1 times [2023-11-30 04:37:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79754414] [2023-11-30 04:37:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:03,649 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:37:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:03,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79754414] [2023-11-30 04:37:03,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79754414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:03,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:03,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992255700] [2023-11-30 04:37:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:03,650 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:03,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:03,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:03,654 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2349 out of 2761 [2023-11-30 04:37:03,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2362 places, 2761 transitions, 8942 flow. Second operand has 3 states, 3 states have (on average 2351.0) internal successors, (7053), 3 states have internal predecessors, (7053), 0 states have call successors, (0), 0 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:37:03,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:03,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2349 of 2761 [2023-11-30 04:37:03,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:07,749 INFO L124 PetriNetUnfolderBase]: 228/2694 cut-off events. [2023-11-30 04:37:07,749 INFO L125 PetriNetUnfolderBase]: For 32452/32452 co-relation queries the response was YES. [2023-11-30 04:37:08,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4641 conditions, 2694 events. 228/2694 cut-off events. For 32452/32452 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11077 event pairs, 0 based on Foata normal form. 23168/25519 useless extension candidates. Maximal degree in co-relation 4518. Up to 174 conditions per place. [2023-11-30 04:37:08,130 INFO L140 encePairwiseOnDemand]: 2472/2761 looper letters, 63 selfloop transitions, 1 changer transitions 0/2297 dead transitions. [2023-11-30 04:37:08,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2186 places, 2297 transitions, 8142 flow [2023-11-30 04:37:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7399 transitions. [2023-11-30 04:37:08,134 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8932753833152239 [2023-11-30 04:37:08,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7399 transitions. [2023-11-30 04:37:08,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7399 transitions. [2023-11-30 04:37:08,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:08,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7399 transitions. [2023-11-30 04:37:08,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2466.3333333333335) internal successors, (7399), 3 states have internal predecessors, (7399), 0 states have call successors, (0), 0 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:37:08,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2761.0) internal successors, (11044), 4 states have internal predecessors, (11044), 0 states have call successors, (0), 0 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:37:08,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2761.0) internal successors, (11044), 4 states have internal predecessors, (11044), 0 states have call successors, (0), 0 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:37:08,142 INFO L307 CegarLoopForPetriNet]: 2362 programPoint places, -176 predicate places. [2023-11-30 04:37:08,142 INFO L500 AbstractCegarLoop]: Abstraction has has 2186 places, 2297 transitions, 8142 flow [2023-11-30 04:37:08,143 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2351.0) internal successors, (7053), 3 states have internal predecessors, (7053), 0 states have call successors, (0), 0 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:37:08,143 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:08,143 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:08,143 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2023-11-30 04:37:08,143 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:08,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash -708485654, now seen corresponding path program 1 times [2023-11-30 04:37:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:08,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541000540] [2023-11-30 04:37:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:08,219 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:37:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541000540] [2023-11-30 04:37:08,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541000540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:08,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100307078] [2023-11-30 04:37:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:08,220 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:08,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:08,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:08,223 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2350 out of 2761 [2023-11-30 04:37:08,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2186 places, 2297 transitions, 8142 flow. Second operand has 3 states, 3 states have (on average 2351.6666666666665) internal successors, (7055), 3 states have internal predecessors, (7055), 0 states have call successors, (0), 0 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:37:08,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:08,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2350 of 2761 [2023-11-30 04:37:08,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:11,795 INFO L124 PetriNetUnfolderBase]: 228/2636 cut-off events. [2023-11-30 04:37:11,795 INFO L125 PetriNetUnfolderBase]: For 32513/32513 co-relation queries the response was YES. [2023-11-30 04:37:12,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 2636 events. 228/2636 cut-off events. For 32513/32513 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10650 event pairs, 0 based on Foata normal form. 0/2351 useless extension candidates. Maximal degree in co-relation 4517. Up to 116 conditions per place. [2023-11-30 04:37:12,200 INFO L140 encePairwiseOnDemand]: 2759/2761 looper letters, 61 selfloop transitions, 1 changer transitions 0/2296 dead transitions. [2023-11-30 04:37:12,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2187 places, 2296 transitions, 8262 flow [2023-11-30 04:37:12,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7113 transitions. [2023-11-30 04:37:12,204 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8587468308583847 [2023-11-30 04:37:12,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7113 transitions. [2023-11-30 04:37:12,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7113 transitions. [2023-11-30 04:37:12,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:12,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7113 transitions. [2023-11-30 04:37:12,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2371.0) internal successors, (7113), 3 states have internal predecessors, (7113), 0 states have call successors, (0), 0 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:37:12,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2761.0) internal successors, (11044), 4 states have internal predecessors, (11044), 0 states have call successors, (0), 0 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:37:12,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2761.0) internal successors, (11044), 4 states have internal predecessors, (11044), 0 states have call successors, (0), 0 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:37:12,213 INFO L307 CegarLoopForPetriNet]: 2362 programPoint places, -175 predicate places. [2023-11-30 04:37:12,213 INFO L500 AbstractCegarLoop]: Abstraction has has 2187 places, 2296 transitions, 8262 flow [2023-11-30 04:37:12,214 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2351.6666666666665) internal successors, (7055), 3 states have internal predecessors, (7055), 0 states have call successors, (0), 0 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:37:12,214 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:12,214 INFO L232 CegarLoopForPetriNet]: trace histogram [58, 58, 58, 58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:12,214 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2023-11-30 04:37:12,214 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:12,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2119766039, now seen corresponding path program 1 times [2023-11-30 04:37:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673469179] [2023-11-30 04:37:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:12,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:37:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:12,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:37:12,539 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:37:12,539 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:37:12,539 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:37:12,539 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:37:12,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2023-11-30 04:37:12,539 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:37:12,539 WARN L227 ceAbstractionStarter]: 57 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:37:12,539 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 58 thread instances. [2023-11-30 04:37:12,759 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:37:12,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2403 places, 2809 transitions, 9156 flow [2023-11-30 04:37:17,634 INFO L124 PetriNetUnfolderBase]: 581/3677 cut-off events. [2023-11-30 04:37:17,635 INFO L125 PetriNetUnfolderBase]: For 34162/34162 co-relation queries the response was YES. [2023-11-30 04:37:18,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 3677 events. 581/3677 cut-off events. For 34162/34162 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 15532 event pairs, 0 based on Foata normal form. 0/2919 useless extension candidates. Maximal degree in co-relation 5374. Up to 118 conditions per place. [2023-11-30 04:37:18,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 2403 places, 2809 transitions, 9156 flow [2023-11-30 04:37:18,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2403 places, 2809 transitions, 9156 flow [2023-11-30 04:37:18,436 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:37:18,436 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:37:18,436 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:37:18,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:37:18,438 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:37:18,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:18,438 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:18,438 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:18,438 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:18,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash 487505442, now seen corresponding path program 1 times [2023-11-30 04:37:18,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:18,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142601478] [2023-11-30 04:37:18,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:18,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:18,503 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:37:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:18,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142601478] [2023-11-30 04:37:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142601478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:18,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386899764] [2023-11-30 04:37:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:18,503 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:18,800 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2390 out of 2809 [2023-11-30 04:37:18,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2403 places, 2809 transitions, 9156 flow. Second operand has 3 states, 3 states have (on average 2392.0) internal successors, (7176), 3 states have internal predecessors, (7176), 0 states have call successors, (0), 0 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:37:18,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:18,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2390 of 2809 [2023-11-30 04:37:18,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:22,660 INFO L124 PetriNetUnfolderBase]: 232/2741 cut-off events. [2023-11-30 04:37:22,660 INFO L125 PetriNetUnfolderBase]: For 34162/34162 co-relation queries the response was YES. [2023-11-30 04:37:23,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4751 conditions, 2741 events. 232/2741 cut-off events. For 34162/34162 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11277 event pairs, 0 based on Foata normal form. 24009/26401 useless extension candidates. Maximal degree in co-relation 4627. Up to 177 conditions per place. [2023-11-30 04:37:23,068 INFO L140 encePairwiseOnDemand]: 2515/2809 looper letters, 64 selfloop transitions, 1 changer transitions 0/2337 dead transitions. [2023-11-30 04:37:23,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2224 places, 2337 transitions, 8342 flow [2023-11-30 04:37:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7528 transitions. [2023-11-30 04:37:23,072 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8933190933902931 [2023-11-30 04:37:23,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7528 transitions. [2023-11-30 04:37:23,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7528 transitions. [2023-11-30 04:37:23,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:23,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7528 transitions. [2023-11-30 04:37:23,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2509.3333333333335) internal successors, (7528), 3 states have internal predecessors, (7528), 0 states have call successors, (0), 0 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:37:23,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2809.0) internal successors, (11236), 4 states have internal predecessors, (11236), 0 states have call successors, (0), 0 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:37:23,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2809.0) internal successors, (11236), 4 states have internal predecessors, (11236), 0 states have call successors, (0), 0 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:37:23,080 INFO L307 CegarLoopForPetriNet]: 2403 programPoint places, -179 predicate places. [2023-11-30 04:37:23,080 INFO L500 AbstractCegarLoop]: Abstraction has has 2224 places, 2337 transitions, 8342 flow [2023-11-30 04:37:23,081 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2392.0) internal successors, (7176), 3 states have internal predecessors, (7176), 0 states have call successors, (0), 0 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:37:23,081 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:23,081 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:23,081 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2023-11-30 04:37:23,081 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:23,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash 487505443, now seen corresponding path program 1 times [2023-11-30 04:37:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927212897] [2023-11-30 04:37:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:23,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:23,149 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:37:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927212897] [2023-11-30 04:37:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927212897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046647824] [2023-11-30 04:37:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:23,149 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:23,153 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2391 out of 2809 [2023-11-30 04:37:23,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2224 places, 2337 transitions, 8342 flow. Second operand has 3 states, 3 states have (on average 2392.6666666666665) internal successors, (7178), 3 states have internal predecessors, (7178), 0 states have call successors, (0), 0 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:37:23,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:23,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2391 of 2809 [2023-11-30 04:37:23,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:26,528 INFO L124 PetriNetUnfolderBase]: 232/2682 cut-off events. [2023-11-30 04:37:26,529 INFO L125 PetriNetUnfolderBase]: For 34224/34224 co-relation queries the response was YES. [2023-11-30 04:37:26,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 2682 events. 232/2682 cut-off events. For 34224/34224 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 10822 event pairs, 0 based on Foata normal form. 0/2392 useless extension candidates. Maximal degree in co-relation 4626. Up to 118 conditions per place. [2023-11-30 04:37:26,967 INFO L140 encePairwiseOnDemand]: 2807/2809 looper letters, 62 selfloop transitions, 1 changer transitions 0/2336 dead transitions. [2023-11-30 04:37:26,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2225 places, 2336 transitions, 8464 flow [2023-11-30 04:37:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7237 transitions. [2023-11-30 04:37:26,971 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8587872315177406 [2023-11-30 04:37:26,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7237 transitions. [2023-11-30 04:37:26,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7237 transitions. [2023-11-30 04:37:26,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:26,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7237 transitions. [2023-11-30 04:37:26,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2412.3333333333335) internal successors, (7237), 3 states have internal predecessors, (7237), 0 states have call successors, (0), 0 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:37:26,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2809.0) internal successors, (11236), 4 states have internal predecessors, (11236), 0 states have call successors, (0), 0 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:37:26,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2809.0) internal successors, (11236), 4 states have internal predecessors, (11236), 0 states have call successors, (0), 0 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:37:26,979 INFO L307 CegarLoopForPetriNet]: 2403 programPoint places, -178 predicate places. [2023-11-30 04:37:26,979 INFO L500 AbstractCegarLoop]: Abstraction has has 2225 places, 2336 transitions, 8464 flow [2023-11-30 04:37:26,980 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2392.6666666666665) internal successors, (7178), 3 states have internal predecessors, (7178), 0 states have call successors, (0), 0 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:37:26,980 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:26,980 INFO L232 CegarLoopForPetriNet]: trace histogram [59, 59, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:26,980 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2023-11-30 04:37:26,980 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:26,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 993073113, now seen corresponding path program 1 times [2023-11-30 04:37:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:26,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031284206] [2023-11-30 04:37:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:27,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:37:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:27,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:37:27,549 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:37:27,549 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:37:27,549 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:37:27,549 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:37:27,550 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2023-11-30 04:37:27,550 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:37:27,550 WARN L227 ceAbstractionStarter]: 58 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:37:27,550 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 59 thread instances. [2023-11-30 04:37:27,812 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:37:27,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2444 places, 2857 transitions, 9372 flow [2023-11-30 04:37:32,937 INFO L124 PetriNetUnfolderBase]: 591/3740 cut-off events. [2023-11-30 04:37:32,937 INFO L125 PetriNetUnfolderBase]: For 35931/35931 co-relation queries the response was YES. [2023-11-30 04:37:33,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5629 conditions, 3740 events. 591/3740 cut-off events. For 35931/35931 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 15743 event pairs, 0 based on Foata normal form. 0/2969 useless extension candidates. Maximal degree in co-relation 5497. Up to 120 conditions per place. [2023-11-30 04:37:33,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 2444 places, 2857 transitions, 9372 flow [2023-11-30 04:37:33,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2444 places, 2857 transitions, 9372 flow [2023-11-30 04:37:33,624 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:37:33,624 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:37:33,624 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:37:33,625 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:37:33,625 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:37:33,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:33,625 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:33,625 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:33,625 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:33,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -843384181, now seen corresponding path program 1 times [2023-11-30 04:37:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730411030] [2023-11-30 04:37:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:33,691 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:37:33,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730411030] [2023-11-30 04:37:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730411030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:33,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:33,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523344412] [2023-11-30 04:37:33,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:33,691 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:33,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:33,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:33,698 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2431 out of 2857 [2023-11-30 04:37:33,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2444 places, 2857 transitions, 9372 flow. Second operand has 3 states, 3 states have (on average 2433.0) internal successors, (7299), 3 states have internal predecessors, (7299), 0 states have call successors, (0), 0 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:37:33,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:33,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2431 of 2857 [2023-11-30 04:37:33,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:37,384 INFO L124 PetriNetUnfolderBase]: 236/2788 cut-off events. [2023-11-30 04:37:37,384 INFO L125 PetriNetUnfolderBase]: For 35931/35931 co-relation queries the response was YES. [2023-11-30 04:37:37,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4862 conditions, 2788 events. 236/2788 cut-off events. For 35931/35931 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11476 event pairs, 0 based on Foata normal form. 24865/27298 useless extension candidates. Maximal degree in co-relation 4737. Up to 180 conditions per place. [2023-11-30 04:37:37,873 INFO L140 encePairwiseOnDemand]: 2558/2857 looper letters, 65 selfloop transitions, 1 changer transitions 0/2377 dead transitions. [2023-11-30 04:37:37,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2262 places, 2377 transitions, 8544 flow [2023-11-30 04:37:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7657 transitions. [2023-11-30 04:37:37,877 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8933613347334033 [2023-11-30 04:37:37,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7657 transitions. [2023-11-30 04:37:37,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7657 transitions. [2023-11-30 04:37:37,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:37,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7657 transitions. [2023-11-30 04:37:37,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2552.3333333333335) internal successors, (7657), 3 states have internal predecessors, (7657), 0 states have call successors, (0), 0 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:37:37,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2857.0) internal successors, (11428), 4 states have internal predecessors, (11428), 0 states have call successors, (0), 0 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:37:37,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2857.0) internal successors, (11428), 4 states have internal predecessors, (11428), 0 states have call successors, (0), 0 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:37:37,885 INFO L307 CegarLoopForPetriNet]: 2444 programPoint places, -182 predicate places. [2023-11-30 04:37:37,885 INFO L500 AbstractCegarLoop]: Abstraction has has 2262 places, 2377 transitions, 8544 flow [2023-11-30 04:37:37,886 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2433.0) internal successors, (7299), 3 states have internal predecessors, (7299), 0 states have call successors, (0), 0 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:37:37,886 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:37,887 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:37,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2023-11-30 04:37:37,887 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:37,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash -843384180, now seen corresponding path program 1 times [2023-11-30 04:37:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389392704] [2023-11-30 04:37:37,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:37:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:38,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389392704] [2023-11-30 04:37:38,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389392704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:38,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:38,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592363443] [2023-11-30 04:37:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:38,217 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:38,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:38,220 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2432 out of 2857 [2023-11-30 04:37:38,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2262 places, 2377 transitions, 8544 flow. Second operand has 3 states, 3 states have (on average 2433.6666666666665) internal successors, (7301), 3 states have internal predecessors, (7301), 0 states have call successors, (0), 0 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:37:38,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:38,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2432 of 2857 [2023-11-30 04:37:38,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:41,744 INFO L124 PetriNetUnfolderBase]: 236/2728 cut-off events. [2023-11-30 04:37:41,745 INFO L125 PetriNetUnfolderBase]: For 35994/35994 co-relation queries the response was YES. [2023-11-30 04:37:42,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 2728 events. 236/2728 cut-off events. For 35994/35994 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11033 event pairs, 0 based on Foata normal form. 0/2433 useless extension candidates. Maximal degree in co-relation 4736. Up to 120 conditions per place. [2023-11-30 04:37:42,157 INFO L140 encePairwiseOnDemand]: 2855/2857 looper letters, 63 selfloop transitions, 1 changer transitions 0/2376 dead transitions. [2023-11-30 04:37:42,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2263 places, 2376 transitions, 8668 flow [2023-11-30 04:37:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7361 transitions. [2023-11-30 04:37:42,161 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8588262746470657 [2023-11-30 04:37:42,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7361 transitions. [2023-11-30 04:37:42,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7361 transitions. [2023-11-30 04:37:42,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:42,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7361 transitions. [2023-11-30 04:37:42,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2453.6666666666665) internal successors, (7361), 3 states have internal predecessors, (7361), 0 states have call successors, (0), 0 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:37:42,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2857.0) internal successors, (11428), 4 states have internal predecessors, (11428), 0 states have call successors, (0), 0 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:37:42,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2857.0) internal successors, (11428), 4 states have internal predecessors, (11428), 0 states have call successors, (0), 0 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:37:42,169 INFO L307 CegarLoopForPetriNet]: 2444 programPoint places, -181 predicate places. [2023-11-30 04:37:42,169 INFO L500 AbstractCegarLoop]: Abstraction has has 2263 places, 2376 transitions, 8668 flow [2023-11-30 04:37:42,170 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2433.6666666666665) internal successors, (7301), 3 states have internal predecessors, (7301), 0 states have call successors, (0), 0 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:37:42,170 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:42,170 INFO L232 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:42,170 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2023-11-30 04:37:42,171 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:42,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1527284214, now seen corresponding path program 1 times [2023-11-30 04:37:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534659159] [2023-11-30 04:37:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:42,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:37:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:42,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:37:42,452 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:37:42,452 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:37:42,452 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:37:42,452 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:37:42,452 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2023-11-30 04:37:42,452 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:37:42,452 WARN L227 ceAbstractionStarter]: 59 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:37:42,452 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 60 thread instances. [2023-11-30 04:37:42,638 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:37:42,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2485 places, 2905 transitions, 9590 flow [2023-11-30 04:37:47,460 INFO L124 PetriNetUnfolderBase]: 601/3803 cut-off events. [2023-11-30 04:37:47,461 INFO L125 PetriNetUnfolderBase]: For 37760/37760 co-relation queries the response was YES. [2023-11-30 04:37:48,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 3803 events. 601/3803 cut-off events. For 37760/37760 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 16017 event pairs, 0 based on Foata normal form. 0/3019 useless extension candidates. Maximal degree in co-relation 5621. Up to 122 conditions per place. [2023-11-30 04:37:48,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 2485 places, 2905 transitions, 9590 flow [2023-11-30 04:37:48,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2485 places, 2905 transitions, 9590 flow [2023-11-30 04:37:48,665 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:37:48,665 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:37:48,665 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:37:48,666 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:37:48,666 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:37:48,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:48,667 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:48,667 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:48,667 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:48,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash -406187228, now seen corresponding path program 1 times [2023-11-30 04:37:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783032] [2023-11-30 04:37:48,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:48,749 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:37:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783032] [2023-11-30 04:37:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520847215] [2023-11-30 04:37:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:48,749 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:48,753 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2472 out of 2905 [2023-11-30 04:37:48,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2485 places, 2905 transitions, 9590 flow. Second operand has 3 states, 3 states have (on average 2474.0) internal successors, (7422), 3 states have internal predecessors, (7422), 0 states have call successors, (0), 0 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:37:48,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:48,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2472 of 2905 [2023-11-30 04:37:48,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:52,537 INFO L124 PetriNetUnfolderBase]: 240/2835 cut-off events. [2023-11-30 04:37:52,538 INFO L125 PetriNetUnfolderBase]: For 37760/37760 co-relation queries the response was YES. [2023-11-30 04:37:52,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 2835 events. 240/2835 cut-off events. For 37760/37760 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11670 event pairs, 0 based on Foata normal form. 25736/28210 useless extension candidates. Maximal degree in co-relation 4848. Up to 183 conditions per place. [2023-11-30 04:37:53,031 INFO L140 encePairwiseOnDemand]: 2601/2905 looper letters, 66 selfloop transitions, 1 changer transitions 0/2417 dead transitions. [2023-11-30 04:37:53,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2300 places, 2417 transitions, 8748 flow [2023-11-30 04:37:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7786 transitions. [2023-11-30 04:37:53,035 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8934021801491681 [2023-11-30 04:37:53,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7786 transitions. [2023-11-30 04:37:53,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7786 transitions. [2023-11-30 04:37:53,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:53,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7786 transitions. [2023-11-30 04:37:53,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2595.3333333333335) internal successors, (7786), 3 states have internal predecessors, (7786), 0 states have call successors, (0), 0 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:37:53,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2905.0) internal successors, (11620), 4 states have internal predecessors, (11620), 0 states have call successors, (0), 0 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:37:53,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2905.0) internal successors, (11620), 4 states have internal predecessors, (11620), 0 states have call successors, (0), 0 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:37:53,043 INFO L307 CegarLoopForPetriNet]: 2485 programPoint places, -185 predicate places. [2023-11-30 04:37:53,043 INFO L500 AbstractCegarLoop]: Abstraction has has 2300 places, 2417 transitions, 8748 flow [2023-11-30 04:37:53,044 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2474.0) internal successors, (7422), 3 states have internal predecessors, (7422), 0 states have call successors, (0), 0 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:37:53,044 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:53,044 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:53,044 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2023-11-30 04:37:53,044 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:53,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash -406187227, now seen corresponding path program 1 times [2023-11-30 04:37:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:53,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705879160] [2023-11-30 04:37:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:53,115 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:37:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705879160] [2023-11-30 04:37:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705879160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:53,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:53,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:53,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422380636] [2023-11-30 04:37:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:53,116 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:53,309 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2473 out of 2905 [2023-11-30 04:37:53,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2300 places, 2417 transitions, 8748 flow. Second operand has 3 states, 3 states have (on average 2474.6666666666665) internal successors, (7424), 3 states have internal predecessors, (7424), 0 states have call successors, (0), 0 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:37:53,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:53,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2473 of 2905 [2023-11-30 04:37:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:57,605 INFO L124 PetriNetUnfolderBase]: 240/2774 cut-off events. [2023-11-30 04:37:57,605 INFO L125 PetriNetUnfolderBase]: For 37824/37824 co-relation queries the response was YES. [2023-11-30 04:37:58,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4978 conditions, 2774 events. 240/2774 cut-off events. For 37824/37824 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11207 event pairs, 0 based on Foata normal form. 0/2474 useless extension candidates. Maximal degree in co-relation 4847. Up to 122 conditions per place. [2023-11-30 04:37:58,046 INFO L140 encePairwiseOnDemand]: 2903/2905 looper letters, 64 selfloop transitions, 1 changer transitions 0/2416 dead transitions. [2023-11-30 04:37:58,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2301 places, 2416 transitions, 8874 flow [2023-11-30 04:37:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7485 transitions. [2023-11-30 04:37:58,050 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8588640275387264 [2023-11-30 04:37:58,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7485 transitions. [2023-11-30 04:37:58,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7485 transitions. [2023-11-30 04:37:58,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:58,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7485 transitions. [2023-11-30 04:37:58,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2495.0) internal successors, (7485), 3 states have internal predecessors, (7485), 0 states have call successors, (0), 0 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:37:58,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2905.0) internal successors, (11620), 4 states have internal predecessors, (11620), 0 states have call successors, (0), 0 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:37:58,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2905.0) internal successors, (11620), 4 states have internal predecessors, (11620), 0 states have call successors, (0), 0 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:37:58,060 INFO L307 CegarLoopForPetriNet]: 2485 programPoint places, -184 predicate places. [2023-11-30 04:37:58,060 INFO L500 AbstractCegarLoop]: Abstraction has has 2301 places, 2416 transitions, 8874 flow [2023-11-30 04:37:58,061 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2474.6666666666665) internal successors, (7424), 3 states have internal predecessors, (7424), 0 states have call successors, (0), 0 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:37:58,061 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:58,061 INFO L232 CegarLoopForPetriNet]: trace histogram [61, 61, 61, 61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:58,061 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2023-11-30 04:37:58,061 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:37:58,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:58,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1520287018, now seen corresponding path program 1 times [2023-11-30 04:37:58,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:58,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425037395] [2023-11-30 04:37:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:58,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:37:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:58,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:37:58,365 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:37:58,365 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:37:58,365 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:37:58,365 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:37:58,365 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2023-11-30 04:37:58,365 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:37:58,365 WARN L227 ceAbstractionStarter]: 60 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:37:58,365 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 61 thread instances. [2023-11-30 04:37:58,603 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:37:58,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2526 places, 2953 transitions, 9810 flow [2023-11-30 04:38:04,392 INFO L124 PetriNetUnfolderBase]: 611/3866 cut-off events. [2023-11-30 04:38:04,393 INFO L125 PetriNetUnfolderBase]: For 39650/39650 co-relation queries the response was YES. [2023-11-30 04:38:04,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5880 conditions, 3866 events. 611/3866 cut-off events. For 39650/39650 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 16300 event pairs, 0 based on Foata normal form. 0/3069 useless extension candidates. Maximal degree in co-relation 5746. Up to 124 conditions per place. [2023-11-30 04:38:04,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 2526 places, 2953 transitions, 9810 flow [2023-11-30 04:38:05,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2526 places, 2953 transitions, 9810 flow [2023-11-30 04:38:05,143 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:38:05,144 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:38:05,144 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:38:05,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:38:05,145 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:38:05,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:05,145 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:05,145 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:05,145 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:05,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1799096301, now seen corresponding path program 1 times [2023-11-30 04:38:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102257905] [2023-11-30 04:38:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:05,236 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:38:05,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102257905] [2023-11-30 04:38:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102257905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:05,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:05,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:05,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621643855] [2023-11-30 04:38:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:05,237 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:05,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:05,243 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2513 out of 2953 [2023-11-30 04:38:05,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2526 places, 2953 transitions, 9810 flow. Second operand has 3 states, 3 states have (on average 2515.0) internal successors, (7545), 3 states have internal predecessors, (7545), 0 states have call successors, (0), 0 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:38:05,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:05,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2513 of 2953 [2023-11-30 04:38:05,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:09,456 INFO L124 PetriNetUnfolderBase]: 244/2882 cut-off events. [2023-11-30 04:38:09,456 INFO L125 PetriNetUnfolderBase]: For 39650/39650 co-relation queries the response was YES. [2023-11-30 04:38:09,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5087 conditions, 2882 events. 244/2882 cut-off events. For 39650/39650 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11870 event pairs, 0 based on Foata normal form. 26622/29137 useless extension candidates. Maximal degree in co-relation 4960. Up to 186 conditions per place. [2023-11-30 04:38:09,880 INFO L140 encePairwiseOnDemand]: 2644/2953 looper letters, 67 selfloop transitions, 1 changer transitions 0/2457 dead transitions. [2023-11-30 04:38:09,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2338 places, 2457 transitions, 8954 flow [2023-11-30 04:38:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7915 transitions. [2023-11-30 04:38:09,885 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.893441697708545 [2023-11-30 04:38:09,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7915 transitions. [2023-11-30 04:38:09,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7915 transitions. [2023-11-30 04:38:09,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:09,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7915 transitions. [2023-11-30 04:38:09,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2638.3333333333335) internal successors, (7915), 3 states have internal predecessors, (7915), 0 states have call successors, (0), 0 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:38:09,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2953.0) internal successors, (11812), 4 states have internal predecessors, (11812), 0 states have call successors, (0), 0 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:38:09,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2953.0) internal successors, (11812), 4 states have internal predecessors, (11812), 0 states have call successors, (0), 0 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:38:09,894 INFO L307 CegarLoopForPetriNet]: 2526 programPoint places, -188 predicate places. [2023-11-30 04:38:09,894 INFO L500 AbstractCegarLoop]: Abstraction has has 2338 places, 2457 transitions, 8954 flow [2023-11-30 04:38:09,894 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2515.0) internal successors, (7545), 3 states have internal predecessors, (7545), 0 states have call successors, (0), 0 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:38:09,895 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:09,895 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:09,895 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2023-11-30 04:38:09,895 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:09,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1799096302, now seen corresponding path program 1 times [2023-11-30 04:38:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211380977] [2023-11-30 04:38:09,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:09,969 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:38:09,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211380977] [2023-11-30 04:38:09,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211380977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:09,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:09,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632212955] [2023-11-30 04:38:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:09,970 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:09,974 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2514 out of 2953 [2023-11-30 04:38:09,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2338 places, 2457 transitions, 8954 flow. Second operand has 3 states, 3 states have (on average 2515.6666666666665) internal successors, (7547), 3 states have internal predecessors, (7547), 0 states have call successors, (0), 0 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:38:09,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:09,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2514 of 2953 [2023-11-30 04:38:09,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:13,673 INFO L124 PetriNetUnfolderBase]: 244/2820 cut-off events. [2023-11-30 04:38:13,673 INFO L125 PetriNetUnfolderBase]: For 39715/39715 co-relation queries the response was YES. [2023-11-30 04:38:14,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5091 conditions, 2820 events. 244/2820 cut-off events. For 39715/39715 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11414 event pairs, 0 based on Foata normal form. 0/2515 useless extension candidates. Maximal degree in co-relation 4959. Up to 124 conditions per place. [2023-11-30 04:38:14,169 INFO L140 encePairwiseOnDemand]: 2951/2953 looper letters, 65 selfloop transitions, 1 changer transitions 0/2456 dead transitions. [2023-11-30 04:38:14,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2339 places, 2456 transitions, 9082 flow [2023-11-30 04:38:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7609 transitions. [2023-11-30 04:38:14,173 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8589005531098318 [2023-11-30 04:38:14,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7609 transitions. [2023-11-30 04:38:14,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7609 transitions. [2023-11-30 04:38:14,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:14,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7609 transitions. [2023-11-30 04:38:14,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2536.3333333333335) internal successors, (7609), 3 states have internal predecessors, (7609), 0 states have call successors, (0), 0 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:38:14,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2953.0) internal successors, (11812), 4 states have internal predecessors, (11812), 0 states have call successors, (0), 0 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:38:14,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2953.0) internal successors, (11812), 4 states have internal predecessors, (11812), 0 states have call successors, (0), 0 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:38:14,183 INFO L307 CegarLoopForPetriNet]: 2526 programPoint places, -187 predicate places. [2023-11-30 04:38:14,183 INFO L500 AbstractCegarLoop]: Abstraction has has 2339 places, 2456 transitions, 9082 flow [2023-11-30 04:38:14,184 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2515.6666666666665) internal successors, (7547), 3 states have internal predecessors, (7547), 0 states have call successors, (0), 0 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:38:14,184 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:14,184 INFO L232 CegarLoopForPetriNet]: trace histogram [62, 62, 62, 62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:14,184 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2023-11-30 04:38:14,184 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:14,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 159549931, now seen corresponding path program 1 times [2023-11-30 04:38:14,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:14,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355778298] [2023-11-30 04:38:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:14,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:38:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:14,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:38:14,714 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:38:14,714 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:38:14,714 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:38:14,715 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:38:14,715 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2023-11-30 04:38:14,715 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:38:14,715 WARN L227 ceAbstractionStarter]: 61 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:38:14,715 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 62 thread instances. [2023-11-30 04:38:14,973 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:38:14,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2567 places, 3001 transitions, 10032 flow [2023-11-30 04:38:20,707 INFO L124 PetriNetUnfolderBase]: 621/3929 cut-off events. [2023-11-30 04:38:20,707 INFO L125 PetriNetUnfolderBase]: For 41602/41602 co-relation queries the response was YES. [2023-11-30 04:38:21,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6007 conditions, 3929 events. 621/3929 cut-off events. For 41602/41602 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 16591 event pairs, 0 based on Foata normal form. 0/3119 useless extension candidates. Maximal degree in co-relation 5872. Up to 126 conditions per place. [2023-11-30 04:38:21,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 2567 places, 3001 transitions, 10032 flow [2023-11-30 04:38:21,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2567 places, 3001 transitions, 10032 flow [2023-11-30 04:38:21,594 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:38:21,594 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;@5d2ff35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:38:21,594 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:38:21,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:38:21,595 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-11-30 04:38:21,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:21,595 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:21,595 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:21,595 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:21,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1477499110, now seen corresponding path program 1 times [2023-11-30 04:38:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630705586] [2023-11-30 04:38:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:21,677 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:38:21,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630705586] [2023-11-30 04:38:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630705586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:21,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053564525] [2023-11-30 04:38:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:21,678 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:21,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:21,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:21,684 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2554 out of 3001 [2023-11-30 04:38:21,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2567 places, 3001 transitions, 10032 flow. Second operand has 3 states, 3 states have (on average 2556.0) internal successors, (7668), 3 states have internal predecessors, (7668), 0 states have call successors, (0), 0 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:38:21,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:21,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2554 of 3001 [2023-11-30 04:38:21,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:25,951 INFO L124 PetriNetUnfolderBase]: 248/2929 cut-off events. [2023-11-30 04:38:25,952 INFO L125 PetriNetUnfolderBase]: For 41602/41602 co-relation queries the response was YES. [2023-11-30 04:38:26,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 2929 events. 248/2929 cut-off events. For 41602/41602 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 12073 event pairs, 0 based on Foata normal form. 27523/30079 useless extension candidates. Maximal degree in co-relation 5073. Up to 189 conditions per place. [2023-11-30 04:38:26,481 INFO L140 encePairwiseOnDemand]: 2687/3001 looper letters, 68 selfloop transitions, 1 changer transitions 0/2497 dead transitions. [2023-11-30 04:38:26,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2376 places, 2497 transitions, 9162 flow [2023-11-30 04:38:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8044 transitions. [2023-11-30 04:38:26,485 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.893479951127402 [2023-11-30 04:38:26,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 8044 transitions. [2023-11-30 04:38:26,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 8044 transitions. [2023-11-30 04:38:26,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:26,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 8044 transitions. [2023-11-30 04:38:26,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2681.3333333333335) internal successors, (8044), 3 states have internal predecessors, (8044), 0 states have call successors, (0), 0 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:38:26,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 3001.0) internal successors, (12004), 4 states have internal predecessors, (12004), 0 states have call successors, (0), 0 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:38:26,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 3001.0) internal successors, (12004), 4 states have internal predecessors, (12004), 0 states have call successors, (0), 0 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:38:26,496 INFO L307 CegarLoopForPetriNet]: 2567 programPoint places, -191 predicate places. [2023-11-30 04:38:26,497 INFO L500 AbstractCegarLoop]: Abstraction has has 2376 places, 2497 transitions, 9162 flow [2023-11-30 04:38:26,497 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2556.0) internal successors, (7668), 3 states have internal predecessors, (7668), 0 states have call successors, (0), 0 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:38:26,497 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:26,497 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:26,498 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2023-11-30 04:38:26,498 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:26,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1477499111, now seen corresponding path program 1 times [2023-11-30 04:38:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173990144] [2023-11-30 04:38:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:26,760 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:38:26,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:26,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173990144] [2023-11-30 04:38:26,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173990144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:26,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:26,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:26,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188461872] [2023-11-30 04:38:26,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:26,761 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:26,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:26,765 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 2555 out of 3001 [2023-11-30 04:38:26,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2376 places, 2497 transitions, 9162 flow. Second operand has 3 states, 3 states have (on average 2556.6666666666665) internal successors, (7670), 3 states have internal predecessors, (7670), 0 states have call successors, (0), 0 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:38:26,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:26,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2555 of 3001 [2023-11-30 04:38:26,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:31,209 INFO L124 PetriNetUnfolderBase]: 248/2866 cut-off events. [2023-11-30 04:38:31,209 INFO L125 PetriNetUnfolderBase]: For 41668/41668 co-relation queries the response was YES. [2023-11-30 04:38:31,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 2866 events. 248/2866 cut-off events. For 41668/41668 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 11594 event pairs, 0 based on Foata normal form. 0/2556 useless extension candidates. Maximal degree in co-relation 5072. Up to 126 conditions per place. [2023-11-30 04:38:31,714 INFO L140 encePairwiseOnDemand]: 2999/3001 looper letters, 66 selfloop transitions, 1 changer transitions 0/2496 dead transitions. [2023-11-30 04:38:31,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2377 places, 2496 transitions, 9292 flow [2023-11-30 04:38:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7733 transitions. [2023-11-30 04:38:31,718 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8589359102521382 [2023-11-30 04:38:31,718 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 7733 transitions. [2023-11-30 04:38:31,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 7733 transitions. [2023-11-30 04:38:31,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:31,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 7733 transitions. [2023-11-30 04:38:31,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 2577.6666666666665) internal successors, (7733), 3 states have internal predecessors, (7733), 0 states have call successors, (0), 0 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:38:31,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 3001.0) internal successors, (12004), 4 states have internal predecessors, (12004), 0 states have call successors, (0), 0 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:38:31,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 3001.0) internal successors, (12004), 4 states have internal predecessors, (12004), 0 states have call successors, (0), 0 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:38:31,727 INFO L307 CegarLoopForPetriNet]: 2567 programPoint places, -190 predicate places. [2023-11-30 04:38:31,727 INFO L500 AbstractCegarLoop]: Abstraction has has 2377 places, 2496 transitions, 9292 flow [2023-11-30 04:38:31,728 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2556.6666666666665) internal successors, (7670), 3 states have internal predecessors, (7670), 0 states have call successors, (0), 0 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:38:31,728 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:31,728 INFO L232 CegarLoopForPetriNet]: trace histogram [63, 63, 63, 63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:31,728 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2023-11-30 04:38:31,728 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:31,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash 615319763, now seen corresponding path program 1 times [2023-11-30 04:38:31,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:31,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261328144] [2023-11-30 04:38:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:31,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:31,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:38:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:32,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:38:32,268 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:38:32,268 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:38:32,268 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:38:32,269 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:38:32,269 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2023-11-30 04:38:32,269 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:38:32,269 WARN L227 ceAbstractionStarter]: 62 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:38:32,269 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 63 thread instances. [2023-11-30 04:38:32,469 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:38:32,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2608 places, 3049 transitions, 10256 flow