/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/40_barrier_vf-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:04:53,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:04:53,874 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:04:53,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:04:53,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:04:53,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:04:53,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:04:53,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:04:53,903 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:04:53,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:04:53,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:04:53,906 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:04:53,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:04:53,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:04:53,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:04:53,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:04:53,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:04:53,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:04:53,908 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:04:53,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:04:53,908 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:04:53,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:04:53,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:04:53,909 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:04:53,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:04:53,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:53,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:04:53,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:04:53,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:04:53,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:04:53,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:04:53,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:04:53,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:04:53,911 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:04:54,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:04:54,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:04:54,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:04:54,137 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:04:54,138 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:04:54,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf-pthread.i [2023-12-05 21:04:55,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:04:55,323 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:04:55,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf-pthread.i [2023-12-05 21:04:55,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501495bad/7304192a63d949b2a0356012e52ed91d/FLAG37750e882 [2023-12-05 21:04:55,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501495bad/7304192a63d949b2a0356012e52ed91d [2023-12-05 21:04:55,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:04:55,343 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:04:55,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:55,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:04:55,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:04:55,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4459a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55, skipping insertion in model container [2023-12-05 21:04:55,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,373 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:04:55,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:55,559 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:04:55,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:55,641 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:04:55,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55 WrapperNode [2023-12-05 21:04:55,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:55,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:55,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:04:55,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:04:55,647 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:04:55" (1/1) ... [2023-12-05 21:04:55,677 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:04:55" (1/1) ... [2023-12-05 21:04:55,698 INFO L138 Inliner]: procedures = 165, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2023-12-05 21:04:55,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:55,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:04:55,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:04:55,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:04:55,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:04:55,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:04:55,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:04:55,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:04:55,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (1/1) ... [2023-12-05 21:04:55,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:55,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:04:55,763 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:04:55,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:04:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:04:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:04:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:04:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:04:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:04:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:04:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:04:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:04:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:04:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:04:55,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:04:55,786 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:04:55,913 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:04:55,915 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:04:56,043 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:04:56,066 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:04:56,066 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-05 21:04:56,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:56 BoogieIcfgContainer [2023-12-05 21:04:56,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:04:56,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:04:56,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:04:56,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:04:56,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:04:55" (1/3) ... [2023-12-05 21:04:56,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5677947a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:56, skipping insertion in model container [2023-12-05 21:04:56,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:55" (2/3) ... [2023-12-05 21:04:56,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5677947a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:56, skipping insertion in model container [2023-12-05 21:04:56,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:56" (3/3) ... [2023-12-05 21:04:56,078 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf-pthread.i [2023-12-05 21:04:56,090 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:04:56,091 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 21:04:56,091 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:04:56,122 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:56,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 78 transitions, 160 flow [2023-12-05 21:04:56,183 INFO L124 PetriNetUnfolderBase]: 7/91 cut-off events. [2023-12-05 21:04:56,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:56,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 46. Up to 4 conditions per place. [2023-12-05 21:04:56,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 78 transitions, 160 flow [2023-12-05 21:04:56,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 78 transitions, 160 flow [2023-12-05 21:04:56,196 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:56,201 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;@5ba0b1e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:56,201 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:56,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:56,209 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-12-05 21:04:56,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:56,209 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:56,209 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:56,210 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:04:56,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1244440811, now seen corresponding path program 1 times [2023-12-05 21:04:56,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:56,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936265876] [2023-12-05 21:04:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:56,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936265876] [2023-12-05 21:04:56,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936265876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:56,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:56,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:56,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527882994] [2023-12-05 21:04:56,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:56,482 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:56,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:56,512 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 78 [2023-12-05 21:04:56,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:56,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 78 [2023-12-05 21:04:56,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:56,567 INFO L124 PetriNetUnfolderBase]: 14/114 cut-off events. [2023-12-05 21:04:56,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:56,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 114 events. 14/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 273 event pairs, 8 based on Foata normal form. 18/119 useless extension candidates. Maximal degree in co-relation 99. Up to 26 conditions per place. [2023-12-05 21:04:56,569 INFO L140 encePairwiseOnDemand]: 70/78 looper letters, 13 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2023-12-05 21:04:56,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 154 flow [2023-12-05 21:04:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-12-05 21:04:56,579 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2023-12-05 21:04:56,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 180 transitions. [2023-12-05 21:04:56,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 180 transitions. [2023-12-05 21:04:56,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:56,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 180 transitions. [2023-12-05 21:04:56,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:04:56,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:04:56,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:04:56,598 INFO L308 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2023-12-05 21:04:56,599 INFO L500 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 154 flow [2023-12-05 21:04:56,599 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,599 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:56,599 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:56,599 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:04:56,600 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:04:56,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1244440810, now seen corresponding path program 1 times [2023-12-05 21:04:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:56,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329862126] [2023-12-05 21:04:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:56,764 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:04:56,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:56,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329862126] [2023-12-05 21:04:56,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329862126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:56,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:56,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715463780] [2023-12-05 21:04:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:56,766 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:56,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:56,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:56,768 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 78 [2023-12-05 21:04:56,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:56,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 78 [2023-12-05 21:04:56,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:56,804 INFO L124 PetriNetUnfolderBase]: 8/88 cut-off events. [2023-12-05 21:04:56,804 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2023-12-05 21:04:56,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 88 events. 8/88 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 4 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 78. Up to 16 conditions per place. [2023-12-05 21:04:56,805 INFO L140 encePairwiseOnDemand]: 76/78 looper letters, 11 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2023-12-05 21:04:56,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 174 flow [2023-12-05 21:04:56,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2023-12-05 21:04:56,807 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7478632478632479 [2023-12-05 21:04:56,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 175 transitions. [2023-12-05 21:04:56,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 175 transitions. [2023-12-05 21:04:56,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:56,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 175 transitions. [2023-12-05 21:04:56,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:04:56,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:04:56,810 INFO L308 CegarLoopForPetriNet]: 75 programPoint places, -10 predicate places. [2023-12-05 21:04:56,810 INFO L500 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 174 flow [2023-12-05 21:04:56,810 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,810 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:56,811 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:56,811 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:04:56,811 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:04:56,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -290835508, now seen corresponding path program 1 times [2023-12-05 21:04:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:56,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443282283] [2023-12-05 21:04:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:56,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:56,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:56,876 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:56,876 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:56,879 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:56,879 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:56,879 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:04:56,880 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:56,883 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:56,883 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:04:56,916 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:56,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 110 transitions, 230 flow [2023-12-05 21:04:56,940 INFO L124 PetriNetUnfolderBase]: 13/138 cut-off events. [2023-12-05 21:04:56,942 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:56,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 138 events. 13/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 286 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2023-12-05 21:04:56,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 110 transitions, 230 flow [2023-12-05 21:04:56,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 110 transitions, 230 flow [2023-12-05 21:04:56,948 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:56,949 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;@5ba0b1e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:56,949 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:56,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:56,959 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-12-05 21:04:56,959 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:56,959 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:56,960 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:56,960 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:04:56,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash -644300587, now seen corresponding path program 1 times [2023-12-05 21:04:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:56,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627667037] [2023-12-05 21:04:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:57,020 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:04:57,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:57,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627667037] [2023-12-05 21:04:57,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627667037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:57,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845864382] [2023-12-05 21:04:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:57,022 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:57,024 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 110 [2023-12-05 21:04:57,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 110 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:04:57,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:57,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 110 [2023-12-05 21:04:57,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:57,143 INFO L124 PetriNetUnfolderBase]: 174/608 cut-off events. [2023-12-05 21:04:57,143 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-12-05 21:04:57,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 608 events. 174/608 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3633 event pairs, 108 based on Foata normal form. 159/667 useless extension candidates. Maximal degree in co-relation 305. Up to 237 conditions per place. [2023-12-05 21:04:57,149 INFO L140 encePairwiseOnDemand]: 98/110 looper letters, 18 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2023-12-05 21:04:57,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 216 flow [2023-12-05 21:04:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2023-12-05 21:04:57,152 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7727272727272727 [2023-12-05 21:04:57,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 255 transitions. [2023-12-05 21:04:57,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 255 transitions. [2023-12-05 21:04:57,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:57,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 255 transitions. [2023-12-05 21:04:57,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:04:57,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:04:57,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:04:57,159 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, -17 predicate places. [2023-12-05 21:04:57,159 INFO L500 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 216 flow [2023-12-05 21:04:57,159 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:04:57,159 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:57,159 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:57,160 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:04:57,160 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:04:57,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash -644300586, now seen corresponding path program 1 times [2023-12-05 21:04:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922284393] [2023-12-05 21:04:57,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:57,238 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:04:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922284393] [2023-12-05 21:04:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922284393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:57,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128361395] [2023-12-05 21:04:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:57,240 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:57,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:57,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:57,241 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2023-12-05 21:04:57,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 216 flow. Second operand has 3 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:04:57,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:57,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2023-12-05 21:04:57,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:57,295 INFO L124 PetriNetUnfolderBase]: 108/421 cut-off events. [2023-12-05 21:04:57,295 INFO L125 PetriNetUnfolderBase]: For 93/143 co-relation queries the response was YES. [2023-12-05 21:04:57,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 421 events. 108/421 cut-off events. For 93/143 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2153 event pairs, 64 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 259. Up to 150 conditions per place. [2023-12-05 21:04:57,299 INFO L140 encePairwiseOnDemand]: 108/110 looper letters, 16 selfloop transitions, 1 changer transitions 0/83 dead transitions. [2023-12-05 21:04:57,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 246 flow [2023-12-05 21:04:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2023-12-05 21:04:57,300 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2023-12-05 21:04:57,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2023-12-05 21:04:57,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2023-12-05 21:04:57,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:57,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2023-12-05 21:04:57,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:04:57,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:04:57,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:04:57,304 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, -16 predicate places. [2023-12-05 21:04:57,304 INFO L500 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 246 flow [2023-12-05 21:04:57,304 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:04:57,304 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:57,304 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:57,304 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:04:57,305 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:04:57,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash 104369122, now seen corresponding path program 1 times [2023-12-05 21:04:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475050676] [2023-12-05 21:04:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:57,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:57,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:57,345 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:57,345 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:57,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:57,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:57,348 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:04:57,348 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:57,349 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:57,349 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:04:57,375 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 142 transitions, 302 flow [2023-12-05 21:04:57,398 INFO L124 PetriNetUnfolderBase]: 19/185 cut-off events. [2023-12-05 21:04:57,398 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:04:57,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 19/185 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 465 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 142. Up to 8 conditions per place. [2023-12-05 21:04:57,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 142 transitions, 302 flow [2023-12-05 21:04:57,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 142 transitions, 302 flow [2023-12-05 21:04:57,403 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:57,404 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;@5ba0b1e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:57,405 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:57,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:57,408 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-12-05 21:04:57,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:57,409 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:57,409 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:57,409 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:04:57,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1353290091, now seen corresponding path program 1 times [2023-12-05 21:04:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:57,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058149982] [2023-12-05 21:04:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:57,446 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:04:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058149982] [2023-12-05 21:04:57,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058149982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:57,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:57,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:57,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445165716] [2023-12-05 21:04:57,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:57,448 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:57,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:57,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:57,449 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 142 [2023-12-05 21:04:57,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 142 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 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:04:57,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:57,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 142 [2023-12-05 21:04:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:57,786 INFO L124 PetriNetUnfolderBase]: 1424/3529 cut-off events. [2023-12-05 21:04:57,786 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2023-12-05 21:04:57,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5399 conditions, 3529 events. 1424/3529 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 29039 event pairs, 908 based on Foata normal form. 1237/4221 useless extension candidates. Maximal degree in co-relation 864. Up to 1742 conditions per place. [2023-12-05 21:04:57,813 INFO L140 encePairwiseOnDemand]: 126/142 looper letters, 23 selfloop transitions, 1 changer transitions 0/107 dead transitions. [2023-12-05 21:04:57,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 107 transitions, 280 flow [2023-12-05 21:04:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-12-05 21:04:57,815 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7746478873239436 [2023-12-05 21:04:57,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-12-05 21:04:57,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-12-05 21:04:57,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:57,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-12-05 21:04:57,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:04:57,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:04:57,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:04:57,819 INFO L308 CegarLoopForPetriNet]: 133 programPoint places, -23 predicate places. [2023-12-05 21:04:57,819 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 280 flow [2023-12-05 21:04:57,820 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 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:04:57,820 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:57,820 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:57,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:04:57,820 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:04:57,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1353290090, now seen corresponding path program 1 times [2023-12-05 21:04:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322117412] [2023-12-05 21:04:57,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:57,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:57,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322117412] [2023-12-05 21:04:57,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322117412] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:57,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:57,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604176218] [2023-12-05 21:04:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:57,890 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:57,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:57,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:57,891 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 142 [2023-12-05 21:04:57,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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:04:57,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:57,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 142 [2023-12-05 21:04:57,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:58,219 INFO L124 PetriNetUnfolderBase]: 908/2387 cut-off events. [2023-12-05 21:04:58,219 INFO L125 PetriNetUnfolderBase]: For 612/966 co-relation queries the response was YES. [2023-12-05 21:04:58,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 2387 events. 908/2387 cut-off events. For 612/966 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 18172 event pairs, 564 based on Foata normal form. 0/2102 useless extension candidates. Maximal degree in co-relation 745. Up to 1120 conditions per place. [2023-12-05 21:04:58,241 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 21 selfloop transitions, 1 changer transitions 0/106 dead transitions. [2023-12-05 21:04:58,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 320 flow [2023-12-05 21:04:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-12-05 21:04:58,243 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.744131455399061 [2023-12-05 21:04:58,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-12-05 21:04:58,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-12-05 21:04:58,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:58,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-12-05 21:04:58,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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:04:58,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:04:58,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:04:58,246 INFO L308 CegarLoopForPetriNet]: 133 programPoint places, -22 predicate places. [2023-12-05 21:04:58,246 INFO L500 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 320 flow [2023-12-05 21:04:58,246 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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:04:58,246 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:58,246 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:58,246 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:04:58,246 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:04:58,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1848246027, now seen corresponding path program 1 times [2023-12-05 21:04:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:58,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873254055] [2023-12-05 21:04:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:58,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:58,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:58,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:58,277 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:58,277 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:58,277 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:58,278 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:58,278 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:04:58,278 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:58,278 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:58,278 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:04:58,307 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:58,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 174 transitions, 376 flow [2023-12-05 21:04:58,329 INFO L124 PetriNetUnfolderBase]: 25/232 cut-off events. [2023-12-05 21:04:58,329 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:04:58,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 232 events. 25/232 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 638 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 193. Up to 10 conditions per place. [2023-12-05 21:04:58,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 174 transitions, 376 flow [2023-12-05 21:04:58,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 174 transitions, 376 flow [2023-12-05 21:04:58,334 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:58,334 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;@5ba0b1e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:58,334 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:58,338 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:58,338 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-12-05 21:04:58,338 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:58,338 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:58,338 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:58,338 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:04:58,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash 923557973, now seen corresponding path program 1 times [2023-12-05 21:04:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:58,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267482283] [2023-12-05 21:04:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:58,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:58,435 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:04:58,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267482283] [2023-12-05 21:04:58,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267482283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:58,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:58,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:58,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319629658] [2023-12-05 21:04:58,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:58,436 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:58,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:58,437 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 174 [2023-12-05 21:04:58,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 174 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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:04:58,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:58,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 174 [2023-12-05 21:04:58,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:00,473 INFO L124 PetriNetUnfolderBase]: 9924/20384 cut-off events. [2023-12-05 21:05:00,474 INFO L125 PetriNetUnfolderBase]: For 1921/1921 co-relation queries the response was YES. [2023-12-05 21:05:00,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32655 conditions, 20384 events. 9924/20384 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 196491 event pairs, 6408 based on Foata normal form. 8502/26116 useless extension candidates. Maximal degree in co-relation 5390. Up to 11517 conditions per place. [2023-12-05 21:05:00,658 INFO L140 encePairwiseOnDemand]: 154/174 looper letters, 28 selfloop transitions, 1 changer transitions 0/130 dead transitions. [2023-12-05 21:05:00,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 130 transitions, 346 flow [2023-12-05 21:05:00,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-12-05 21:05:00,660 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7758620689655172 [2023-12-05 21:05:00,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-12-05 21:05:00,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-12-05 21:05:00,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:00,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-12-05 21:05:00,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:00,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:00,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:00,663 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, -29 predicate places. [2023-12-05 21:05:00,663 INFO L500 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 346 flow [2023-12-05 21:05:00,663 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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:05:00,663 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:00,663 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:00,663 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:05:00,663 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:05:00,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 923557974, now seen corresponding path program 1 times [2023-12-05 21:05:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:00,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215209521] [2023-12-05 21:05:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:00,703 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:05:00,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:00,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215209521] [2023-12-05 21:05:00,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215209521] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:00,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:00,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:00,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642604743] [2023-12-05 21:05:00,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:00,704 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:00,705 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 174 [2023-12-05 21:05:00,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 346 flow. Second operand has 3 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:05:00,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:00,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 174 [2023-12-05 21:05:00,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:02,083 INFO L124 PetriNetUnfolderBase]: 6408/13717 cut-off events. [2023-12-05 21:05:02,083 INFO L125 PetriNetUnfolderBase]: For 3947/5821 co-relation queries the response was YES. [2023-12-05 21:05:02,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29417 conditions, 13717 events. 6408/13717 cut-off events. For 3947/5821 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 127416 event pairs, 4064 based on Foata normal form. 0/12257 useless extension candidates. Maximal degree in co-relation 4745. Up to 7470 conditions per place. [2023-12-05 21:05:02,205 INFO L140 encePairwiseOnDemand]: 172/174 looper letters, 26 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2023-12-05 21:05:02,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 129 transitions, 396 flow [2023-12-05 21:05:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-12-05 21:05:02,207 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7432950191570882 [2023-12-05 21:05:02,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-12-05 21:05:02,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-12-05 21:05:02,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:02,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-12-05 21:05:02,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:02,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:02,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:02,209 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, -28 predicate places. [2023-12-05 21:05:02,209 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 396 flow [2023-12-05 21:05:02,209 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:05:02,209 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:02,210 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:02,210 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:05:02,210 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:05:02,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash -218727141, now seen corresponding path program 1 times [2023-12-05 21:05:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:02,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708311164] [2023-12-05 21:05:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:02,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:02,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:02,233 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:02,233 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:02,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:02,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:02,234 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:05:02,234 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:02,235 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:02,235 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:05:02,255 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:02,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 206 transitions, 452 flow [2023-12-05 21:05:02,275 INFO L124 PetriNetUnfolderBase]: 31/279 cut-off events. [2023-12-05 21:05:02,276 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:05:02,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 279 events. 31/279 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 806 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 245. Up to 12 conditions per place. [2023-12-05 21:05:02,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 206 transitions, 452 flow [2023-12-05 21:05:02,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 206 transitions, 452 flow [2023-12-05 21:05:02,280 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:02,280 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;@5ba0b1e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:02,280 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:02,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:02,281 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-12-05 21:05:02,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:02,282 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:02,282 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:02,282 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:05:02,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1891276309, now seen corresponding path program 1 times [2023-12-05 21:05:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096209378] [2023-12-05 21:05:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:05:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096209378] [2023-12-05 21:05:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096209378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:02,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300523889] [2023-12-05 21:05:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:02,309 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:02,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:02,311 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 206 [2023-12-05 21:05:02,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 206 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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:05:02,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:02,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 206 [2023-12-05 21:05:02,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:14,108 INFO L124 PetriNetUnfolderBase]: 63674/115909 cut-off events. [2023-12-05 21:05:14,108 INFO L125 PetriNetUnfolderBase]: For 15196/15196 co-relation queries the response was YES. [2023-12-05 21:05:15,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192056 conditions, 115909 events. 63674/115909 cut-off events. For 15196/15196 co-relation queries the response was YES. Maximal size of possible extension queue 4082. Compared 1235414 event pairs, 41408 based on Foata normal form. 54202/156216 useless extension candidates. Maximal degree in co-relation 32770. Up to 71642 conditions per place. [2023-12-05 21:05:16,017 INFO L140 encePairwiseOnDemand]: 182/206 looper letters, 33 selfloop transitions, 1 changer transitions 0/153 dead transitions. [2023-12-05 21:05:16,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 153 transitions, 414 flow [2023-12-05 21:05:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-12-05 21:05:16,019 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7766990291262136 [2023-12-05 21:05:16,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-12-05 21:05:16,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-12-05 21:05:16,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:16,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-12-05 21:05:16,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 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:05:16,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:05:16,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:05:16,024 INFO L308 CegarLoopForPetriNet]: 191 programPoint places, -35 predicate places. [2023-12-05 21:05:16,024 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 414 flow [2023-12-05 21:05:16,024 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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:05:16,024 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:16,024 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:16,025 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:05:16,025 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:05:16,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:16,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1891276310, now seen corresponding path program 1 times [2023-12-05 21:05:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:16,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480872094] [2023-12-05 21:05:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:16,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:16,082 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:05:16,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480872094] [2023-12-05 21:05:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480872094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:16,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431625367] [2023-12-05 21:05:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:16,083 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:16,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:16,085 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 206 [2023-12-05 21:05:16,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:16,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:16,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 206 [2023-12-05 21:05:16,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:24,357 INFO L124 PetriNetUnfolderBase]: 41408/77867 cut-off events. [2023-12-05 21:05:24,358 INFO L125 PetriNetUnfolderBase]: For 25347/34821 co-relation queries the response was YES. [2023-12-05 21:05:25,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175818 conditions, 77867 events. 41408/77867 cut-off events. For 25347/34821 co-relation queries the response was YES. Maximal size of possible extension queue 2705. Compared 815867 event pairs, 26564 based on Foata normal form. 0/70532 useless extension candidates. Maximal degree in co-relation 29525. Up to 46720 conditions per place. [2023-12-05 21:05:25,550 INFO L140 encePairwiseOnDemand]: 204/206 looper letters, 31 selfloop transitions, 1 changer transitions 0/152 dead transitions. [2023-12-05 21:05:25,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 152 transitions, 474 flow [2023-12-05 21:05:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-12-05 21:05:25,660 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7427184466019418 [2023-12-05 21:05:25,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-12-05 21:05:25,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-12-05 21:05:25,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:25,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-12-05 21:05:25,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 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:05:25,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:05:25,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:05:25,662 INFO L308 CegarLoopForPetriNet]: 191 programPoint places, -34 predicate places. [2023-12-05 21:05:25,662 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 152 transitions, 474 flow [2023-12-05 21:05:25,663 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:25,663 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:25,663 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:25,663 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:05:25,663 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:05:25,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1386322998, now seen corresponding path program 1 times [2023-12-05 21:05:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502411592] [2023-12-05 21:05:25,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:25,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:25,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:25,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:25,700 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:25,700 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:25,700 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:25,700 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:25,701 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:05:25,701 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:25,701 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:25,701 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:05:25,732 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:25,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 238 transitions, 530 flow [2023-12-05 21:05:25,757 INFO L124 PetriNetUnfolderBase]: 37/326 cut-off events. [2023-12-05 21:05:25,757 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:05:25,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 326 events. 37/326 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1013 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 298. Up to 14 conditions per place. [2023-12-05 21:05:25,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 238 transitions, 530 flow [2023-12-05 21:05:25,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 238 transitions, 530 flow [2023-12-05 21:05:25,762 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:25,762 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;@5ba0b1e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:25,762 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:25,764 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:25,764 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-12-05 21:05:25,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:25,764 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:25,764 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:25,764 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:05:25,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1549864917, now seen corresponding path program 1 times [2023-12-05 21:05:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:25,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380281704] [2023-12-05 21:05:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:25,791 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:05:25,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:25,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380281704] [2023-12-05 21:05:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380281704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:25,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:25,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198065207] [2023-12-05 21:05:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:25,793 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:25,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:25,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:25,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:25,794 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 238 [2023-12-05 21:05:25,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 238 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 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:05:25,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:25,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 238 [2023-12-05 21:05:25,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand