/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:21:31,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:21:31,594 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-SemanticLbe.epf [2023-11-17 11:21:31,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:21:31,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:21:31,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:21:31,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:21:31,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:21:31,622 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:21:31,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:21:31,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:21:31,626 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:21:31,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:21:31,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:21:31,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:21:31,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:21:31,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:21:31,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:21:31,627 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:21:31,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:21:31,628 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:21:31,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:21:31,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:21:31,629 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:21:31,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:21:31,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:21:31,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:21:31,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:21:31,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:21:31,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:21:31,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:21:31,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:21:31,631 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.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:21:31,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:21:31,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:21:31,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:21:31,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:21:31,855 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:21:31,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2023-11-17 11:21:32,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:21:33,133 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:21:33,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2023-11-17 11:21:33,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c523f77/dd84ce45dc224f5eba08faefbce85039/FLAG285284a31 [2023-11-17 11:21:33,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c523f77/dd84ce45dc224f5eba08faefbce85039 [2023-11-17 11:21:33,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:21:33,160 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:21:33,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:21:33,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:21:33,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:21:33,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40536223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33, skipping insertion in model container [2023-11-17 11:21:33,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,192 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:21:33,449 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/29_conditionals_vs.i[30422,30435] [2023-11-17 11:21:33,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:21:33,466 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:21:33,498 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/29_conditionals_vs.i[30422,30435] [2023-11-17 11:21:33,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:21:33,529 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:21:33,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33 WrapperNode [2023-11-17 11:21:33,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:21:33,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:21:33,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:21:33,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:21:33,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,567 INFO L138 Inliner]: procedures = 170, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 60 [2023-11-17 11:21:33,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:21:33,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:21:33,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:21:33,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:21:33,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:21:33,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:21:33,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:21:33,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:21:33,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (1/1) ... [2023-11-17 11:21:33,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:21:33,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:21:33,631 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-17 11:21:33,648 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-17 11:21:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-17 11:21:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-17 11:21:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:21:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:21:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:21:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:21:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:21:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:21:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:21:33,658 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:21:33,765 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:21:33,767 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:21:33,866 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:21:33,947 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:21:33,947 INFO L307 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-17 11:21:33,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:21:33 BoogieIcfgContainer [2023-11-17 11:21:33,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:21:33,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:21:33,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:21:33,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:21:33,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:21:33" (1/3) ... [2023-11-17 11:21:33,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e00910d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:21:33, skipping insertion in model container [2023-11-17 11:21:33,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:21:33" (2/3) ... [2023-11-17 11:21:33,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e00910d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:21:33, skipping insertion in model container [2023-11-17 11:21:33,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:21:33" (3/3) ... [2023-11-17 11:21:33,958 INFO L112 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2023-11-17 11:21:33,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:21:33,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:21:33,970 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:21:34,007 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:21:34,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2023-11-17 11:21:34,065 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2023-11-17 11:21:34,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:34,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 3 conditions per place. [2023-11-17 11:21:34,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2023-11-17 11:21:34,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2023-11-17 11:21:34,072 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:21:34,080 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 19 transitions, 42 flow [2023-11-17 11:21:34,082 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 19 transitions, 42 flow [2023-11-17 11:21:34,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2023-11-17 11:21:34,087 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2023-11-17 11:21:34,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:34,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 3 conditions per place. [2023-11-17 11:21:34,087 INFO L119 LiptonReduction]: Number of co-enabled transitions 104 [2023-11-17 11:21:34,868 INFO L134 LiptonReduction]: Checked pairs total: 128 [2023-11-17 11:21:34,868 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-11-17 11:21:34,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:21:34,890 INFO L357 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=false, 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;@b02488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:21:34,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 11:21:34,892 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:21:34,892 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-17 11:21:34,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:34,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:34,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:21:34,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 11:21:34,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 6192117, now seen corresponding path program 1 times [2023-11-17 11:21:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684023216] [2023-11-17 11:21:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:34,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:21:35,046 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-17 11:21:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:21:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684023216] [2023-11-17 11:21:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684023216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:21:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:21:35,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:21:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320900940] [2023-11-17 11:21:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:21:35,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:21:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:21:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:21:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:21:35,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2023-11-17 11:21:35,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 8 transitions, 20 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:35,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:21:35,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2023-11-17 11:21:35,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:21:35,111 INFO L124 PetriNetUnfolderBase]: 2/12 cut-off events. [2023-11-17 11:21:35,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:35,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 12 events. 2/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 2 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2023-11-17 11:21:35,112 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 5 selfloop transitions, 0 changer transitions 0/6 dead transitions. [2023-11-17 11:21:35,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 26 flow [2023-11-17 11:21:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:21:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:21:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2023-11-17 11:21:35,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2023-11-17 11:21:35,121 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 23 transitions. [2023-11-17 11:21:35,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 23 transitions. [2023-11-17 11:21:35,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:21:35,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 23 transitions. [2023-11-17 11:21:35,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:35,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:35,126 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:35,127 INFO L175 Difference]: Start difference. First operand has 11 places, 8 transitions, 20 flow. Second operand 2 states and 23 transitions. [2023-11-17 11:21:35,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 26 flow [2023-11-17 11:21:35,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 26 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:21:35,129 INFO L231 Difference]: Finished difference. Result has 10 places, 6 transitions, 16 flow [2023-11-17 11:21:35,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=16, PETRI_PLACES=10, PETRI_TRANSITIONS=6} [2023-11-17 11:21:35,132 INFO L281 CegarLoopForPetriNet]: 11 programPoint places, -1 predicate places. [2023-11-17 11:21:35,133 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 6 transitions, 16 flow [2023-11-17 11:21:35,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:35,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:35,133 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-17 11:21:35,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:21:35,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 11:21:35,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1655626239, now seen corresponding path program 1 times [2023-11-17 11:21:35,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937563665] [2023-11-17 11:21:35,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:35,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:21:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:35,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:21:35,203 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:21:35,204 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-17 11:21:35,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-17 11:21:35,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-17 11:21:35,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:21:35,206 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:21:35,207 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:21:35,207 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-17 11:21:35,218 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:21:35,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2023-11-17 11:21:35,225 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2023-11-17 11:21:35,225 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:21:35,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2023-11-17 11:21:35,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2023-11-17 11:21:35,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2023-11-17 11:21:35,226 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:21:35,226 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 76 flow [2023-11-17 11:21:35,227 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 76 flow [2023-11-17 11:21:35,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2023-11-17 11:21:35,231 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2023-11-17 11:21:35,232 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:21:35,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2023-11-17 11:21:35,232 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-11-17 11:21:36,097 INFO L134 LiptonReduction]: Checked pairs total: 777 [2023-11-17 11:21:36,098 INFO L136 LiptonReduction]: Total number of compositions: 33 [2023-11-17 11:21:36,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:21:36,104 INFO L357 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=false, 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;@b02488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:21:36,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 11:21:36,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:21:36,109 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-17 11:21:36,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:36,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:36,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:21:36,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-17 11:21:36,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash 7762531, now seen corresponding path program 1 times [2023-11-17 11:21:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:36,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839316928] [2023-11-17 11:21:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:36,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:21:36,144 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-17 11:21:36,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:21:36,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839316928] [2023-11-17 11:21:36,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839316928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:21:36,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:21:36,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:21:36,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436168645] [2023-11-17 11:21:36,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:21:36,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:21:36,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:21:36,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:21:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:21:36,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 66 [2023-11-17 11:21:36,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 38 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:36,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:21:36,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 66 [2023-11-17 11:21:36,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:21:36,186 INFO L124 PetriNetUnfolderBase]: 34/75 cut-off events. [2023-11-17 11:21:36,186 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-17 11:21:36,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 75 events. 34/75 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 34 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 42. Up to 73 conditions per place. [2023-11-17 11:21:36,187 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 9 selfloop transitions, 0 changer transitions 0/10 dead transitions. [2023-11-17 11:21:36,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 10 transitions, 48 flow [2023-11-17 11:21:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:21:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:21:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2023-11-17 11:21:36,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32575757575757575 [2023-11-17 11:21:36,188 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 43 transitions. [2023-11-17 11:21:36,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 43 transitions. [2023-11-17 11:21:36,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:21:36,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 43 transitions. [2023-11-17 11:21:36,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:36,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:36,189 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:36,190 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 38 flow. Second operand 2 states and 43 transitions. [2023-11-17 11:21:36,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 10 transitions, 48 flow [2023-11-17 11:21:36,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 48 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:21:36,190 INFO L231 Difference]: Finished difference. Result has 16 places, 10 transitions, 30 flow [2023-11-17 11:21:36,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=30, PETRI_PLACES=16, PETRI_TRANSITIONS=10} [2023-11-17 11:21:36,191 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, -2 predicate places. [2023-11-17 11:21:36,191 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 10 transitions, 30 flow [2023-11-17 11:21:36,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:36,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:36,191 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2023-11-17 11:21:36,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:21:36,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-17 11:21:36,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1464958887, now seen corresponding path program 1 times [2023-11-17 11:21:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:36,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812066038] [2023-11-17 11:21:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:36,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:21:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:36,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:21:36,212 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:21:36,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-17 11:21:36,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-17 11:21:36,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-17 11:21:36,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-17 11:21:36,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:21:36,213 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:21:36,213 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:21:36,214 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-17 11:21:36,225 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:21:36,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2023-11-17 11:21:36,232 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2023-11-17 11:21:36,232 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 11:21:36,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-17 11:21:36,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2023-11-17 11:21:36,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2023-11-17 11:21:36,233 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:21:36,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 47 transitions, 112 flow [2023-11-17 11:21:36,234 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 47 transitions, 112 flow [2023-11-17 11:21:36,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2023-11-17 11:21:36,239 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2023-11-17 11:21:36,239 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 11:21:36,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-17 11:21:36,240 INFO L119 LiptonReduction]: Number of co-enabled transitions 1404 [2023-11-17 11:21:37,400 INFO L134 LiptonReduction]: Checked pairs total: 2483 [2023-11-17 11:21:37,401 INFO L136 LiptonReduction]: Total number of compositions: 49 [2023-11-17 11:21:37,403 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:21:37,404 INFO L357 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=false, 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;@b02488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:21:37,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:21:37,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:21:37,407 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2023-11-17 11:21:37,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:37,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:37,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:21:37,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:21:37,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 10225687, now seen corresponding path program 1 times [2023-11-17 11:21:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:37,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580637792] [2023-11-17 11:21:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:21:37,442 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-17 11:21:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:21:37,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580637792] [2023-11-17 11:21:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580637792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:21:37,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:21:37,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:21:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415946752] [2023-11-17 11:21:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:21:37,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:21:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:21:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:21:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:21:37,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2023-11-17 11:21:37,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:37,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:21:37,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2023-11-17 11:21:37,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:21:37,538 INFO L124 PetriNetUnfolderBase]: 445/667 cut-off events. [2023-11-17 11:21:37,538 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-11-17 11:21:37,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 667 events. 445/667 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2363 event pairs, 346 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 324. Up to 652 conditions per place. [2023-11-17 11:21:37,544 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 16 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2023-11-17 11:21:37,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 84 flow [2023-11-17 11:21:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:21:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:21:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2023-11-17 11:21:37,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2023-11-17 11:21:37,547 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 66 transitions. [2023-11-17 11:21:37,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 66 transitions. [2023-11-17 11:21:37,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:21:37,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 66 transitions. [2023-11-17 11:21:37,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:37,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:37,550 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:37,550 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 64 flow. Second operand 2 states and 66 transitions. [2023-11-17 11:21:37,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 84 flow [2023-11-17 11:21:37,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 82 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-17 11:21:37,552 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 50 flow [2023-11-17 11:21:37,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-11-17 11:21:37,554 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2023-11-17 11:21:37,556 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 50 flow [2023-11-17 11:21:37,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:37,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:37,558 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2023-11-17 11:21:37,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:21:37,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:21:37,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash -384626210, now seen corresponding path program 1 times [2023-11-17 11:21:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:37,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574716835] [2023-11-17 11:21:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:37,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:21:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:37,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:21:37,585 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:21:37,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-17 11:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-17 11:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-17 11:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:21:37,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:21:37,586 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:21:37,587 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:21:37,587 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-17 11:21:37,602 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:21:37,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2023-11-17 11:21:37,609 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2023-11-17 11:21:37,609 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:21:37,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2023-11-17 11:21:37,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2023-11-17 11:21:37,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2023-11-17 11:21:37,610 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:21:37,610 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 61 transitions, 150 flow [2023-11-17 11:21:37,610 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 61 transitions, 150 flow [2023-11-17 11:21:37,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2023-11-17 11:21:37,615 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2023-11-17 11:21:37,615 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:21:37,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2023-11-17 11:21:37,617 INFO L119 LiptonReduction]: Number of co-enabled transitions 2600 [2023-11-17 11:21:39,111 INFO L134 LiptonReduction]: Checked pairs total: 4436 [2023-11-17 11:21:39,112 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-11-17 11:21:39,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:21:39,113 INFO L357 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=false, 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;@b02488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:21:39,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:21:39,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:21:39,115 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2023-11-17 11:21:39,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:39,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:39,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:21:39,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:21:39,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash 13612359, now seen corresponding path program 1 times [2023-11-17 11:21:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:39,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366821989] [2023-11-17 11:21:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:21:39,138 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-17 11:21:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:21:39,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366821989] [2023-11-17 11:21:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366821989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:21:39,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:21:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:21:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145579867] [2023-11-17 11:21:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:21:39,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:21:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:21:39,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:21:39,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:21:39,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 127 [2023-11-17 11:21:39,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:39,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:21:39,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 127 [2023-11-17 11:21:39,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:21:39,360 INFO L124 PetriNetUnfolderBase]: 1789/2475 cut-off events. [2023-11-17 11:21:39,360 INFO L125 PetriNetUnfolderBase]: For 798/798 co-relation queries the response was YES. [2023-11-17 11:21:39,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5226 conditions, 2475 events. 1789/2475 cut-off events. For 798/798 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9632 event pairs, 1474 based on Foata normal form. 0/2160 useless extension candidates. Maximal degree in co-relation 1380. Up to 2428 conditions per place. [2023-11-17 11:21:39,374 INFO L140 encePairwiseOnDemand]: 118/127 looper letters, 19 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-11-17 11:21:39,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 106 flow [2023-11-17 11:21:39,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:21:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:21:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2023-11-17 11:21:39,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33858267716535434 [2023-11-17 11:21:39,375 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 86 transitions. [2023-11-17 11:21:39,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 86 transitions. [2023-11-17 11:21:39,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:21:39,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 86 transitions. [2023-11-17 11:21:39,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:39,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:39,376 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:39,377 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 86 flow. Second operand 2 states and 86 transitions. [2023-11-17 11:21:39,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 106 flow [2023-11-17 11:21:39,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 100 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-17 11:21:39,378 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 62 flow [2023-11-17 11:21:39,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-11-17 11:21:39,379 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-11-17 11:21:39,379 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 62 flow [2023-11-17 11:21:39,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:39,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:39,379 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2023-11-17 11:21:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:21:39,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:21:39,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1855819344, now seen corresponding path program 1 times [2023-11-17 11:21:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339715398] [2023-11-17 11:21:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:39,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:21:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:39,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:21:39,396 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:21:39,397 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-17 11:21:39,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:21:39,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-11-17 11:21:39,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-17 11:21:39,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-17 11:21:39,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:21:39,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:21:39,397 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:21:39,398 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:21:39,398 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-17 11:21:39,420 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:21:39,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 75 transitions, 190 flow [2023-11-17 11:21:39,430 INFO L124 PetriNetUnfolderBase]: 15/89 cut-off events. [2023-11-17 11:21:39,430 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 11:21:39,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 15/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 230 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2023-11-17 11:21:39,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 75 transitions, 190 flow [2023-11-17 11:21:39,432 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 75 transitions, 190 flow [2023-11-17 11:21:39,432 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:21:39,432 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 75 transitions, 190 flow [2023-11-17 11:21:39,432 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 75 transitions, 190 flow [2023-11-17 11:21:39,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 75 transitions, 190 flow [2023-11-17 11:21:39,437 INFO L124 PetriNetUnfolderBase]: 15/89 cut-off events. [2023-11-17 11:21:39,438 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 11:21:39,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 15/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 230 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2023-11-17 11:21:39,440 INFO L119 LiptonReduction]: Number of co-enabled transitions 4160 [2023-11-17 11:21:41,540 INFO L134 LiptonReduction]: Checked pairs total: 6661 [2023-11-17 11:21:41,540 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-11-17 11:21:41,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:21:41,545 INFO L357 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=false, 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;@b02488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:21:41,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:21:41,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:21:41,546 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2023-11-17 11:21:41,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:41,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:41,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:21:41,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:21:41,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash 17953342, now seen corresponding path program 1 times [2023-11-17 11:21:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:41,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278444800] [2023-11-17 11:21:41,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:21:41,565 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-17 11:21:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:21:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278444800] [2023-11-17 11:21:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278444800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:21:41,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:21:41,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:21:41,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074417982] [2023-11-17 11:21:41,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:21:41,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:21:41,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:21:41,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:21:41,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:21:41,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 162 [2023-11-17 11:21:41,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:41,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:21:41,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 162 [2023-11-17 11:21:41,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:21:42,025 INFO L124 PetriNetUnfolderBase]: 4537/6099 cut-off events. [2023-11-17 11:21:42,025 INFO L125 PetriNetUnfolderBase]: For 2898/2898 co-relation queries the response was YES. [2023-11-17 11:21:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12987 conditions, 6099 events. 4537/6099 cut-off events. For 2898/2898 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25530 event pairs, 4174 based on Foata normal form. 0/5736 useless extension candidates. Maximal degree in co-relation 3584. Up to 5992 conditions per place. [2023-11-17 11:21:42,060 INFO L140 encePairwiseOnDemand]: 153/162 looper letters, 20 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-11-17 11:21:42,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 122 flow [2023-11-17 11:21:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:21:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:21:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 101 transitions. [2023-11-17 11:21:42,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3117283950617284 [2023-11-17 11:21:42,064 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 101 transitions. [2023-11-17 11:21:42,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 101 transitions. [2023-11-17 11:21:42,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:21:42,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 101 transitions. [2023-11-17 11:21:42,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:42,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:42,074 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:42,074 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 100 flow. Second operand 2 states and 101 transitions. [2023-11-17 11:21:42,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 122 flow [2023-11-17 11:21:42,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 110 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-17 11:21:42,076 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 70 flow [2023-11-17 11:21:42,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-17 11:21:42,077 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2023-11-17 11:21:42,077 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 70 flow [2023-11-17 11:21:42,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:42,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:42,077 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:21:42,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:21:42,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:21:42,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash 829010557, now seen corresponding path program 1 times [2023-11-17 11:21:42,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:42,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050663008] [2023-11-17 11:21:42,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:42,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:42,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:21:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:42,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:21:42,109 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:21:42,109 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-17 11:21:42,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 11:21:42,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-11-17 11:21:42,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-11-17 11:21:42,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-11-17 11:21:42,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-11-17 11:21:42,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 11:21:42,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:21:42,110 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:21:42,111 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:21:42,111 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-17 11:21:42,131 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:21:42,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 89 transitions, 232 flow [2023-11-17 11:21:42,142 INFO L124 PetriNetUnfolderBase]: 18/106 cut-off events. [2023-11-17 11:21:42,142 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-17 11:21:42,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 106 events. 18/106 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 269 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 114. Up to 7 conditions per place. [2023-11-17 11:21:42,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 89 transitions, 232 flow [2023-11-17 11:21:42,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 89 transitions, 232 flow [2023-11-17 11:21:42,143 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:21:42,144 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 89 transitions, 232 flow [2023-11-17 11:21:42,144 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 89 transitions, 232 flow [2023-11-17 11:21:42,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 89 transitions, 232 flow [2023-11-17 11:21:42,150 INFO L124 PetriNetUnfolderBase]: 18/106 cut-off events. [2023-11-17 11:21:42,150 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-17 11:21:42,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 106 events. 18/106 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 269 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 114. Up to 7 conditions per place. [2023-11-17 11:21:42,153 INFO L119 LiptonReduction]: Number of co-enabled transitions 6084 [2023-11-17 11:21:44,406 INFO L134 LiptonReduction]: Checked pairs total: 9112 [2023-11-17 11:21:44,406 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-11-17 11:21:44,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:21:44,407 INFO L357 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=false, 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;@b02488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:21:44,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-17 11:21:44,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:21:44,408 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2023-11-17 11:21:44,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:44,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:44,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:21:44,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:21:44,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash 23371750, now seen corresponding path program 1 times [2023-11-17 11:21:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:44,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391328259] [2023-11-17 11:21:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:21:44,416 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-17 11:21:44,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:21:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391328259] [2023-11-17 11:21:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391328259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:21:44,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:21:44,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:21:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213417562] [2023-11-17 11:21:44,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:21:44,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:21:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:21:44,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:21:44,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:21:44,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 186 [2023-11-17 11:21:44,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 128 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:44,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:21:44,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 186 [2023-11-17 11:21:44,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:21:46,625 INFO L124 PetriNetUnfolderBase]: 21679/27333 cut-off events. [2023-11-17 11:21:46,626 INFO L125 PetriNetUnfolderBase]: For 12832/12832 co-relation queries the response was YES. [2023-11-17 11:21:46,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57493 conditions, 27333 events. 21679/27333 cut-off events. For 12832/12832 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 118835 event pairs, 19384 based on Foata normal form. 0/25038 useless extension candidates. Maximal degree in co-relation 16791. Up to 27010 conditions per place. [2023-11-17 11:21:46,824 INFO L140 encePairwiseOnDemand]: 175/186 looper letters, 25 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-17 11:21:46,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 156 flow [2023-11-17 11:21:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:21:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:21:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2023-11-17 11:21:46,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3279569892473118 [2023-11-17 11:21:46,827 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 122 transitions. [2023-11-17 11:21:46,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 122 transitions. [2023-11-17 11:21:46,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:21:46,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 122 transitions. [2023-11-17 11:21:46,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:46,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:46,829 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:46,830 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 128 flow. Second operand 2 states and 122 transitions. [2023-11-17 11:21:46,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 156 flow [2023-11-17 11:21:46,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 136 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-11-17 11:21:46,840 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 86 flow [2023-11-17 11:21:46,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-17 11:21:46,841 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2023-11-17 11:21:46,841 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 86 flow [2023-11-17 11:21:46,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:46,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:46,842 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:21:46,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:21:46,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:21:46,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -503884090, now seen corresponding path program 1 times [2023-11-17 11:21:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:46,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836712392] [2023-11-17 11:21:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:46,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:46,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:21:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:21:46,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:21:46,876 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:21:46,876 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2023-11-17 11:21:46,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-11-17 11:21:46,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-11-17 11:21:46,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-11-17 11:21:46,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-11-17 11:21:46,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-11-17 11:21:46,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2023-11-17 11:21:46,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2023-11-17 11:21:46,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:21:46,877 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:21:46,879 WARN L233 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:21:46,879 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-11-17 11:21:46,903 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:21:46,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 103 transitions, 276 flow [2023-11-17 11:21:46,917 INFO L124 PetriNetUnfolderBase]: 21/123 cut-off events. [2023-11-17 11:21:46,917 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-17 11:21:46,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 123 events. 21/123 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 328 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 139. Up to 8 conditions per place. [2023-11-17 11:21:46,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 103 transitions, 276 flow [2023-11-17 11:21:46,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 103 transitions, 276 flow [2023-11-17 11:21:46,919 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:21:46,919 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 103 transitions, 276 flow [2023-11-17 11:21:46,919 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 103 transitions, 276 flow [2023-11-17 11:21:46,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 103 transitions, 276 flow [2023-11-17 11:21:46,928 INFO L124 PetriNetUnfolderBase]: 21/123 cut-off events. [2023-11-17 11:21:46,928 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-17 11:21:46,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 123 events. 21/123 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 328 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 139. Up to 8 conditions per place. [2023-11-17 11:21:46,933 INFO L119 LiptonReduction]: Number of co-enabled transitions 8372 [2023-11-17 11:21:49,787 INFO L134 LiptonReduction]: Checked pairs total: 14015 [2023-11-17 11:21:49,788 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-11-17 11:21:49,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:21:49,789 INFO L357 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=false, 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;@b02488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:21:49,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-17 11:21:49,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:21:49,790 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2023-11-17 11:21:49,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:21:49,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:21:49,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:21:49,790 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 11:21:49,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:21:49,790 INFO L85 PathProgramCache]: Analyzing trace with hash 29528983, now seen corresponding path program 1 times [2023-11-17 11:21:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:21:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119095574] [2023-11-17 11:21:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:21:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:21:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:21:49,799 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-17 11:21:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:21:49,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119095574] [2023-11-17 11:21:49,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119095574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:21:49,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:21:49,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:21:49,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035816142] [2023-11-17 11:21:49,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:21:49,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:21:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:21:49,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:21:49,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:21:49,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 219 [2023-11-17 11:21:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:21:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:21:49,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 219 [2023-11-17 11:21:49,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:21:59,792 INFO L124 PetriNetUnfolderBase]: 115315/139545 cut-off events. [2023-11-17 11:21:59,794 INFO L125 PetriNetUnfolderBase]: For 91888/91888 co-relation queries the response was YES. [2023-11-17 11:22:00,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295094 conditions, 139545 events. 115315/139545 cut-off events. For 91888/91888 co-relation queries the response was YES. Maximal size of possible extension queue 3609. Compared 632302 event pairs, 99007 based on Foata normal form. 0/123237 useless extension candidates. Maximal degree in co-relation 88359. Up to 137818 conditions per place. [2023-11-17 11:22:00,623 INFO L140 encePairwiseOnDemand]: 206/219 looper letters, 30 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-17 11:22:00,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 192 flow [2023-11-17 11:22:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:22:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:22:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 143 transitions. [2023-11-17 11:22:00,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3264840182648402 [2023-11-17 11:22:00,624 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 143 transitions. [2023-11-17 11:22:00,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 143 transitions. [2023-11-17 11:22:00,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:00,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 143 transitions. [2023-11-17 11:22:00,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:00,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:00,627 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:00,627 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 158 flow. Second operand 2 states and 143 transitions. [2023-11-17 11:22:00,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 192 flow [2023-11-17 11:22:00,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 31 transitions, 162 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-11-17 11:22:00,681 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 102 flow [2023-11-17 11:22:00,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-17 11:22:00,682 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-11-17 11:22:00,682 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 102 flow [2023-11-17 11:22:00,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:00,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:00,682 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:00,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:22:00,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 11:22:00,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash -116882852, now seen corresponding path program 1 times [2023-11-17 11:22:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659847135] [2023-11-17 11:22:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:00,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:22:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:00,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:22:00,712 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:22:00,712 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-17 11:22:00,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-11-17 11:22:00,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-11-17 11:22:00,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2023-11-17 11:22:00,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2023-11-17 11:22:00,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2023-11-17 11:22:00,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2023-11-17 11:22:00,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-11-17 11:22:00,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-11-17 11:22:00,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:22:00,713 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:22:00,713 WARN L233 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:22:00,713 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2023-11-17 11:22:00,739 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:22:00,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 117 transitions, 322 flow [2023-11-17 11:22:00,751 INFO L124 PetriNetUnfolderBase]: 24/140 cut-off events. [2023-11-17 11:22:00,751 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-17 11:22:00,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 140 events. 24/140 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 165. Up to 9 conditions per place. [2023-11-17 11:22:00,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 117 transitions, 322 flow [2023-11-17 11:22:00,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 117 transitions, 322 flow [2023-11-17 11:22:00,753 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:22:00,753 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 117 transitions, 322 flow [2023-11-17 11:22:00,753 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 117 transitions, 322 flow [2023-11-17 11:22:00,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 117 transitions, 322 flow [2023-11-17 11:22:00,761 INFO L124 PetriNetUnfolderBase]: 24/140 cut-off events. [2023-11-17 11:22:00,762 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-17 11:22:00,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 140 events. 24/140 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 165. Up to 9 conditions per place. [2023-11-17 11:22:00,766 INFO L119 LiptonReduction]: Number of co-enabled transitions 11024 [2023-11-17 11:22:03,702 INFO L134 LiptonReduction]: Checked pairs total: 17823 [2023-11-17 11:22:03,702 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-11-17 11:22:03,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:22:03,703 INFO L357 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=false, 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;@b02488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:22:03,704 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-17 11:22:03,704 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:22:03,704 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2023-11-17 11:22:03,704 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:22:03,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:03,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:22:03,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2023-11-17 11:22:03,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash 36702095, now seen corresponding path program 1 times [2023-11-17 11:22:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:03,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448343582] [2023-11-17 11:22:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:03,712 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-17 11:22:03,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:03,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448343582] [2023-11-17 11:22:03,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448343582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:03,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:03,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:22:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461381686] [2023-11-17 11:22:03,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:03,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:22:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:03,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:22:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:22:03,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 251 [2023-11-17 11:22:03,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:03,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:03,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 251 [2023-11-17 11:22:03,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand