/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:06:02,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:06:02,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:06:02,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:06:02,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:06:02,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:06:02,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:06:02,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:06:02,111 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:06:02,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:06:02,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:06:02,115 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:06:02,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:06:02,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:06:02,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:06:02,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:06:02,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:06:02,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:06:02,116 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:06:02,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:06:02,117 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:06:02,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:06:02,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:06:02,118 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:06:02,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:06:02,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:06:02,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:06:02,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:06:02,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:06:02,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:06:02,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:06:02,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:06:02,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:06:02,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:06:02,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:06:02,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:06:02,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:06:02,352 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:06:02,353 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:06:02,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2023-12-05 21:06:03,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:06:03,613 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:06:03,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2023-12-05 21:06:03,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20add7bf2/0dd4c3faaebf48cbbc8da2c211a0cfe4/FLAG5f259e64f [2023-12-05 21:06:03,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20add7bf2/0dd4c3faaebf48cbbc8da2c211a0cfe4 [2023-12-05 21:06:03,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:06:03,639 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:06:03,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:06:03,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:06:03,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:06:03,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:03,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f71d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03, skipping insertion in model container [2023-12-05 21:06:03,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:03,684 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:06:03,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:06:03,908 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:06:03,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:06:03,978 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:06:03,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03 WrapperNode [2023-12-05 21:06:03,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:06:03,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:06:03,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:06:03,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:06:03,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:03,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,022 INFO L138 Inliner]: procedures = 165, calls = 21, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 75 [2023-12-05 21:06:04,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:06:04,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:06:04,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:06:04,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:06:04,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:06:04,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:06:04,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:06:04,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:06:04,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (1/1) ... [2023-12-05 21:06:04,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:06:04,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:06:04,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:06:04,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:06:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:06:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:06:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:06:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:06:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:06:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:06:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:06:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:06:04,123 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:06:04,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:06:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:06:04,124 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:06:04,232 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:06:04,236 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:06:04,429 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:06:04,447 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:06:04,447 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-05 21:06:04,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:06:04 BoogieIcfgContainer [2023-12-05 21:06:04,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:06:04,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:06:04,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:06:04,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:06:04,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:06:03" (1/3) ... [2023-12-05 21:06:04,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e76935b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:06:04, skipping insertion in model container [2023-12-05 21:06:04,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:03" (2/3) ... [2023-12-05 21:06:04,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e76935b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:06:04, skipping insertion in model container [2023-12-05 21:06:04,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:06:04" (3/3) ... [2023-12-05 21:06:04,458 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2023-12-05 21:06:04,472 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:06:04,472 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 21:06:04,472 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:06:04,504 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:04,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 81 transitions, 166 flow [2023-12-05 21:06:04,577 INFO L124 PetriNetUnfolderBase]: 8/123 cut-off events. [2023-12-05 21:06:04,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:04,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 123 events. 8/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 284 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2023-12-05 21:06:04,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 81 transitions, 166 flow [2023-12-05 21:06:04,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 81 transitions, 166 flow [2023-12-05 21:06:04,592 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:04,597 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;@2fab54eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:04,597 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:04,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:04,610 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2023-12-05 21:06:04,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:04,610 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:04,611 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:04,611 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:04,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1757510413, now seen corresponding path program 1 times [2023-12-05 21:06:04,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:04,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688368126] [2023-12-05 21:06:04,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688368126] [2023-12-05 21:06:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688368126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:04,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:04,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:04,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682174382] [2023-12-05 21:06:04,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:04,882 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:04,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:04,904 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 81 [2023-12-05 21:06:04,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:04,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:04,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 81 [2023-12-05 21:06:04,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:04,979 INFO L124 PetriNetUnfolderBase]: 14/176 cut-off events. [2023-12-05 21:06:04,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:04,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 176 events. 14/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 614 event pairs, 8 based on Foata normal form. 25/181 useless extension candidates. Maximal degree in co-relation 159. Up to 28 conditions per place. [2023-12-05 21:06:04,980 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 10 selfloop transitions, 1 changer transitions 29/71 dead transitions. [2023-12-05 21:06:04,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 71 transitions, 182 flow [2023-12-05 21:06:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2023-12-05 21:06:04,990 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8106995884773662 [2023-12-05 21:06:04,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 197 transitions. [2023-12-05 21:06:04,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 197 transitions. [2023-12-05 21:06:04,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:04,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 197 transitions. [2023-12-05 21:06:05,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,009 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, -5 predicate places. [2023-12-05 21:06:05,010 INFO L500 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 182 flow [2023-12-05 21:06:05,011 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,011 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:05,011 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:05,011 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:06:05,011 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:05,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1757510414, now seen corresponding path program 1 times [2023-12-05 21:06:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:05,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413371534] [2023-12-05 21:06:05,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:05,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:05,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-12-05 21:06:05,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:05,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413371534] [2023-12-05 21:06:05,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413371534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:05,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:05,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880011098] [2023-12-05 21:06:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:05,151 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:05,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:05,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:05,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:05,153 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 81 [2023-12-05 21:06:05,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:05,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 81 [2023-12-05 21:06:05,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:05,221 INFO L124 PetriNetUnfolderBase]: 12/160 cut-off events. [2023-12-05 21:06:05,221 INFO L125 PetriNetUnfolderBase]: For 27/47 co-relation queries the response was YES. [2023-12-05 21:06:05,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 160 events. 12/160 cut-off events. For 27/47 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 481 event pairs, 6 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 171. Up to 28 conditions per place. [2023-12-05 21:06:05,222 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 8 selfloop transitions, 1 changer transitions 31/72 dead transitions. [2023-12-05 21:06:05,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 72 transitions, 222 flow [2023-12-05 21:06:05,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2023-12-05 21:06:05,224 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7860082304526749 [2023-12-05 21:06:05,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 191 transitions. [2023-12-05 21:06:05,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 191 transitions. [2023-12-05 21:06:05,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:05,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 191 transitions. [2023-12-05 21:06:05,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,227 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, -4 predicate places. [2023-12-05 21:06:05,227 INFO L500 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 222 flow [2023-12-05 21:06:05,227 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,227 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:05,227 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:05,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:06:05,228 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-12-05 21:06:05,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash -89268802, now seen corresponding path program 1 times [2023-12-05 21:06:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171010778] [2023-12-05 21:06:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:05,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:05,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:05,314 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:05,314 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:05,316 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:05,316 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:05,316 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:06:05,317 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:05,320 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:05,320 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:06:05,353 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:05,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 100 transitions, 210 flow [2023-12-05 21:06:05,390 INFO L124 PetriNetUnfolderBase]: 13/186 cut-off events. [2023-12-05 21:06:05,390 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:06:05,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 186 events. 13/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 533 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 124. Up to 6 conditions per place. [2023-12-05 21:06:05,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 100 transitions, 210 flow [2023-12-05 21:06:05,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 100 transitions, 210 flow [2023-12-05 21:06:05,394 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:05,394 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;@2fab54eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:05,394 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:05,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:05,411 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2023-12-05 21:06:05,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:05,411 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:05,411 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:05,411 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:05,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1991758093, now seen corresponding path program 1 times [2023-12-05 21:06:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:05,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191125482] [2023-12-05 21:06:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:05,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-12-05 21:06:05,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:05,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191125482] [2023-12-05 21:06:05,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191125482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:05,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:05,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:05,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666272595] [2023-12-05 21:06:05,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:05,454 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:05,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:05,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:05,456 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 100 [2023-12-05 21:06:05,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:05,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 100 [2023-12-05 21:06:05,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:05,596 INFO L124 PetriNetUnfolderBase]: 104/595 cut-off events. [2023-12-05 21:06:05,596 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-12-05 21:06:05,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 595 events. 104/595 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3704 event pairs, 62 based on Foata normal form. 138/663 useless extension candidates. Maximal degree in co-relation 228. Up to 127 conditions per place. [2023-12-05 21:06:05,599 INFO L140 encePairwiseOnDemand]: 90/100 looper letters, 13 selfloop transitions, 1 changer transitions 25/87 dead transitions. [2023-12-05 21:06:05,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 87 transitions, 230 flow [2023-12-05 21:06:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2023-12-05 21:06:05,605 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2023-12-05 21:06:05,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2023-12-05 21:06:05,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2023-12-05 21:06:05,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:05,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2023-12-05 21:06:05,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,613 INFO L308 CegarLoopForPetriNet]: 98 programPoint places, -8 predicate places. [2023-12-05 21:06:05,614 INFO L500 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 230 flow [2023-12-05 21:06:05,614 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,614 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:05,614 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:05,614 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:06:05,616 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:05,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1991758094, now seen corresponding path program 1 times [2023-12-05 21:06:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357276227] [2023-12-05 21:06:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357276227] [2023-12-05 21:06:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357276227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181371628] [2023-12-05 21:06:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:05,717 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:05,718 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 100 [2023-12-05 21:06:05,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:05,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 100 [2023-12-05 21:06:05,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:05,792 INFO L124 PetriNetUnfolderBase]: 90/528 cut-off events. [2023-12-05 21:06:05,793 INFO L125 PetriNetUnfolderBase]: For 93/167 co-relation queries the response was YES. [2023-12-05 21:06:05,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 528 events. 90/528 cut-off events. For 93/167 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3084 event pairs, 48 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 250. Up to 127 conditions per place. [2023-12-05 21:06:05,795 INFO L140 encePairwiseOnDemand]: 97/100 looper letters, 11 selfloop transitions, 1 changer transitions 29/90 dead transitions. [2023-12-05 21:06:05,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 292 flow [2023-12-05 21:06:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2023-12-05 21:06:05,797 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7833333333333333 [2023-12-05 21:06:05,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 235 transitions. [2023-12-05 21:06:05,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 235 transitions. [2023-12-05 21:06:05,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:05,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 235 transitions. [2023-12-05 21:06:05,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,801 INFO L308 CegarLoopForPetriNet]: 98 programPoint places, -7 predicate places. [2023-12-05 21:06:05,801 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 292 flow [2023-12-05 21:06:05,801 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,801 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:05,801 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:05,802 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:06:05,802 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-12-05 21:06:05,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1201147011, now seen corresponding path program 1 times [2023-12-05 21:06:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259897342] [2023-12-05 21:06:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:05,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:05,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:05,857 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:05,857 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:05,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:05,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:05,860 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:06:05,860 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:05,861 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:05,861 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:06:05,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:05,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 119 transitions, 256 flow [2023-12-05 21:06:05,912 INFO L124 PetriNetUnfolderBase]: 18/249 cut-off events. [2023-12-05 21:06:05,916 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:06:05,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 18/249 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 768 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. [2023-12-05 21:06:05,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 119 transitions, 256 flow [2023-12-05 21:06:05,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 119 transitions, 256 flow [2023-12-05 21:06:05,922 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:05,925 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;@2fab54eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:05,925 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:05,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:05,932 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-12-05 21:06:05,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:05,933 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:05,933 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:05,934 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:05,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 337777549, now seen corresponding path program 1 times [2023-12-05 21:06:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441998737] [2023-12-05 21:06:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:05,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441998737] [2023-12-05 21:06:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441998737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:05,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:05,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580429252] [2023-12-05 21:06:05,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:05,969 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:05,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:05,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:05,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:05,971 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 119 [2023-12-05 21:06:05,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:05,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:05,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 119 [2023-12-05 21:06:05,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:06,178 INFO L124 PetriNetUnfolderBase]: 518/1996 cut-off events. [2023-12-05 21:06:06,178 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-12-05 21:06:06,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2891 conditions, 1996 events. 518/1996 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 16528 event pairs, 314 based on Foata normal form. 621/2397 useless extension candidates. Maximal degree in co-relation 816. Up to 514 conditions per place. [2023-12-05 21:06:06,187 INFO L140 encePairwiseOnDemand]: 107/119 looper letters, 16 selfloop transitions, 1 changer transitions 27/103 dead transitions. [2023-12-05 21:06:06,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 103 transitions, 280 flow [2023-12-05 21:06:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-12-05 21:06:06,189 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8207282913165266 [2023-12-05 21:06:06,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-12-05 21:06:06,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-12-05 21:06:06,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:06,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-12-05 21:06:06,190 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-12-05 21:06:06,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,192 INFO L308 CegarLoopForPetriNet]: 117 programPoint places, -11 predicate places. [2023-12-05 21:06:06,192 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 280 flow [2023-12-05 21:06:06,192 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,193 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:06,193 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:06,193 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:06:06,193 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:06,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash 337777550, now seen corresponding path program 1 times [2023-12-05 21:06:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819855814] [2023-12-05 21:06:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:06,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819855814] [2023-12-05 21:06:06,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819855814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:06,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:06,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112519744] [2023-12-05 21:06:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:06,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:06,322 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 119 [2023-12-05 21:06:06,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:06,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 119 [2023-12-05 21:06:06,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:06,493 INFO L124 PetriNetUnfolderBase]: 450/1758 cut-off events. [2023-12-05 21:06:06,494 INFO L125 PetriNetUnfolderBase]: For 330/566 co-relation queries the response was YES. [2023-12-05 21:06:06,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 1758 events. 450/1758 cut-off events. For 330/566 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 13953 event pairs, 246 based on Foata normal form. 0/1591 useless extension candidates. Maximal degree in co-relation 907. Up to 514 conditions per place. [2023-12-05 21:06:06,501 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 14 selfloop transitions, 1 changer transitions 33/108 dead transitions. [2023-12-05 21:06:06,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 108 transitions, 364 flow [2023-12-05 21:06:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-12-05 21:06:06,503 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7815126050420168 [2023-12-05 21:06:06,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-12-05 21:06:06,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-12-05 21:06:06,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:06,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-12-05 21:06:06,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,505 INFO L308 CegarLoopForPetriNet]: 117 programPoint places, -10 predicate places. [2023-12-05 21:06:06,505 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 108 transitions, 364 flow [2023-12-05 21:06:06,505 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,505 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:06,506 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:06,506 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:06:06,506 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-12-05 21:06:06,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash 152259680, now seen corresponding path program 1 times [2023-12-05 21:06:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295044450] [2023-12-05 21:06:06,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:06,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:06,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:06,537 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:06,537 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:06,538 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:06,538 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:06,538 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:06:06,538 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:06,538 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:06,538 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:06:06,564 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:06,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 138 transitions, 304 flow [2023-12-05 21:06:06,587 INFO L124 PetriNetUnfolderBase]: 23/312 cut-off events. [2023-12-05 21:06:06,588 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:06:06,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 312 events. 23/312 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1005 event pairs, 0 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 257. Up to 10 conditions per place. [2023-12-05 21:06:06,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 138 transitions, 304 flow [2023-12-05 21:06:06,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 138 transitions, 304 flow [2023-12-05 21:06:06,593 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:06,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;@2fab54eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:06,594 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:06,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:06,597 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-12-05 21:06:06,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:06,597 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:06,597 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:06,597 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:06,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1090536077, now seen corresponding path program 1 times [2023-12-05 21:06:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308790196] [2023-12-05 21:06:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:06,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308790196] [2023-12-05 21:06:06,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308790196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:06,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531148701] [2023-12-05 21:06:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:06,625 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:06,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:06,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:06,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:06,626 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 138 [2023-12-05 21:06:06,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 138 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:06,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:06,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 138 [2023-12-05 21:06:06,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:07,352 INFO L124 PetriNetUnfolderBase]: 2192/6631 cut-off events. [2023-12-05 21:06:07,353 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2023-12-05 21:06:07,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9984 conditions, 6631 events. 2192/6631 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 64941 event pairs, 1340 based on Foata normal form. 2502/8463 useless extension candidates. Maximal degree in co-relation 2878. Up to 1945 conditions per place. [2023-12-05 21:06:07,394 INFO L140 encePairwiseOnDemand]: 124/138 looper letters, 19 selfloop transitions, 1 changer transitions 29/119 dead transitions. [2023-12-05 21:06:07,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 332 flow [2023-12-05 21:06:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-12-05 21:06:07,396 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8236714975845411 [2023-12-05 21:06:07,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-12-05 21:06:07,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-12-05 21:06:07,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:07,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-12-05 21:06:07,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:07,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:07,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:07,399 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, -14 predicate places. [2023-12-05 21:06:07,399 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 332 flow [2023-12-05 21:06:07,399 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:07,400 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:07,400 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:07,400 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:06:07,400 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:07,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1090536078, now seen corresponding path program 1 times [2023-12-05 21:06:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23167229] [2023-12-05 21:06:07,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:07,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23167229] [2023-12-05 21:06:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23167229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:07,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:07,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:07,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799633657] [2023-12-05 21:06:07,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:07,497 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:07,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:07,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:07,498 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 138 [2023-12-05 21:06:07,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:07,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:07,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 138 [2023-12-05 21:06:07,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:08,056 INFO L124 PetriNetUnfolderBase]: 1908/5826 cut-off events. [2023-12-05 21:06:08,057 INFO L125 PetriNetUnfolderBase]: For 1203/1925 co-relation queries the response was YES. [2023-12-05 21:06:08,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11534 conditions, 5826 events. 1908/5826 cut-off events. For 1203/1925 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 55370 event pairs, 1056 based on Foata normal form. 0/5317 useless extension candidates. Maximal degree in co-relation 3265. Up to 1945 conditions per place. [2023-12-05 21:06:08,085 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 17 selfloop transitions, 1 changer transitions 37/126 dead transitions. [2023-12-05 21:06:08,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 126 transitions, 438 flow [2023-12-05 21:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-12-05 21:06:08,087 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7801932367149759 [2023-12-05 21:06:08,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-12-05 21:06:08,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-12-05 21:06:08,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:08,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-12-05 21:06:08,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:08,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:08,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:08,090 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2023-12-05 21:06:08,090 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 126 transitions, 438 flow [2023-12-05 21:06:08,090 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:08,090 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:08,090 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:08,091 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:06:08,091 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-12-05 21:06:08,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash -391947019, now seen corresponding path program 1 times [2023-12-05 21:06:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551558598] [2023-12-05 21:06:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:08,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:08,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:08,210 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:08,210 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:08,210 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:08,210 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:08,210 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:06:08,210 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:08,211 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:08,211 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:06:08,230 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:08,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 157 transitions, 354 flow [2023-12-05 21:06:08,258 INFO L124 PetriNetUnfolderBase]: 28/375 cut-off events. [2023-12-05 21:06:08,258 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:06:08,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 375 events. 28/375 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1255 event pairs, 0 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 325. Up to 12 conditions per place. [2023-12-05 21:06:08,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 157 transitions, 354 flow [2023-12-05 21:06:08,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 157 transitions, 354 flow [2023-12-05 21:06:08,263 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:08,263 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;@2fab54eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:08,263 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:08,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:08,265 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-12-05 21:06:08,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:08,266 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:08,266 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:08,266 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:08,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash -44933619, now seen corresponding path program 1 times [2023-12-05 21:06:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358065377] [2023-12-05 21:06:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:08,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358065377] [2023-12-05 21:06:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358065377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:08,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:08,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:08,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613824636] [2023-12-05 21:06:08,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:08,292 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:08,293 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 157 [2023-12-05 21:06:08,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 157 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:08,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:08,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 157 [2023-12-05 21:06:08,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:10,801 INFO L124 PetriNetUnfolderBase]: 8510/21832 cut-off events. [2023-12-05 21:06:10,801 INFO L125 PetriNetUnfolderBase]: For 2176/2176 co-relation queries the response was YES. [2023-12-05 21:06:10,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33934 conditions, 21832 events. 8510/21832 cut-off events. For 2176/2176 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 240533 event pairs, 5228 based on Foata normal form. 9441/29253 useless extension candidates. Maximal degree in co-relation 9997. Up to 7048 conditions per place. [2023-12-05 21:06:10,930 INFO L140 encePairwiseOnDemand]: 141/157 looper letters, 22 selfloop transitions, 1 changer transitions 31/135 dead transitions. [2023-12-05 21:06:10,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 135 transitions, 386 flow [2023-12-05 21:06:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-12-05 21:06:10,932 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8259023354564756 [2023-12-05 21:06:10,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-12-05 21:06:10,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-12-05 21:06:10,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:10,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-12-05 21:06:10,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:10,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:10,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:10,934 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, -17 predicate places. [2023-12-05 21:06:10,934 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 386 flow [2023-12-05 21:06:10,935 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:10,935 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:10,935 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:10,935 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:06:10,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-12-05 21:06:10,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash -44933618, now seen corresponding path program 1 times [2023-12-05 21:06:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:10,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356415713] [2023-12-05 21:06:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:10,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356415713] [2023-12-05 21:06:10,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356415713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:10,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:10,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:10,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331408469] [2023-12-05 21:06:10,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:10,999 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:11,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:11,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:11,000 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 157 [2023-12-05 21:06:11,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:11,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:11,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 157 [2023-12-05 21:06:11,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:13,191 INFO L124 PetriNetUnfolderBase]: 7416/19164 cut-off events. [2023-12-05 21:06:13,191 INFO L125 PetriNetUnfolderBase]: For 4443/6623 co-relation queries the response was YES. [2023-12-05 21:06:13,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39777 conditions, 19164 events. 7416/19164 cut-off events. For 4443/6623 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 206305 event pairs, 4134 based on Foata normal form. 0/17629 useless extension candidates. Maximal degree in co-relation 11541. Up to 7048 conditions per place. [2023-12-05 21:06:13,295 INFO L140 encePairwiseOnDemand]: 154/157 looper letters, 20 selfloop transitions, 1 changer transitions 41/144 dead transitions. [2023-12-05 21:06:13,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 144 transitions, 514 flow [2023-12-05 21:06:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-12-05 21:06:13,296 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7791932059447984 [2023-12-05 21:06:13,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-12-05 21:06:13,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-12-05 21:06:13,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:13,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-12-05 21:06:13,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:13,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:13,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:13,299 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, -16 predicate places. [2023-12-05 21:06:13,299 INFO L500 AbstractCegarLoop]: Abstraction has has 139 places, 144 transitions, 514 flow [2023-12-05 21:06:13,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:13,300 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:13,300 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:13,300 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:06:13,300 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-12-05 21:06:13,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash 353770978, now seen corresponding path program 1 times [2023-12-05 21:06:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:13,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504324184] [2023-12-05 21:06:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:13,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:13,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:13,338 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:13,338 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:13,338 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:13,338 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:13,338 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:06:13,338 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:13,339 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:13,339 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:06:13,365 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:13,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 176 transitions, 406 flow [2023-12-05 21:06:13,399 INFO L124 PetriNetUnfolderBase]: 33/438 cut-off events. [2023-12-05 21:06:13,399 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:06:13,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 438 events. 33/438 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1497 event pairs, 0 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 394. Up to 14 conditions per place. [2023-12-05 21:06:13,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 176 transitions, 406 flow [2023-12-05 21:06:13,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 176 transitions, 406 flow [2023-12-05 21:06:13,405 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:13,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;@2fab54eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:13,405 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:13,406 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:13,406 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-12-05 21:06:13,406 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:13,406 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:13,407 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:13,407 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:13,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1226335757, now seen corresponding path program 1 times [2023-12-05 21:06:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:13,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104289949] [2023-12-05 21:06:13,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:13,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-12-05 21:06:13,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104289949] [2023-12-05 21:06:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104289949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:13,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153827772] [2023-12-05 21:06:13,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:13,456 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:13,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:13,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:13,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:13,458 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 176 [2023-12-05 21:06:13,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 176 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:13,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:13,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 176 [2023-12-05 21:06:13,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:22,753 INFO L124 PetriNetUnfolderBase]: 31352/71323 cut-off events. [2023-12-05 21:06:22,753 INFO L125 PetriNetUnfolderBase]: For 9628/9628 co-relation queries the response was YES. [2023-12-05 21:06:23,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113801 conditions, 71323 events. 31352/71323 cut-off events. For 9628/9628 co-relation queries the response was YES. Maximal size of possible extension queue 2405. Compared 853493 event pairs, 19322 based on Foata normal form. 34146/99399 useless extension candidates. Maximal degree in co-relation 34027. Up to 24787 conditions per place. [2023-12-05 21:06:23,553 INFO L140 encePairwiseOnDemand]: 158/176 looper letters, 25 selfloop transitions, 1 changer transitions 33/151 dead transitions. [2023-12-05 21:06:23,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 151 transitions, 442 flow [2023-12-05 21:06:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-12-05 21:06:23,555 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8276515151515151 [2023-12-05 21:06:23,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-12-05 21:06:23,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-12-05 21:06:23,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:23,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-12-05 21:06:23,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:23,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:23,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:23,558 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -20 predicate places. [2023-12-05 21:06:23,558 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 442 flow [2023-12-05 21:06:23,558 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:23,558 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:23,558 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:23,558 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:06:23,558 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:23,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1226335758, now seen corresponding path program 1 times [2023-12-05 21:06:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157701304] [2023-12-05 21:06:23,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:23,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:23,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:23,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157701304] [2023-12-05 21:06:23,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157701304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:23,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:23,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:23,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063123977] [2023-12-05 21:06:23,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:23,615 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:23,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:23,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:23,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:23,616 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 176 [2023-12-05 21:06:23,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:23,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:23,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 176 [2023-12-05 21:06:23,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:31,745 INFO L124 PetriNetUnfolderBase]: 27342/62580 cut-off events. [2023-12-05 21:06:31,745 INFO L125 PetriNetUnfolderBase]: For 16431/22985 co-relation queries the response was YES. [2023-12-05 21:06:32,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134953 conditions, 62580 events. 27342/62580 cut-off events. For 16431/22985 co-relation queries the response was YES. Maximal size of possible extension queue 1981. Compared 735061 event pairs, 15312 based on Foata normal form. 0/57967 useless extension candidates. Maximal degree in co-relation 39864. Up to 24787 conditions per place. [2023-12-05 21:06:32,507 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 23 selfloop transitions, 1 changer transitions 45/162 dead transitions. [2023-12-05 21:06:32,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 162 transitions, 592 flow [2023-12-05 21:06:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-12-05 21:06:32,508 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7784090909090909 [2023-12-05 21:06:32,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-12-05 21:06:32,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-12-05 21:06:32,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:32,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-12-05 21:06:32,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-12-05 21:06:32,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:32,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:32,511 INFO L308 CegarLoopForPetriNet]: 174 programPoint places, -19 predicate places. [2023-12-05 21:06:32,511 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 162 transitions, 592 flow [2023-12-05 21:06:32,511 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:32,511 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:32,511 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:32,511 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:06:32,511 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-12-05 21:06:32,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1585155783, now seen corresponding path program 1 times [2023-12-05 21:06:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217475578] [2023-12-05 21:06:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:32,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:32,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:32,552 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:32,552 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:32,552 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:32,552 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:32,552 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:06:32,552 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:32,554 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:32,554 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-12-05 21:06:32,580 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:32,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 195 transitions, 460 flow [2023-12-05 21:06:32,623 INFO L124 PetriNetUnfolderBase]: 38/501 cut-off events. [2023-12-05 21:06:32,623 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:06:32,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 501 events. 38/501 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1745 event pairs, 0 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 464. Up to 16 conditions per place. [2023-12-05 21:06:32,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 195 transitions, 460 flow [2023-12-05 21:06:32,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 195 transitions, 460 flow [2023-12-05 21:06:32,630 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:32,631 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;@2fab54eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:32,631 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:32,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:32,632 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-12-05 21:06:32,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:32,633 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:32,633 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:32,633 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:32,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash 609376909, now seen corresponding path program 1 times [2023-12-05 21:06:32,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:32,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289008301] [2023-12-05 21:06:32,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:32,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:32,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:32,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289008301] [2023-12-05 21:06:32,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289008301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:32,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:32,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:32,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069780211] [2023-12-05 21:06:32,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:32,658 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:32,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:32,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:32,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:32,659 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 195 [2023-12-05 21:06:32,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 195 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:32,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:32,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 195 [2023-12-05 21:06:32,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:12,866 INFO L124 PetriNetUnfolderBase]: 111542/231460 cut-off events. [2023-12-05 21:07:12,867 INFO L125 PetriNetUnfolderBase]: For 40003/40003 co-relation queries the response was YES. [2023-12-05 21:07:15,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377457 conditions, 231460 events. 111542/231460 cut-off events. For 40003/40003 co-relation queries the response was YES. Maximal size of possible extension queue 7016. Compared 2958645 event pairs, 68894 based on Foata normal form. 119925/333165 useless extension candidates. Maximal degree in co-relation 114136. Up to 85294 conditions per place. [2023-12-05 21:07:15,983 INFO L140 encePairwiseOnDemand]: 175/195 looper letters, 28 selfloop transitions, 1 changer transitions 35/167 dead transitions. [2023-12-05 21:07:15,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 167 transitions, 500 flow [2023-12-05 21:07:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-12-05 21:07:15,985 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8290598290598291 [2023-12-05 21:07:15,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-12-05 21:07:15,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-12-05 21:07:15,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:15,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-12-05 21:07:15,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:15,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 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-12-05 21:07:15,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 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-12-05 21:07:15,988 INFO L308 CegarLoopForPetriNet]: 193 programPoint places, -23 predicate places. [2023-12-05 21:07:15,988 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 500 flow [2023-12-05 21:07:15,988 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:15,988 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:15,988 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:15,988 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 21:07:15,988 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:07:15,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash 609376910, now seen corresponding path program 1 times [2023-12-05 21:07:15,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:15,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226369947] [2023-12-05 21:07:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:16,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-12-05 21:07:16,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:16,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226369947] [2023-12-05 21:07:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226369947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:16,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:16,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:16,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127471994] [2023-12-05 21:07:16,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:16,044 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:16,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:16,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:16,045 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 195 [2023-12-05 21:07:16,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:16,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:16,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 195 [2023-12-05 21:07:16,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand