/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:55:41,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:55:41,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 14:55:41,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:55:41,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:55:41,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:55:41,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:55:41,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:55:41,888 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:55:41,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:55:41,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:55:41,891 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:55:41,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:55:41,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:55:41,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:55:41,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:55:41,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:55:41,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:55:41,893 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:55:41,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:55:41,893 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:55:41,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:55:41,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:55:41,894 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:55:41,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:55:41,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:55:41,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:55:41,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:55:41,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:55:41,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:55:41,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:55:41,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:55:41,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:55:41,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 14:55:42,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:55:42,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:55:42,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:55:42,120 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:55:42,121 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:55:42,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2023-12-09 14:55:43,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:55:43,384 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:55:43,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2023-12-09 14:55:43,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4f1aa92/a8102c923260435dabfb422eed022ed2/FLAG9a9bc98fc [2023-12-09 14:55:43,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4f1aa92/a8102c923260435dabfb422eed022ed2 [2023-12-09 14:55:43,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:55:43,420 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:55:43,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:55:43,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:55:43,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:55:43,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f72cc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43, skipping insertion in model container [2023-12-09 14:55:43,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:55:43,750 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/46_monabsex2_vs.i[30494,30507] [2023-12-09 14:55:43,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:55:43,772 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:55:43,811 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/46_monabsex2_vs.i[30494,30507] [2023-12-09 14:55:43,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:55:43,836 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 14:55:43,836 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 14:55:43,841 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:55:43,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43 WrapperNode [2023-12-09 14:55:43,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:55:43,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:55:43,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:55:43,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:55:43,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,883 INFO L138 Inliner]: procedures = 169, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-12-09 14:55:43,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:55:43,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:55:43,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:55:43,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:55:43,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:55:43,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:55:43,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:55:43,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:55:43,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (1/1) ... [2023-12-09 14:55:43,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:55:43,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:55:43,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 14:55:43,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 14:55:43,975 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-09 14:55:43,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-09 14:55:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:55:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 14:55:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:55:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:55:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:55:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:55:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 14:55:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:55:43,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:55:43,977 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 14:55:44,117 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:55:44,118 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:55:44,227 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:55:44,247 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:55:44,247 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-09 14:55:44,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:55:44 BoogieIcfgContainer [2023-12-09 14:55:44,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:55:44,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:55:44,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:55:44,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:55:44,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:55:43" (1/3) ... [2023-12-09 14:55:44,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f423c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:55:44, skipping insertion in model container [2023-12-09 14:55:44,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:55:43" (2/3) ... [2023-12-09 14:55:44,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f423c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:55:44, skipping insertion in model container [2023-12-09 14:55:44,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:55:44" (3/3) ... [2023-12-09 14:55:44,257 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2023-12-09 14:55:44,270 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:55:44,270 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 14:55:44,270 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:55:44,362 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:44,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 70 flow [2023-12-09 14:55:44,422 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2023-12-09 14:55:44,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:44,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 22. Up to 4 conditions per place. [2023-12-09 14:55:44,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 33 transitions, 70 flow [2023-12-09 14:55:44,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 70 flow [2023-12-09 14:55:44,443 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:44,449 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54dbcece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:44,450 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 14:55:44,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:44,464 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-09 14:55:44,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:44,464 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:44,465 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:44,465 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:55:44,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:44,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1372147448, now seen corresponding path program 1 times [2023-12-09 14:55:44,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:44,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867097710] [2023-12-09 14:55:44,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:44,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867097710] [2023-12-09 14:55:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867097710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054608027] [2023-12-09 14:55:44,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:44,780 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:44,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:44,809 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 33 [2023-12-09 14:55:44,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:44,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:44,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 33 [2023-12-09 14:55:44,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:44,833 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2023-12-09 14:55:44,833 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:55:44,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 12 event pairs, 0 based on Foata normal form. 4/33 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2023-12-09 14:55:44,835 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 2 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-12-09 14:55:44,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 62 flow [2023-12-09 14:55:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-12-09 14:55:44,844 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2023-12-09 14:55:44,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-12-09 14:55:44,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-12-09 14:55:44,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:44,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-12-09 14:55:44,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:44,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:44,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:44,857 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2023-12-09 14:55:44,857 INFO L500 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 62 flow [2023-12-09 14:55:44,857 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:44,857 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:44,857 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:44,858 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:55:44,858 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:55:44,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1954534651, now seen corresponding path program 1 times [2023-12-09 14:55:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:44,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767135664] [2023-12-09 14:55:44,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:44,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:44,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:44,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:44,915 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:44,916 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-09 14:55:44,921 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-09 14:55:44,921 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-09 14:55:44,921 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 14:55:44,922 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 14:55:44,925 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:44,925 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 14:55:44,952 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:44,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 92 flow [2023-12-09 14:55:44,967 INFO L124 PetriNetUnfolderBase]: 3/65 cut-off events. [2023-12-09 14:55:44,968 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:55:44,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 65 events. 3/65 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 45. Up to 6 conditions per place. [2023-12-09 14:55:44,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 92 flow [2023-12-09 14:55:44,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 41 transitions, 92 flow [2023-12-09 14:55:44,971 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:44,972 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54dbcece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:44,972 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 14:55:44,982 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:44,982 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-12-09 14:55:44,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:44,983 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:44,983 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:44,983 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:55:44,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash -211453889, now seen corresponding path program 1 times [2023-12-09 14:55:44,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801044064] [2023-12-09 14:55:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:45,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:45,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801044064] [2023-12-09 14:55:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801044064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:45,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:45,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:45,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065004019] [2023-12-09 14:55:45,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:45,079 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:45,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:45,081 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 41 [2023-12-09 14:55:45,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:45,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 41 [2023-12-09 14:55:45,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:45,108 INFO L124 PetriNetUnfolderBase]: 6/66 cut-off events. [2023-12-09 14:55:45,109 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-12-09 14:55:45,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 66 events. 6/66 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 2 based on Foata normal form. 15/78 useless extension candidates. Maximal degree in co-relation 49. Up to 13 conditions per place. [2023-12-09 14:55:45,109 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 11 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-12-09 14:55:45,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 121 flow [2023-12-09 14:55:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-12-09 14:55:45,116 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8943089430894309 [2023-12-09 14:55:45,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-12-09 14:55:45,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-12-09 14:55:45,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:45,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-12-09 14:55:45,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,119 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-12-09 14:55:45,119 INFO L500 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 121 flow [2023-12-09 14:55:45,119 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,119 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:45,119 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:45,119 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 14:55:45,120 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:55:45,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1006030970, now seen corresponding path program 1 times [2023-12-09 14:55:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564454094] [2023-12-09 14:55:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:55:45,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:45,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564454094] [2023-12-09 14:55:45,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564454094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:45,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:45,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:45,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370661603] [2023-12-09 14:55:45,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:45,174 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:45,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:45,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:45,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:45,175 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 41 [2023-12-09 14:55:45,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:45,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 41 [2023-12-09 14:55:45,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:45,210 INFO L124 PetriNetUnfolderBase]: 10/80 cut-off events. [2023-12-09 14:55:45,210 INFO L125 PetriNetUnfolderBase]: For 35/40 co-relation queries the response was YES. [2023-12-09 14:55:45,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 80 events. 10/80 cut-off events. For 35/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 199 event pairs, 2 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 44. Up to 14 conditions per place. [2023-12-09 14:55:45,211 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 13 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-12-09 14:55:45,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 164 flow [2023-12-09 14:55:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2023-12-09 14:55:45,217 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8455284552845529 [2023-12-09 14:55:45,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 104 transitions. [2023-12-09 14:55:45,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 104 transitions. [2023-12-09 14:55:45,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:45,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 104 transitions. [2023-12-09 14:55:45,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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-12-09 14:55:45,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,220 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-12-09 14:55:45,220 INFO L500 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 164 flow [2023-12-09 14:55:45,220 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,220 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:45,220 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:45,221 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:55:45,221 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:55:45,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 398586172, now seen corresponding path program 1 times [2023-12-09 14:55:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012060684] [2023-12-09 14:55:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:45,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:45,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:45,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:45,253 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:45,254 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-09 14:55:45,254 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-09 14:55:45,254 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-12-09 14:55:45,254 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-09 14:55:45,254 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 14:55:45,254 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:55:45,255 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:45,255 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 14:55:45,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:45,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 116 flow [2023-12-09 14:55:45,299 INFO L124 PetriNetUnfolderBase]: 4/86 cut-off events. [2023-12-09 14:55:45,299 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:55:45,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 4/86 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 69. Up to 8 conditions per place. [2023-12-09 14:55:45,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 116 flow [2023-12-09 14:55:45,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 49 transitions, 116 flow [2023-12-09 14:55:45,303 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:45,308 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54dbcece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:45,308 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:55:45,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:45,311 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-12-09 14:55:45,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:45,311 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:45,311 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:45,311 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:55:45,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1161254490, now seen corresponding path program 1 times [2023-12-09 14:55:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784961227] [2023-12-09 14:55:45,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784961227] [2023-12-09 14:55:45,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784961227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:45,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:45,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131900130] [2023-12-09 14:55:45,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:45,367 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:45,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:45,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:45,369 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 49 [2023-12-09 14:55:45,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:45,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 49 [2023-12-09 14:55:45,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:45,439 INFO L124 PetriNetUnfolderBase]: 59/220 cut-off events. [2023-12-09 14:55:45,440 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-12-09 14:55:45,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 220 events. 59/220 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 982 event pairs, 17 based on Foata normal form. 60/252 useless extension candidates. Maximal degree in co-relation 232. Up to 95 conditions per place. [2023-12-09 14:55:45,444 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 17 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2023-12-09 14:55:45,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 172 flow [2023-12-09 14:55:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2023-12-09 14:55:45,446 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8843537414965986 [2023-12-09 14:55:45,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 130 transitions. [2023-12-09 14:55:45,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 130 transitions. [2023-12-09 14:55:45,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:45,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 130 transitions. [2023-12-09 14:55:45,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,454 INFO L308 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2023-12-09 14:55:45,454 INFO L500 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 172 flow [2023-12-09 14:55:45,455 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,455 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:45,455 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:45,455 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 14:55:45,455 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:55:45,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash -988026795, now seen corresponding path program 1 times [2023-12-09 14:55:45,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:45,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765050302] [2023-12-09 14:55:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:55:45,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:45,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765050302] [2023-12-09 14:55:45,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765050302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:45,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:45,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:45,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556965143] [2023-12-09 14:55:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:45,511 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:45,513 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 49 [2023-12-09 14:55:45,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:45,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 49 [2023-12-09 14:55:45,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:45,565 INFO L124 PetriNetUnfolderBase]: 88/297 cut-off events. [2023-12-09 14:55:45,565 INFO L125 PetriNetUnfolderBase]: For 244/287 co-relation queries the response was YES. [2023-12-09 14:55:45,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 297 events. 88/297 cut-off events. For 244/287 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1517 event pairs, 17 based on Foata normal form. 2/289 useless extension candidates. Maximal degree in co-relation 230. Up to 100 conditions per place. [2023-12-09 14:55:45,569 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 20 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-12-09 14:55:45,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 244 flow [2023-12-09 14:55:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-12-09 14:55:45,570 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2023-12-09 14:55:45,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-12-09 14:55:45,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-12-09 14:55:45,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:45,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-12-09 14:55:45,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,574 INFO L308 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2023-12-09 14:55:45,574 INFO L500 AbstractCegarLoop]: Abstraction has has 50 places, 55 transitions, 244 flow [2023-12-09 14:55:45,574 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,574 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:45,574 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:45,575 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 14:55:45,575 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:55:45,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2011370228, now seen corresponding path program 1 times [2023-12-09 14:55:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699152790] [2023-12-09 14:55:45,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:45,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:45,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:45,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:45,618 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:45,618 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-09 14:55:45,618 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:55:45,618 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-12-09 14:55:45,618 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-09 14:55:45,618 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:55:45,619 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 14:55:45,619 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:55:45,619 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:45,619 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 14:55:45,636 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:45,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 142 flow [2023-12-09 14:55:45,645 INFO L124 PetriNetUnfolderBase]: 5/107 cut-off events. [2023-12-09 14:55:45,645 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-09 14:55:45,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 107 events. 5/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 156 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 94. Up to 10 conditions per place. [2023-12-09 14:55:45,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 142 flow [2023-12-09 14:55:45,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 57 transitions, 142 flow [2023-12-09 14:55:45,647 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:45,648 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54dbcece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:45,648 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-09 14:55:45,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:45,650 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-12-09 14:55:45,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:45,650 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:45,650 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:45,650 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:55:45,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1477253907, now seen corresponding path program 1 times [2023-12-09 14:55:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:45,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109469151] [2023-12-09 14:55:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109469151] [2023-12-09 14:55:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109469151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:45,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88436399] [2023-12-09 14:55:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:45,702 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:45,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:45,703 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 57 [2023-12-09 14:55:45,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:45,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 57 [2023-12-09 14:55:45,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:45,833 INFO L124 PetriNetUnfolderBase]: 421/969 cut-off events. [2023-12-09 14:55:45,833 INFO L125 PetriNetUnfolderBase]: For 532/532 co-relation queries the response was YES. [2023-12-09 14:55:45,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 969 events. 421/969 cut-off events. For 532/532 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5951 event pairs, 127 based on Foata normal form. 251/1036 useless extension candidates. Maximal degree in co-relation 1215. Up to 608 conditions per place. [2023-12-09 14:55:45,843 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 23 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-12-09 14:55:45,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 227 flow [2023-12-09 14:55:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-12-09 14:55:45,848 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8771929824561403 [2023-12-09 14:55:45,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-12-09 14:55:45,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-12-09 14:55:45,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:45,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-12-09 14:55:45,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,852 INFO L308 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2023-12-09 14:55:45,853 INFO L500 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 227 flow [2023-12-09 14:55:45,853 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,853 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:45,853 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:45,853 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 14:55:45,853 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:55:45,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1951297138, now seen corresponding path program 1 times [2023-12-09 14:55:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:45,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282700994] [2023-12-09 14:55:45,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:55:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282700994] [2023-12-09 14:55:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282700994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203924224] [2023-12-09 14:55:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:45,902 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:45,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:45,904 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 57 [2023-12-09 14:55:45,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:45,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:45,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 57 [2023-12-09 14:55:45,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:46,062 INFO L124 PetriNetUnfolderBase]: 582/1359 cut-off events. [2023-12-09 14:55:46,062 INFO L125 PetriNetUnfolderBase]: For 1573/1757 co-relation queries the response was YES. [2023-12-09 14:55:46,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3153 conditions, 1359 events. 582/1359 cut-off events. For 1573/1757 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9510 event pairs, 67 based on Foata normal form. 3/1314 useless extension candidates. Maximal degree in co-relation 1838. Up to 556 conditions per place. [2023-12-09 14:55:46,071 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 27 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-12-09 14:55:46,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 330 flow [2023-12-09 14:55:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2023-12-09 14:55:46,072 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8304093567251462 [2023-12-09 14:55:46,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 142 transitions. [2023-12-09 14:55:46,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 142 transitions. [2023-12-09 14:55:46,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:46,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 142 transitions. [2023-12-09 14:55:46,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,074 INFO L308 CegarLoopForPetriNet]: 65 programPoint places, -6 predicate places. [2023-12-09 14:55:46,074 INFO L500 AbstractCegarLoop]: Abstraction has has 59 places, 68 transitions, 330 flow [2023-12-09 14:55:46,074 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,074 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:46,074 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:46,074 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 14:55:46,075 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:55:46,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1828082505, now seen corresponding path program 1 times [2023-12-09 14:55:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860827243] [2023-12-09 14:55:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:46,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:46,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:46,090 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:46,091 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-09 14:55:46,091 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-09 14:55:46,091 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-12-09 14:55:46,091 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-09 14:55:46,091 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-09 14:55:46,091 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-09 14:55:46,091 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 14:55:46,091 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:55:46,092 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:46,092 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-09 14:55:46,104 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:46,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 65 transitions, 170 flow [2023-12-09 14:55:46,112 INFO L124 PetriNetUnfolderBase]: 6/128 cut-off events. [2023-12-09 14:55:46,112 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-09 14:55:46,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 128 events. 6/128 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 190 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 120. Up to 12 conditions per place. [2023-12-09 14:55:46,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 65 transitions, 170 flow [2023-12-09 14:55:46,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 65 transitions, 170 flow [2023-12-09 14:55:46,113 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:46,114 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54dbcece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:46,114 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-09 14:55:46,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:46,115 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-12-09 14:55:46,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:46,115 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:46,115 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:46,115 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:55:46,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1159452812, now seen corresponding path program 1 times [2023-12-09 14:55:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:46,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761727258] [2023-12-09 14:55:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:46,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761727258] [2023-12-09 14:55:46,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761727258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:46,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353819831] [2023-12-09 14:55:46,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:46,138 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:46,139 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 65 [2023-12-09 14:55:46,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:46,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 65 [2023-12-09 14:55:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:46,584 INFO L124 PetriNetUnfolderBase]: 2584/4740 cut-off events. [2023-12-09 14:55:46,584 INFO L125 PetriNetUnfolderBase]: For 3551/3551 co-relation queries the response was YES. [2023-12-09 14:55:46,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9821 conditions, 4740 events. 2584/4740 cut-off events. For 3551/3551 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 34748 event pairs, 1578 based on Foata normal form. 1048/4629 useless extension candidates. Maximal degree in co-relation 2902. Up to 3488 conditions per place. [2023-12-09 14:55:46,634 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 29 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2023-12-09 14:55:46,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 286 flow [2023-12-09 14:55:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2023-12-09 14:55:46,636 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2023-12-09 14:55:46,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 170 transitions. [2023-12-09 14:55:46,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 170 transitions. [2023-12-09 14:55:46,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:46,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 170 transitions. [2023-12-09 14:55:46,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,638 INFO L308 CegarLoopForPetriNet]: 75 programPoint places, -4 predicate places. [2023-12-09 14:55:46,638 INFO L500 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 286 flow [2023-12-09 14:55:46,638 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,639 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:46,639 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:46,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 14:55:46,639 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:55:46,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2128468943, now seen corresponding path program 1 times [2023-12-09 14:55:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567211073] [2023-12-09 14:55:46,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:46,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567211073] [2023-12-09 14:55:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567211073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908479642] [2023-12-09 14:55:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:46,680 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:46,681 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 65 [2023-12-09 14:55:46,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:46,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:46,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 65 [2023-12-09 14:55:46,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:47,259 INFO L124 PetriNetUnfolderBase]: 2975/5979 cut-off events. [2023-12-09 14:55:47,259 INFO L125 PetriNetUnfolderBase]: For 8244/9112 co-relation queries the response was YES. [2023-12-09 14:55:47,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14259 conditions, 5979 events. 2975/5979 cut-off events. For 8244/9112 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 48774 event pairs, 1274 based on Foata normal form. 4/5701 useless extension candidates. Maximal degree in co-relation 3121. Up to 2971 conditions per place. [2023-12-09 14:55:47,309 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 34 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-12-09 14:55:47,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 422 flow [2023-12-09 14:55:47,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2023-12-09 14:55:47,310 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8256410256410256 [2023-12-09 14:55:47,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 161 transitions. [2023-12-09 14:55:47,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 161 transitions. [2023-12-09 14:55:47,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:47,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 161 transitions. [2023-12-09 14:55:47,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,312 INFO L308 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-12-09 14:55:47,312 INFO L500 AbstractCegarLoop]: Abstraction has has 68 places, 81 transitions, 422 flow [2023-12-09 14:55:47,312 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,312 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:47,313 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:47,313 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 14:55:47,313 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:55:47,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2055506931, now seen corresponding path program 1 times [2023-12-09 14:55:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387847786] [2023-12-09 14:55:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:47,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:47,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:47,347 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:47,348 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-12-09 14:55:47,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-09 14:55:47,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-12-09 14:55:47,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-12-09 14:55:47,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-12-09 14:55:47,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-12-09 14:55:47,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-09 14:55:47,348 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-09 14:55:47,348 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:55:47,349 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:47,349 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-09 14:55:47,371 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:47,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 73 transitions, 200 flow [2023-12-09 14:55:47,383 INFO L124 PetriNetUnfolderBase]: 7/149 cut-off events. [2023-12-09 14:55:47,383 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-09 14:55:47,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 149 events. 7/149 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 227 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 147. Up to 14 conditions per place. [2023-12-09 14:55:47,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 73 transitions, 200 flow [2023-12-09 14:55:47,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 73 transitions, 200 flow [2023-12-09 14:55:47,386 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:47,386 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54dbcece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:47,386 INFO L363 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-12-09 14:55:47,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:47,387 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-09 14:55:47,387 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:47,388 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:47,388 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:47,388 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-12-09 14:55:47,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -207850533, now seen corresponding path program 1 times [2023-12-09 14:55:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988202553] [2023-12-09 14:55:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:47,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988202553] [2023-12-09 14:55:47,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988202553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:47,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:47,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:47,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849809830] [2023-12-09 14:55:47,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:47,420 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:47,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:47,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:47,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:47,421 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 73 [2023-12-09 14:55:47,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:47,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:47,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 73 [2023-12-09 14:55:47,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:49,576 INFO L124 PetriNetUnfolderBase]: 14408/23124 cut-off events. [2023-12-09 14:55:49,576 INFO L125 PetriNetUnfolderBase]: For 20479/20479 co-relation queries the response was YES. [2023-12-09 14:55:49,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49152 conditions, 23124 events. 14408/23124 cut-off events. For 20479/20479 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 177525 event pairs, 5312 based on Foata normal form. 4489/21836 useless extension candidates. Maximal degree in co-relation 32045. Up to 18519 conditions per place. [2023-12-09 14:55:49,903 INFO L140 encePairwiseOnDemand]: 58/73 looper letters, 35 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-12-09 14:55:49,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 83 transitions, 349 flow [2023-12-09 14:55:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2023-12-09 14:55:49,904 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.867579908675799 [2023-12-09 14:55:49,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 190 transitions. [2023-12-09 14:55:49,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 190 transitions. [2023-12-09 14:55:49,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:49,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 190 transitions. [2023-12-09 14:55:49,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:49,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:49,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:49,907 INFO L308 CegarLoopForPetriNet]: 85 programPoint places, -4 predicate places. [2023-12-09 14:55:49,907 INFO L500 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 349 flow [2023-12-09 14:55:49,907 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:49,907 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:49,907 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:49,907 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-09 14:55:49,907 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-12-09 14:55:49,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1487939990, now seen corresponding path program 1 times [2023-12-09 14:55:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017942018] [2023-12-09 14:55:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:55:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017942018] [2023-12-09 14:55:49,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017942018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:49,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:49,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174175477] [2023-12-09 14:55:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:49,932 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:49,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:49,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:49,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:49,933 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 73 [2023-12-09 14:55:49,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:49,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:49,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 73 [2023-12-09 14:55:49,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:55:52,273 INFO L124 PetriNetUnfolderBase]: 15087/25863 cut-off events. [2023-12-09 14:55:52,273 INFO L125 PetriNetUnfolderBase]: For 44069/46849 co-relation queries the response was YES. [2023-12-09 14:55:52,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65746 conditions, 25863 events. 15087/25863 cut-off events. For 44069/46849 co-relation queries the response was YES. Maximal size of possible extension queue 1417. Compared 227443 event pairs, 6180 based on Foata normal form. 5/24909 useless extension candidates. Maximal degree in co-relation 19714. Up to 14155 conditions per place. [2023-12-09 14:55:52,537 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 41 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2023-12-09 14:55:52,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 94 transitions, 520 flow [2023-12-09 14:55:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:55:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:55:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-12-09 14:55:52,539 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.821917808219178 [2023-12-09 14:55:52,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 180 transitions. [2023-12-09 14:55:52,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 180 transitions. [2023-12-09 14:55:52,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:55:52,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 180 transitions. [2023-12-09 14:55:52,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:52,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:52,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:52,540 INFO L308 CegarLoopForPetriNet]: 85 programPoint places, -8 predicate places. [2023-12-09 14:55:52,542 INFO L500 AbstractCegarLoop]: Abstraction has has 77 places, 94 transitions, 520 flow [2023-12-09 14:55:52,543 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:52,543 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:52,543 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:52,543 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-09 14:55:52,543 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-12-09 14:55:52,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash 474500694, now seen corresponding path program 1 times [2023-12-09 14:55:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523485648] [2023-12-09 14:55:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:52,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:55:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:55:52,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:55:52,675 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:55:52,675 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2023-12-09 14:55:52,675 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-12-09 14:55:52,675 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-12-09 14:55:52,676 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-12-09 14:55:52,676 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-12-09 14:55:52,676 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-12-09 14:55:52,676 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2023-12-09 14:55:52,676 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2023-12-09 14:55:52,676 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-09 14:55:52,676 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:55:52,677 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:55:52,677 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-12-09 14:55:52,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:55:52,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 81 transitions, 232 flow [2023-12-09 14:55:52,722 INFO L124 PetriNetUnfolderBase]: 8/170 cut-off events. [2023-12-09 14:55:52,722 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-09 14:55:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 170 events. 8/170 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 271 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 175. Up to 16 conditions per place. [2023-12-09 14:55:52,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 81 transitions, 232 flow [2023-12-09 14:55:52,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 81 transitions, 232 flow [2023-12-09 14:55:52,726 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:55:52,726 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54dbcece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:55:52,726 INFO L363 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-12-09 14:55:52,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:55:52,728 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-09 14:55:52,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:55:52,728 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:55:52,728 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:55:52,729 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-12-09 14:55:52,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:55:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1377553378, now seen corresponding path program 1 times [2023-12-09 14:55:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:55:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533218073] [2023-12-09 14:55:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:55:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:55:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:55:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:55:52,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:55:52,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533218073] [2023-12-09 14:55:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533218073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:55:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:55:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:55:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126265168] [2023-12-09 14:55:52,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:55:52,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:55:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:55:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:55:52,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:55:52,771 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2023-12-09 14:55:52,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:55:52,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:55:52,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2023-12-09 14:55:52,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:56:02,974 INFO L124 PetriNetUnfolderBase]: 75117/111631 cut-off events. [2023-12-09 14:56:02,974 INFO L125 PetriNetUnfolderBase]: For 118800/118800 co-relation queries the response was YES. [2023-12-09 14:56:03,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240142 conditions, 111631 events. 75117/111631 cut-off events. For 118800/118800 co-relation queries the response was YES. Maximal size of possible extension queue 5610. Compared 939271 event pairs, 47811 based on Foata normal form. 18820/100012 useless extension candidates. Maximal degree in co-relation 50234. Up to 93041 conditions per place. [2023-12-09 14:56:04,805 INFO L140 encePairwiseOnDemand]: 64/81 looper letters, 41 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2023-12-09 14:56:04,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 416 flow [2023-12-09 14:56:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:56:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:56:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2023-12-09 14:56:04,806 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8641975308641975 [2023-12-09 14:56:04,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 210 transitions. [2023-12-09 14:56:04,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 210 transitions. [2023-12-09 14:56:04,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:56:04,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 210 transitions. [2023-12-09 14:56:04,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:04,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:04,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:04,808 INFO L308 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2023-12-09 14:56:04,808 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 416 flow [2023-12-09 14:56:04,808 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:04,808 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:56:04,808 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:56:04,808 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-09 14:56:04,808 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-12-09 14:56:04,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:56:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash 982867657, now seen corresponding path program 1 times [2023-12-09 14:56:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:56:04,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131141144] [2023-12-09 14:56:04,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:56:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:56:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:56:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:56:04,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:56:04,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131141144] [2023-12-09 14:56:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131141144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:56:04,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:56:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:56:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677336533] [2023-12-09 14:56:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:56:04,834 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:56:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:56:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:56:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:56:04,834 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2023-12-09 14:56:04,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:04,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:56:04,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2023-12-09 14:56:04,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:56:17,282 INFO L124 PetriNetUnfolderBase]: 73758/117870 cut-off events. [2023-12-09 14:56:17,282 INFO L125 PetriNetUnfolderBase]: For 231450/248871 co-relation queries the response was YES. [2023-12-09 14:56:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302862 conditions, 117870 events. 73758/117870 cut-off events. For 231450/248871 co-relation queries the response was YES. Maximal size of possible extension queue 5469. Compared 1113473 event pairs, 36241 based on Foata normal form. 6/111724 useless extension candidates. Maximal degree in co-relation 67504. Up to 68098 conditions per place. [2023-12-09 14:56:19,070 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 48 selfloop transitions, 7 changer transitions 0/107 dead transitions. [2023-12-09 14:56:19,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 107 transitions, 624 flow [2023-12-09 14:56:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:56:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:56:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2023-12-09 14:56:19,072 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8189300411522634 [2023-12-09 14:56:19,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 199 transitions. [2023-12-09 14:56:19,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 199 transitions. [2023-12-09 14:56:19,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:56:19,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 199 transitions. [2023-12-09 14:56:19,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:19,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:19,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:19,075 INFO L308 CegarLoopForPetriNet]: 95 programPoint places, -9 predicate places. [2023-12-09 14:56:19,075 INFO L500 AbstractCegarLoop]: Abstraction has has 86 places, 107 transitions, 624 flow [2023-12-09 14:56:19,076 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:19,076 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:56:19,076 INFO L233 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:56:19,076 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-09 14:56:19,076 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-12-09 14:56:19,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:56:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash 570508358, now seen corresponding path program 1 times [2023-12-09 14:56:19,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:56:19,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498651539] [2023-12-09 14:56:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:56:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:56:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:56:19,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:56:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:56:19,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:56:19,216 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:56:19,217 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-12-09 14:56:19,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-12-09 14:56:19,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-12-09 14:56:19,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2023-12-09 14:56:19,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2023-12-09 14:56:19,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2023-12-09 14:56:19,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2023-12-09 14:56:19,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-12-09 14:56:19,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-12-09 14:56:19,218 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-09 14:56:19,218 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:56:19,219 WARN L227 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:56:19,219 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2023-12-09 14:56:19,247 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:56:19,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 89 transitions, 266 flow [2023-12-09 14:56:19,261 INFO L124 PetriNetUnfolderBase]: 9/191 cut-off events. [2023-12-09 14:56:19,262 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-12-09 14:56:19,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 191 events. 9/191 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 297 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 204. Up to 18 conditions per place. [2023-12-09 14:56:19,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 89 transitions, 266 flow [2023-12-09 14:56:19,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 89 transitions, 266 flow [2023-12-09 14:56:19,266 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:56:19,266 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54dbcece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:56:19,266 INFO L363 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-12-09 14:56:19,268 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:56:19,268 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-09 14:56:19,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:56:19,268 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:56:19,268 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:56:19,268 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2023-12-09 14:56:19,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:56:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash -698210167, now seen corresponding path program 1 times [2023-12-09 14:56:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:56:19,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692811380] [2023-12-09 14:56:19,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:56:19,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:56:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:56:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:56:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:56:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692811380] [2023-12-09 14:56:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692811380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:56:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:56:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:56:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41636519] [2023-12-09 14:56:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:56:19,322 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:56:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:56:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:56:19,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:56:19,323 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-12-09 14:56:19,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 89 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:56:19,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:56:19,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-12-09 14:56:19,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand