/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 19:24:41,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 19:24:41,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 19:24:41,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 19:24:41,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 19:24:41,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 19:24:41,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 19:24:41,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 19:24:41,858 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 19:24:41,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 19:24:41,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 19:24:41,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 19:24:41,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 19:24:41,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 19:24:41,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 19:24:41,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 19:24:41,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 19:24:41,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 19:24:41,863 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 19:24:41,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 19:24:41,863 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 19:24:41,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 19:24:41,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 19:24:41,864 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 19:24:41,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 19:24:41,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 19:24:41,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 19:24:41,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 19:24:41,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 19:24:41,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 19:24:41,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 19:24:41,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 19:24:41,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 19:24:41,866 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 [2023-11-29 19:24:42,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 19:24:42,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 19:24:42,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 19:24:42,054 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 19:24:42,056 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 19:24:42,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs-pthread.i [2023-11-29 19:24:43,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 19:24:43,187 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 19:24:43,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs-pthread.i [2023-11-29 19:24:43,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c67a648d/8b0b9d8bd9b64fe983fac80a126fee28/FLAGfc025a0c1 [2023-11-29 19:24:43,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c67a648d/8b0b9d8bd9b64fe983fac80a126fee28 [2023-11-29 19:24:43,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 19:24:43,211 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 19:24:43,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 19:24:43,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 19:24:43,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 19:24:43,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae63596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43, skipping insertion in model container [2023-11-29 19:24:43,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,254 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 19:24:43,504 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs-pthread.i[30711,30724] [2023-11-29 19:24:43,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 19:24:43,524 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 19:24:43,557 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs-pthread.i[30711,30724] [2023-11-29 19:24:43,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 19:24:43,592 INFO L206 MainTranslator]: Completed translation [2023-11-29 19:24:43,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43 WrapperNode [2023-11-29 19:24:43,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 19:24:43,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 19:24:43,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 19:24:43,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 19:24:43,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,634 INFO L138 Inliner]: procedures = 165, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2023-11-29 19:24:43,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 19:24:43,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 19:24:43,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 19:24:43,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 19:24:43,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 19:24:43,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 19:24:43,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 19:24:43,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 19:24:43,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (1/1) ... [2023-11-29 19:24:43,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 19:24:43,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:24:43,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 19:24:43,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 19:24:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-29 19:24:43,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-29 19:24:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-29 19:24:43,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-29 19:24:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 19:24:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 19:24:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 19:24:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 19:24:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 19:24:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 19:24:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 19:24:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 19:24:43,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 19:24:43,702 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 19:24:43,789 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 19:24:43,790 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 19:24:43,889 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 19:24:43,904 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 19:24:43,904 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 19:24:43,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:24:43 BoogieIcfgContainer [2023-11-29 19:24:43,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 19:24:43,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 19:24:43,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 19:24:43,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 19:24:43,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:24:43" (1/3) ... [2023-11-29 19:24:43,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cfc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:24:43, skipping insertion in model container [2023-11-29 19:24:43,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:24:43" (2/3) ... [2023-11-29 19:24:43,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cfc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:24:43, skipping insertion in model container [2023-11-29 19:24:43,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:24:43" (3/3) ... [2023-11-29 19:24:43,910 INFO L112 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs-pthread.i [2023-11-29 19:24:43,921 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 19:24:43,921 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 19:24:43,921 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 19:24:43,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 19:24:44,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 178 flow [2023-11-29 19:24:44,048 INFO L124 PetriNetUnfolderBase]: 6/95 cut-off events. [2023-11-29 19:24:44,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 19:24:44,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 6/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 76. Up to 4 conditions per place. [2023-11-29 19:24:44,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 178 flow [2023-11-29 19:24:44,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 84 transitions, 175 flow [2023-11-29 19:24:44,062 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 19:24:44,066 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;@45a2008e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 19:24:44,067 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 19:24:44,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 19:24:44,077 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2023-11-29 19:24:44,077 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 19:24:44,077 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:44,078 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:24:44,078 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 19:24:44,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1705451443, now seen corresponding path program 1 times [2023-11-29 19:24:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8278063] [2023-11-29 19:24:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:24:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:24:44,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:24:44,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8278063] [2023-11-29 19:24:44,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8278063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:24:44,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:24:44,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:24:44,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442840619] [2023-11-29 19:24:44,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:24:44,282 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:24:44,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:24:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:24:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:24:44,310 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 85 [2023-11-29 19:24:44,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:44,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:24:44,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 85 [2023-11-29 19:24:44,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:24:44,422 INFO L124 PetriNetUnfolderBase]: 62/236 cut-off events. [2023-11-29 19:24:44,423 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 19:24:44,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 236 events. 62/236 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 747 event pairs, 18 based on Foata normal form. 103/322 useless extension candidates. Maximal degree in co-relation 349. Up to 100 conditions per place. [2023-11-29 19:24:44,427 INFO L140 encePairwiseOnDemand]: 77/85 looper letters, 20 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-29 19:24:44,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 199 flow [2023-11-29 19:24:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:24:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:24:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2023-11-29 19:24:44,438 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8313725490196079 [2023-11-29 19:24:44,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 212 transitions. [2023-11-29 19:24:44,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 212 transitions. [2023-11-29 19:24:44,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:24:44,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 212 transitions. [2023-11-29 19:24:44,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:44,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:44,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:44,451 INFO L307 CegarLoopForPetriNet]: 85 programPoint places, -8 predicate places. [2023-11-29 19:24:44,451 INFO L500 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 199 flow [2023-11-29 19:24:44,452 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:44,452 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:44,452 INFO L232 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] [2023-11-29 19:24:44,452 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 19:24:44,453 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 19:24:44,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1899453625, now seen corresponding path program 1 times [2023-11-29 19:24:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:44,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839781731] [2023-11-29 19:24:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:44,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 19:24:44,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 19:24:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 19:24:44,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 19:24:44,521 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-29 19:24:44,522 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-29 19:24:44,523 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-29 19:24:44,524 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-29 19:24:44,524 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-29 19:24:44,524 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 19:24:44,524 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 19:24:44,526 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 19:24:44,526 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 19:24:44,553 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 19:24:44,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 133 transitions, 286 flow [2023-11-29 19:24:44,572 INFO L124 PetriNetUnfolderBase]: 8/140 cut-off events. [2023-11-29 19:24:44,572 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 19:24:44,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 140 events. 8/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 147. Up to 6 conditions per place. [2023-11-29 19:24:44,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 133 transitions, 286 flow [2023-11-29 19:24:44,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 116 transitions, 245 flow [2023-11-29 19:24:44,575 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 19:24:44,576 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;@45a2008e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 19:24:44,576 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 19:24:44,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 19:24:44,579 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-29 19:24:44,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 19:24:44,579 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:44,579 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:24:44,579 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 19:24:44,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash -577715903, now seen corresponding path program 1 times [2023-11-29 19:24:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:44,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70015091] [2023-11-29 19:24:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:44,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:24:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:24:44,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:24:44,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70015091] [2023-11-29 19:24:44,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70015091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:24:44,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:24:44,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:24:44,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125864866] [2023-11-29 19:24:44,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:24:44,632 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:24:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:24:44,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:24:44,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:24:44,634 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 133 [2023-11-29 19:24:44,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:44,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:24:44,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 133 [2023-11-29 19:24:44,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:24:45,042 INFO L124 PetriNetUnfolderBase]: 1666/3523 cut-off events. [2023-11-29 19:24:45,042 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2023-11-29 19:24:45,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6292 conditions, 3523 events. 1666/3523 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 24976 event pairs, 673 based on Foata normal form. 1437/4776 useless extension candidates. Maximal degree in co-relation 6262. Up to 2444 conditions per place. [2023-11-29 19:24:45,074 INFO L140 encePairwiseOnDemand]: 124/133 looper letters, 39 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2023-11-29 19:24:45,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 113 transitions, 328 flow [2023-11-29 19:24:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:24:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:24:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-11-29 19:24:45,079 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7769423558897243 [2023-11-29 19:24:45,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-11-29 19:24:45,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-11-29 19:24:45,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:24:45,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-11-29 19:24:45,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:45,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:45,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:45,089 INFO L307 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2023-11-29 19:24:45,089 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 113 transitions, 328 flow [2023-11-29 19:24:45,090 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:45,090 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:45,090 INFO L232 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] [2023-11-29 19:24:45,090 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 19:24:45,091 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 19:24:45,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:45,091 INFO L85 PathProgramCache]: Analyzing trace with hash 978299812, now seen corresponding path program 1 times [2023-11-29 19:24:45,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:45,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579132702] [2023-11-29 19:24:45,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:45,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 19:24:45,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 19:24:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 19:24:45,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 19:24:45,140 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-29 19:24:45,140 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-29 19:24:45,140 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-29 19:24:45,140 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-29 19:24:45,140 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-29 19:24:45,141 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-29 19:24:45,141 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 19:24:45,141 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 19:24:45,141 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 19:24:45,141 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 19:24:45,177 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 19:24:45,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 181 transitions, 398 flow [2023-11-29 19:24:45,199 INFO L124 PetriNetUnfolderBase]: 10/185 cut-off events. [2023-11-29 19:24:45,200 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 19:24:45,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 185 events. 10/185 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 448 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 196. Up to 8 conditions per place. [2023-11-29 19:24:45,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 181 transitions, 398 flow [2023-11-29 19:24:45,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 148 transitions, 317 flow [2023-11-29 19:24:45,205 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 19:24:45,207 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;@45a2008e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 19:24:45,207 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 19:24:45,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 19:24:45,210 INFO L124 PetriNetUnfolderBase]: 3/44 cut-off events. [2023-11-29 19:24:45,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 19:24:45,210 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:45,210 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:24:45,213 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 19:24:45,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1131793915, now seen corresponding path program 1 times [2023-11-29 19:24:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111343769] [2023-11-29 19:24:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:24:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:24:45,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:24:45,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111343769] [2023-11-29 19:24:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111343769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:24:45,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:24:45,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:24:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285337369] [2023-11-29 19:24:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:24:45,275 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:24:45,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:24:45,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:24:45,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:24:45,277 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 181 [2023-11-29 19:24:45,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 148 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:45,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:24:45,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 181 [2023-11-29 19:24:45,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:24:50,446 INFO L124 PetriNetUnfolderBase]: 32841/56616 cut-off events. [2023-11-29 19:24:50,446 INFO L125 PetriNetUnfolderBase]: For 5210/5210 co-relation queries the response was YES. [2023-11-29 19:24:50,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104863 conditions, 56616 events. 32841/56616 cut-off events. For 5210/5210 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 521715 event pairs, 16591 based on Foata normal form. 18959/73215 useless extension candidates. Maximal degree in co-relation 104832. Up to 44217 conditions per place. [2023-11-29 19:24:50,881 INFO L140 encePairwiseOnDemand]: 171/181 looper letters, 55 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2023-11-29 19:24:50,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 149 transitions, 449 flow [2023-11-29 19:24:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:24:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:24:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-11-29 19:24:50,883 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7458563535911602 [2023-11-29 19:24:50,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-11-29 19:24:50,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-11-29 19:24:50,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:24:50,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-11-29 19:24:50,885 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-11-29 19:24:50,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:50,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:50,886 INFO L307 CegarLoopForPetriNet]: 151 programPoint places, -8 predicate places. [2023-11-29 19:24:50,887 INFO L500 AbstractCegarLoop]: Abstraction has has 143 places, 149 transitions, 449 flow [2023-11-29 19:24:50,887 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:50,887 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:50,887 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:24:50,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 19:24:50,887 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 19:24:50,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash 194492299, now seen corresponding path program 1 times [2023-11-29 19:24:50,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:50,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152983697] [2023-11-29 19:24:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:50,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:24:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:24:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:24:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152983697] [2023-11-29 19:24:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152983697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:24:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:24:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:24:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22290667] [2023-11-29 19:24:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:24:50,980 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:24:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:24:50,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:24:50,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:24:50,982 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 181 [2023-11-29 19:24:50,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 149 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:50,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:24:50,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 181 [2023-11-29 19:24:50,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:24:51,275 INFO L124 PetriNetUnfolderBase]: 339/1962 cut-off events. [2023-11-29 19:24:51,275 INFO L125 PetriNetUnfolderBase]: For 3137/3180 co-relation queries the response was YES. [2023-11-29 19:24:51,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 1962 events. 339/1962 cut-off events. For 3137/3180 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 15935 event pairs, 43 based on Foata normal form. 1675/3590 useless extension candidates. Maximal degree in co-relation 4513. Up to 1151 conditions per place. [2023-11-29 19:24:51,282 INFO L140 encePairwiseOnDemand]: 167/181 looper letters, 17 selfloop transitions, 19 changer transitions 0/154 dead transitions. [2023-11-29 19:24:51,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 154 transitions, 568 flow [2023-11-29 19:24:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:24:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:24:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-11-29 19:24:51,283 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8195211786372008 [2023-11-29 19:24:51,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-11-29 19:24:51,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-11-29 19:24:51,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:24:51,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-11-29 19:24:51,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,286 INFO L307 CegarLoopForPetriNet]: 151 programPoint places, -6 predicate places. [2023-11-29 19:24:51,286 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 154 transitions, 568 flow [2023-11-29 19:24:51,286 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,286 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:51,287 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:24:51,287 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 19:24:51,287 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 19:24:51,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash 663171455, now seen corresponding path program 1 times [2023-11-29 19:24:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593318782] [2023-11-29 19:24:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:24:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:24:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:24:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593318782] [2023-11-29 19:24:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593318782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:24:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:24:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 19:24:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050555521] [2023-11-29 19:24:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:24:51,364 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 19:24:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:24:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 19:24:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 19:24:51,369 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 181 [2023-11-29 19:24:51,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 154 transitions, 568 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:24:51,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 181 [2023-11-29 19:24:51,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:24:51,752 INFO L124 PetriNetUnfolderBase]: 894/3224 cut-off events. [2023-11-29 19:24:51,752 INFO L125 PetriNetUnfolderBase]: For 3839/3934 co-relation queries the response was YES. [2023-11-29 19:24:51,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9231 conditions, 3224 events. 894/3224 cut-off events. For 3839/3934 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 27979 event pairs, 255 based on Foata normal form. 0/3154 useless extension candidates. Maximal degree in co-relation 9189. Up to 1990 conditions per place. [2023-11-29 19:24:51,776 INFO L140 encePairwiseOnDemand]: 170/181 looper letters, 88 selfloop transitions, 12 changer transitions 0/186 dead transitions. [2023-11-29 19:24:51,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 186 transitions, 1014 flow [2023-11-29 19:24:51,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 19:24:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 19:24:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1066 transitions. [2023-11-29 19:24:51,778 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6543891958256599 [2023-11-29 19:24:51,778 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1066 transitions. [2023-11-29 19:24:51,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1066 transitions. [2023-11-29 19:24:51,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:24:51,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1066 transitions. [2023-11-29 19:24:51,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,783 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,785 INFO L307 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2023-11-29 19:24:51,786 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 186 transitions, 1014 flow [2023-11-29 19:24:51,786 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,786 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:51,786 INFO L232 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] [2023-11-29 19:24:51,786 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 19:24:51,786 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 19:24:51,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1191226878, now seen corresponding path program 1 times [2023-11-29 19:24:51,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:51,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636126231] [2023-11-29 19:24:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 19:24:51,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 19:24:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 19:24:51,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 19:24:51,826 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-29 19:24:51,828 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-29 19:24:51,828 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-29 19:24:51,828 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-29 19:24:51,828 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-29 19:24:51,828 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-29 19:24:51,828 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-29 19:24:51,828 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 19:24:51,828 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 19:24:51,829 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 19:24:51,829 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-29 19:24:51,862 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 19:24:51,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 229 transitions, 514 flow [2023-11-29 19:24:51,883 INFO L124 PetriNetUnfolderBase]: 12/230 cut-off events. [2023-11-29 19:24:51,883 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 19:24:51,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 230 events. 12/230 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 639 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 246. Up to 10 conditions per place. [2023-11-29 19:24:51,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 229 transitions, 514 flow [2023-11-29 19:24:51,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 180 transitions, 391 flow [2023-11-29 19:24:51,888 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 19:24:51,889 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;@45a2008e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 19:24:51,889 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 19:24:51,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 19:24:51,890 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-29 19:24:51,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 19:24:51,890 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:24:51,890 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:24:51,891 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 19:24:51,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:24:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash 927281817, now seen corresponding path program 1 times [2023-11-29 19:24:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:24:51,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262291239] [2023-11-29 19:24:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:24:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:24:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:24:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:24:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:24:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262291239] [2023-11-29 19:24:51,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262291239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:24:51,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:24:51,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:24:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22726792] [2023-11-29 19:24:51,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:24:51,939 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:24:51,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:24:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:24:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:24:51,940 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 229 [2023-11-29 19:24:51,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 180 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:24:51,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:24:51,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 229 [2023-11-29 19:24:51,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:26:21,852 INFO L124 PetriNetUnfolderBase]: 570755/879971 cut-off events. [2023-11-29 19:26:21,853 INFO L125 PetriNetUnfolderBase]: For 114793/114793 co-relation queries the response was YES. [2023-11-29 19:26:25,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663647 conditions, 879971 events. 570755/879971 cut-off events. For 114793/114793 co-relation queries the response was YES. Maximal size of possible extension queue 18721. Compared 9279025 event pairs, 329154 based on Foata normal form. 247285/1096396 useless extension candidates. Maximal degree in co-relation 1663615. Up to 723559 conditions per place. [2023-11-29 19:26:31,152 INFO L140 encePairwiseOnDemand]: 218/229 looper letters, 71 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2023-11-29 19:26:31,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 185 transitions, 574 flow [2023-11-29 19:26:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:26:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:26:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2023-11-29 19:26:31,156 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.727802037845706 [2023-11-29 19:26:31,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2023-11-29 19:26:31,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2023-11-29 19:26:31,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:26:31,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2023-11-29 19:26:31,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:31,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:31,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:31,179 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -8 predicate places. [2023-11-29 19:26:31,179 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 185 transitions, 574 flow [2023-11-29 19:26:31,179 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:31,179 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:26:31,184 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:26:31,184 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 19:26:31,184 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 19:26:31,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:26:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1213584148, now seen corresponding path program 1 times [2023-11-29 19:26:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:26:31,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713038926] [2023-11-29 19:26:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:26:31,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:26:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:26:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:26:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:26:31,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713038926] [2023-11-29 19:26:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713038926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:26:31,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:26:31,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:26:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225394604] [2023-11-29 19:26:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:26:31,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:26:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:26:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:26:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:26:31,321 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 229 [2023-11-29 19:26:31,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 185 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:31,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:26:31,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 229 [2023-11-29 19:26:31,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:26:32,295 INFO L124 PetriNetUnfolderBase]: 1445/7611 cut-off events. [2023-11-29 19:26:32,295 INFO L125 PetriNetUnfolderBase]: For 18459/18473 co-relation queries the response was YES. [2023-11-29 19:26:32,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19023 conditions, 7611 events. 1445/7611 cut-off events. For 18459/18473 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 83768 event pairs, 244 based on Foata normal form. 8798/16277 useless extension candidates. Maximal degree in co-relation 18983. Up to 4785 conditions per place. [2023-11-29 19:26:32,353 INFO L140 encePairwiseOnDemand]: 211/229 looper letters, 21 selfloop transitions, 24 changer transitions 0/192 dead transitions. [2023-11-29 19:26:32,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 192 transitions, 737 flow [2023-11-29 19:26:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:26:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:26:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2023-11-29 19:26:32,356 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8165938864628821 [2023-11-29 19:26:32,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2023-11-29 19:26:32,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2023-11-29 19:26:32,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:26:32,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2023-11-29 19:26:32,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:32,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:32,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:32,372 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -6 predicate places. [2023-11-29 19:26:32,372 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 192 transitions, 737 flow [2023-11-29 19:26:32,373 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:32,373 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:26:32,373 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:26:32,373 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 19:26:32,373 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 19:26:32,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:26:32,373 INFO L85 PathProgramCache]: Analyzing trace with hash 538726338, now seen corresponding path program 1 times [2023-11-29 19:26:32,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:26:32,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298785936] [2023-11-29 19:26:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:26:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:26:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:26:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:26:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:26:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298785936] [2023-11-29 19:26:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298785936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:26:32,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:26:32,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 19:26:32,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839649569] [2023-11-29 19:26:32,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:26:32,534 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 19:26:32,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:26:32,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 19:26:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 19:26:32,535 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 229 [2023-11-29 19:26:32,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 192 transitions, 737 flow. Second operand has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:32,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:26:32,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 229 [2023-11-29 19:26:32,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:26:34,655 INFO L124 PetriNetUnfolderBase]: 3929/13327 cut-off events. [2023-11-29 19:26:34,656 INFO L125 PetriNetUnfolderBase]: For 22066/22287 co-relation queries the response was YES. [2023-11-29 19:26:34,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39917 conditions, 13327 events. 3929/13327 cut-off events. For 22066/22287 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 149450 event pairs, 1167 based on Foata normal form. 44/13151 useless extension candidates. Maximal degree in co-relation 39874. Up to 8907 conditions per place. [2023-11-29 19:26:34,748 INFO L140 encePairwiseOnDemand]: 217/229 looper letters, 115 selfloop transitions, 14 changer transitions 0/234 dead transitions. [2023-11-29 19:26:34,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 234 transitions, 1360 flow [2023-11-29 19:26:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 19:26:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 19:26:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1326 transitions. [2023-11-29 19:26:34,754 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6433770014556041 [2023-11-29 19:26:34,754 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1326 transitions. [2023-11-29 19:26:34,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1326 transitions. [2023-11-29 19:26:34,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:26:34,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1326 transitions. [2023-11-29 19:26:34,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 147.33333333333334) internal successors, (1326), 9 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:34,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:34,762 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:34,763 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, 2 predicate places. [2023-11-29 19:26:34,763 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 234 transitions, 1360 flow [2023-11-29 19:26:34,764 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:34,764 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:26:34,764 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:26:34,764 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 19:26:34,764 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 19:26:34,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:26:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash 778150866, now seen corresponding path program 1 times [2023-11-29 19:26:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:26:34,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897034920] [2023-11-29 19:26:34,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:26:34,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:26:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:26:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 19:26:34,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:26:34,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897034920] [2023-11-29 19:26:34,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897034920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:26:34,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:26:34,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 19:26:34,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066057590] [2023-11-29 19:26:34,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:26:34,899 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 19:26:34,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:26:34,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 19:26:34,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 19:26:34,901 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 229 [2023-11-29 19:26:34,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 234 transitions, 1360 flow. Second operand has 7 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:34,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:26:34,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 229 [2023-11-29 19:26:34,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:26:38,203 INFO L124 PetriNetUnfolderBase]: 8325/22094 cut-off events. [2023-11-29 19:26:38,204 INFO L125 PetriNetUnfolderBase]: For 45788/46142 co-relation queries the response was YES. [2023-11-29 19:26:38,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75677 conditions, 22094 events. 8325/22094 cut-off events. For 45788/46142 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 249145 event pairs, 2907 based on Foata normal form. 12/21742 useless extension candidates. Maximal degree in co-relation 75631. Up to 13223 conditions per place. [2023-11-29 19:26:38,418 INFO L140 encePairwiseOnDemand]: 217/229 looper letters, 147 selfloop transitions, 14 changer transitions 0/269 dead transitions. [2023-11-29 19:26:38,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 269 transitions, 2034 flow [2023-11-29 19:26:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 19:26:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 19:26:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1320 transitions. [2023-11-29 19:26:38,444 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6404657933042213 [2023-11-29 19:26:38,445 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1320 transitions. [2023-11-29 19:26:38,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1320 transitions. [2023-11-29 19:26:38,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:26:38,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1320 transitions. [2023-11-29 19:26:38,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 146.66666666666666) internal successors, (1320), 9 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:38,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:38,451 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:38,451 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, 10 predicate places. [2023-11-29 19:26:38,451 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 269 transitions, 2034 flow [2023-11-29 19:26:38,453 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:38,453 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:26:38,453 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:26:38,453 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 19:26:38,453 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 19:26:38,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:26:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2030652159, now seen corresponding path program 1 times [2023-11-29 19:26:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:26:38,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115909252] [2023-11-29 19:26:38,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:26:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:26:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 19:26:38,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 19:26:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 19:26:38,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 19:26:38,514 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-29 19:26:38,514 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-29 19:26:38,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-29 19:26:38,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-29 19:26:38,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-11-29 19:26:38,516 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-11-29 19:26:38,517 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-11-29 19:26:38,517 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-29 19:26:38,517 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 19:26:38,517 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 19:26:38,518 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 19:26:38,518 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-29 19:26:38,563 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 19:26:38,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 277 transitions, 634 flow [2023-11-29 19:26:38,589 INFO L124 PetriNetUnfolderBase]: 14/275 cut-off events. [2023-11-29 19:26:38,589 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 19:26:38,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 275 events. 14/275 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 838 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 297. Up to 12 conditions per place. [2023-11-29 19:26:38,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 277 transitions, 634 flow [2023-11-29 19:26:38,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 212 transitions, 467 flow [2023-11-29 19:26:38,593 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 19:26:38,593 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;@45a2008e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 19:26:38,593 INFO L363 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 19:26:38,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 19:26:38,595 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-29 19:26:38,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 19:26:38,595 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:26:38,595 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 19:26:38,595 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2023-11-29 19:26:38,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:26:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -470463363, now seen corresponding path program 1 times [2023-11-29 19:26:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:26:38,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312728887] [2023-11-29 19:26:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:26:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:26:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:26:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:26:38,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:26:38,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312728887] [2023-11-29 19:26:38,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312728887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:26:38,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:26:38,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:26:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372171022] [2023-11-29 19:26:38,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:26:38,618 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:26:38,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:26:38,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:26:38,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:26:38,619 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 277 [2023-11-29 19:26:38,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 212 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 19:26:38,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:26:38,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 277 [2023-11-29 19:26:38,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand